Communicating sequential processes
Communicating sequential processes
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Computing with faulty shared memory
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Distributed Algorithms
Symbolic Model Checking
Formal Verification of a Distributed Computer System
Formal Methods in System Design
Modeling and Validating Globally Asynchronous Design in Synchronous Frameworks
Proceedings of the conference on Design, automation and test in Europe - Volume 1
| Hi-index | 0.00 |
The I/O automaton paradigm of Lynch and Tuttle models asynchrony through an interleaving parallel composition.The recognition that such interleaving modelsin fact can be viewed as special cases of synchronous parallelcomposition has been very limited. Let be any set of finite-state I/O automata drawing actions from a fixed finite set containing a subset Δ. In this article we establish a translationT : to a class of ω-automata closed under a synchronous parallel composition, for which Tis monotonic with respect to implementation relative to Δ,and linear with respect to composition. Thus, for A^1, …, A, B^1, …, B ∈ and A = A^1 ‖…‖ A, B = B^1 ‖…‖ B,if Δ is the set of actions common to both A and B, then A implements B (in the sense of I/O automata) if and only if the ω-automaton language containment(T(A^1) ⊗ … ⊗ T(A)) ⊂ (T(B^1) ⊗ … ⊗ T(B)) obtains,where ‖ denotes the interleaving parallel composition on and ⊗ denotes the synchronous parallel composition on . For theclass , we use the L-process model of ω-automata.This result enables one to verify systems specified by I/O automata throughmodel-checkers such as COSPAN or SMV, that operate on models with synchronousparallel composition.The translation technique generalizes to other interleaving models,although in each case, the translation map must match the specific model.