Seven abstraction rules preserving generalised nonblocking

This working paper proposes a compositional approach to verify the generalised nonblocking property of discrete-event systems. Generalised nonblocking is introduced in [15] to overcome weaknesses of the standard nonblocking check in discrete-event systems and increase the scope of liveness properties that can be handled. This paper addresses the question of how generalised nonblocking can be verified efficiently. The explicit construction of the complete state space is avoided by first composing and simplifying individual components in ways that preserve generalised nonblocking. The paper extends and generalises previous results about compositional verification of standard nonblocking and lists a new set of computationally feasible abstraction rules for standard and generalised nonblocking.

[1]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[2]  W. M. Wonham,et al.  Implementation Considerations in Supervisory Control , 2002 .

[3]  R. Kumar,et al.  Mutually nonblocking supervisory control of discrete event systems , 2000, Autom..

[4]  R. Malik,et al.  Generalised nonblocking , 2008, 2008 9th International Workshop on Discrete Event Systems.

[5]  B. A. Brandin,et al.  The supervisory control of the automated manufacturing system of the AIP , 1994, Proceedings of the Fourth International Conference on Computer Integrated Manufacturing and Automation Technology.

[6]  Robi Malik,et al.  Compositional Verification in Supervisory Control , 2009, SIAM J. Control. Optim..

[7]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[8]  W. M. Wonham,et al.  Multi-tasking supervisory control of discrete-event systems , 2004 .

[9]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[10]  Stéphane Lafortune,et al.  New Results on Testing Modularity of Local Supervisors using Abstractions , 2006, 2006 IEEE Conference on Emerging Technologies and Factory Automation.

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Mark A. Shayman,et al.  Non-blocking supervisory control of nondeterministic discrete event systems , 1994, Proceedings of 1994 American Control Conference - ACC '94.

[13]  Robi Malik,et al.  Conflicts and Fair Testing , 2006, Int. J. Found. Comput. Sci..

[14]  Walter Murray Wonham,et al.  Hierarchical interface-based supervisory Control-part I: serial case , 2005, IEEE Transactions on Automatic Control.

[15]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[16]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[17]  Jean-Claude Fernandez,et al.  An Implementation of an Efficient Algorithm for Bisimulation Equivalence , 1990, Sci. Comput. Program..

[18]  Roland P. Malhamé,et al.  Supervisory Control of Distributed Systems: Conflict Resolution , 2000, Discret. Event Dyn. Syst..

[19]  Walter Murray Wonham,et al.  Hierarchical interface-based supervisory control-part II: parallel case , 2005, IEEE Transactions on Automatic Control.

[20]  Ji Wang,et al.  Reverse Observation Equivalence Between Labelled State Transition Systems , 2004, ICTAC.

[21]  S. Balemi,et al.  Supervisory control of a rapid thermal multiprocessor , 1993, IEEE Trans. Autom. Control..