Simulating I/o Automata. Trace Properties
نویسندگان
چکیده
I/O automaton is a mathematical model used for synchronous distributed algorithms. I/O automaton is a state machine with very little structure, and with labeled transitions. IOA language was developed for this automata. This article presents the building of a simulator for I/O automata described in a dialect of this language. The use of the simulator is to generate traces of the automata, so that we can verify some of them properties.
منابع مشابه
On the Relationship Between Process
The relation between process algebra and I/O au-tomata models is investigated in a general setting of structured operational semantics (SOS). For a series of (approximations of) key properties of I/O au-tomata, syntactic constraints on inference rules are proposed which guarantee these properties. A rst result is that, in a setting without assumptions about actions, the well-known trace and fai...
متن کاملSpecifying and Verifying External Behaviour of Fair Input/Output Automata by Using the Temporal Logic of Actions
Fair input/output (or I/O) automata are a state-machine model for specifying and verifying reactive and concurrent systems. For the verification purposes, one is usually interested only in the sequences of interactions fair I/O automata offer to their environment. These sequences are called fair traces. The usual approach to the verification consists in proving fair trace inclusion between fair...
متن کاملTrace-Based Semantics for Probabilistic Timed I/O Automata
We propose the Probabilistic Timed I/O Automaton (PTIOA) framework for modelling and analyzing discretely communicating probabilistic hybrid systems. State transition of a PTIOA can be nondeterministic or probabilistic. Probabilistic choices can be based on continuous distributions. Continuous evolution of a PTIOA is purely nondeterministic. PTIOAs can communicate through shared actions. By sup...
متن کاملTraces of I / O - Automata in Isabelle / HOLCFOlaf
This paper presents a formalization of nite and innnite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheory of I/O automata; they are, however, applicable to any trace based model of parallelism which distinguishes internal and external actions. We make use of the logic HOLCF, an extension of HOL with domain theory and show how to ...
متن کاملCharacterizing the Behavior of Reactive Systems by Trace Sets*
The behavior of an asynchronous reactive system can be described by its set of action traces. In this paper, we investigate which properties a trace set fulfills describing a reactive system where input and output actions are distinguished. These properties reflect the fact that, for such a system, input actions can always occur. The required properties are discussed in the light of safety and ...
متن کامل