Communicating sequential processes
Communicating sequential processes
Algebraic theory of processes
Model checking
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Supervisory Control of Distributed Systems: Conflict Resolution
Discrete Event Dynamic Systems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Compositional Verification in Supervisory Control
SIAM Journal on Control and Optimization
Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
Generalised nonblocking is a weak liveness property to express the ability of a system to terminate under given preconditions. This paper studies the notions of equivalence and refinement that preserve generalised nonblocking and proposes a semantic model that characterises generalised nonblocking equivalence. The model can be constructed from the transition structure of an automaton, and has a finite representation for every finite-state automaton. It is used to construct a unique automaton representation for all generalised nonblocking equivalent automata. This gives rise to effective decision procedures to verify generalised nonblocking equivalence and refinement, and to a method to simplify automata while preserving generalised nonblocking equivalence. The results of this paper provide for better understanding of nonblocking in a compositional framework, with possible applications in compositional verification.