Conceptual Design of Discrete-Event Systems Using Templates
Discrete Event Dynamic Systems
State complexity of projected languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On a structural property in the state complexity of projected regular languages
Theoretical Computer Science
Conflict-preserving abstraction of discrete event systems using annotated automata
Discrete Event Dynamic Systems
A process-algebraic semantics for generalised nonblocking
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
| Hi-index | 0.00 |
This paper proposes a compositional approach to verifying whether a large discrete event system is nonblocking. The new approach avoids computing the synchronous product of a large set of finite-state machines. Instead, the synchronous product is computed gradually, and intermediate results are simplified using conflict-preserving abstractions based on process-algebraic results about fair testing. Heuristics are used to choose between different possible abstractions. By translating the problem representation, the same method can also be applied to verify safety properties, in particular, controllability. Experimental results show that the method is applicable to finite-state machine models of industrial scale and brings considerable improvements in performance over other methods for nonblocking verification.