Skip to main content
Article thumbnail
Location of Repository

Verifying Modal Formulas over I/O-Automata by means of Type Theory

By M.P.A. Sellink


We introduce the notion of an I/O-automaton over a signature Σ. Beside we introduce a\ud modal logic to reason about such an I/O-automaton. The semantics of the logic is defined in\ud terms of a given Σ-algebra. We illustrate how the question whether or not an execution in a given I/O-automaton is a model for formula ø can be reduced to an inhabitation problem in\ud the Calculus of Inductive Constructions. Furthermore we present a proof for soundness and completeness

Topics: Wijsbegeerte
Year: 1995
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.