On the computational complexity of the verification of modular discrete-event systems

Investigates issues related to the computational complexity of automata intersection problems. For several classes of problems, comparing the behavior of sets of interacting finite automata is found to be PSPACE-complete even in the case of automata accepting prefix-closed languages (equivalently, even when all states are marked). The paper uses these results to investigate the computational complexity of problems related to the verification of supervisory controllers for modular discrete-event systems. Modular discrete-event systems are sets of finite automata combined by the parallel composition operation. We find that a large number of modular discrete-event system verification problems are also PSPACE-complete, even for prefix-closed cases. These results suggest that while system decomposition by parallel composition could lead to significant space savings, it may not lead to sufficient time savings that would aid in the study of "large-scale" systems.

[1]  J. Willems,et al.  The computational complexity of decentralized discrete-event control problems , 1995, IEEE Trans. Autom. Control..

[2]  J. G. Thistle,et al.  Effective control synthesis for DES under partial observations , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[3]  Walter Murray Wonham,et al.  On the complexity of supervisory control design in the RW framework , 2000, IEEE Trans. Syst. Man Cybern. Part B.

[4]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[5]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  R. Malik,et al.  Incremental system verification and synthesis of minimally restrictive behaviours , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[8]  Shengbing Jiang,et al.  Decentralized control of discrete event systems with specializations to local control and concurrent systems , 2000, IEEE Trans. Syst. Man Cybern. Part B.

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

[10]  S. Tripakis,et al.  Undecidable problems of decentralized observation and control , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[11]  Stéphane Lafortune,et al.  A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems , 2002, Discret. Event Dyn. Syst..

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