Conflict-preserving abstraction of discrete event systems using annotated automata

Authors:
Simon Ware;Robi Malik
Affiliations:
Department of Computer Science, University of Waikato, Hamilton, New Zealand;Department of Computer Science, University of Waikato, Hamilton, New Zealand
Venue:
Discrete Event Dynamic Systems
Year:
2012

Citing 9
Cited 0

Communicating sequential processes

Communicating sequential processes
Specification-oriented semantics for communicating processes

Acta Informatica
An implementation of an efficient algorithm for bisimulation equivalence

Science of Computer Programming
Minimizing the number of transitions with respect to observation equivalence

BIT
Model checking

Model checking
Communication and Concurrency

Communication and Concurrency
Fair testing

Information and Computation
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)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes to enhance compositional verification of the nonblocking property of discrete event systems by introducing annotated automata. Annotations store nondeterministic branching information, which would otherwise be stored in extra states and transitions. This succinct representation makes it easier to simplify automata and enables new efficient means of abstraction, reducing the size of automata to be composed and thus the size of the synchronous product state space encountered in verification. The abstractions proposed are of polynomial complexity, and they have been successfully applied to model check the nonblocking property of the same set of large-scale industrial examples as used in related work.