From Natural Projection to Partial Model Checking and Back

Specification decomposition is a theoretically interesting and practically relevant problem for which two approaches were independently developed by the control theory and verification communities: natural projection and partial model checking. In this paper we show that, under reasonable assumptions, natural projection reduces to partial model checking and, when cast in a common setting, the two are equivalent. Aside from their theoretical interest, our results build a bridge whereby the control theory community can reuse algorithms and results developed by the verification community. In addition, we present an algorithm and a tool for the partial model checking of finite-state automata that can be used as an alternative to natural projection.

[1]  W. M. Wonham,et al.  On the Computation of Natural Observers in Discrete-Event Systems , 2006, CDC.

[2]  Rong Su,et al.  Global and local consistencies in distributed fault diagnosis for discrete-event systems , 2005, IEEE Transactions on Automatic Control.

[3]  Fabio Martinelli,et al.  A framework for automatic generation of security controller , 2012, Softw. Test. Verification Reliab..

[4]  Stéphane Lafortune,et al.  Bridging the Gap between Supervisory Control and Reactive Synthesis: Case of Full Observation and Centralized Control , 2014, WODES.

[5]  T. Moor,et al.  libFAUDES — An open source C++ library for discrete event systems , 2008, 2008 9th International Workshop on Discrete Event Systems.

[6]  Kai C. Wong,et al.  On the Complexity of Projections of Discrete-Event Systems , 1998 .

[7]  P. Ramadge,et al.  On the supremal controllable sublanguage of a given language , 1984, The 23rd IEEE Conference on Decision and Control.

[8]  Jos C. M. Baeten,et al.  Expressiveness modulo bisimilarity of regular expressions with parallel composition , 2016, Math. Struct. Comput. Sci..

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

[10]  Sophie Pinchinat,et al.  Quantified Mu-Calculus for Control Synthesis , 2003, MFCS.

[11]  Jarred Adam Ligatti,et al.  More Enforceable Security Policies , 2002 .

[12]  Tim Muller,et al.  Expressiveness modulo bisimilarity of regular expressions with parallel composition , 2010, Mathematical Structures in Computer Science.

[13]  Samik Basu,et al.  Quotient-based Approach to Control of Nondeterministic Discrete-Event Systems with μ-Calculus Specification , .

[14]  Klaus Schneider,et al.  Combining supervisor synthesis and model checking , 2005, TECS.

[15]  P. Traverso,et al.  A Tool for Controller Synthesis via Symbolic Model Checking , 2006, 2006 8th International Workshop on Discrete Event Systems.

[16]  Colin Stirling,et al.  Modal mu-calculi , 2007, Handbook of Modal Logic.

[17]  Gregor von Bochmann,et al.  On the Construction of Submodule Specifications and Communication Protocols , 1983, TOPL.

[18]  Walter Murray Wonham,et al.  Decentralized supervisory control of discrete-event systems , 1987, Inf. Sci..

[19]  K. Rudie.  The Integrated Discrete-Event Systems Tool , 2006, 2006 8th International Workshop on Discrete Event Systems.

[20]  Lei Feng,et al.  TCT: A Computation Tool for Supervisory Control Synthesis , 2006, 2006 8th International Workshop on Discrete Event Systems.

[21]  Tomás Masopust,et al.  On a structural property in the state complexity of projected regular languages , 2012, Theor. Comput. Sci..

[22]  Radu Mateescu,et al.  Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems , 2012, TACAS.

[23]  Shengbing Jiang,et al.  2080 SHENGBING JIANG AND RATNESH KUMAR , 2006 .

[24]  Jan Friso Groote,et al.  Modeling and Analysis of Communicating Systems , 2014 .

[25]  Fabio Martinelli,et al.  Synthesis of Local Controller Programs for Enforcing Global Security Properties , 2008, 2008 Third International Conference on Availability, Reliability and Security.

[26]  W. Murray Wonham,et al.  Supervisory Control of Discrete-Event Systems , 2018 .

[27]  Henrik Reif Andersen,et al.  Partial Model Checking (Extended Abstract) , 1995, LICS 1995.

[28]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[29]  Roberto Giacobazzi,et al.  States vs. Traces in Model Checking by Abstract Interpretation , 2002, SAS.

[30]  P. Ramadge,et al.  Modular Supervisory Control of Discrete Event Systems , 1988 .

[31]  Igor Walukiewicz,et al.  Games for synthesis of controllers with partial observation , 2003, Theor. Comput. Sci..

[32]  Fred B. Schneider,et al.  Enforceable security policies , 2000, TSEC.

[33]  Gabriele Costa,et al.  Pests: Partial Evaluator Of Simple Transition Systems , 2018 .

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

[35]  Sophie Pinchinat,et al.  Modal Specifications for the Control Theory of Discrete Event Systems , 2007, Discret. Event Dyn. Syst..

[36]  Henrik Reif Andersen,et al.  Partial model checking of modal equations: A survey , 1999, International Journal on Software Tools for Technology Transfer.