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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.