PSPACE-completeness of Modular Supervisory Control Problems*

ISSN： 0924-6703

Source： Discrete Event Dynamic Systems, Vol.15, Iss.2, 2005-06, pp. : 145-167

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

PSPACE-complete problems for subgroups of free groups and inverse finite automata

By Birget J.-C. Margolis S. Meakin J. Weil P.

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 247-281

Elsevier

Access to resources Recommend Favorite

Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete

By Slany W.

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 829-843

Elsevier

Access to resources Recommend Favorite

Modular proofs for completeness of hierarchical term rewriting systems

By Rao M.R.K.K.

Theoretical Computer Science, Vol. 151, Iss. 2, 1995-11 ,pp. : 487-512

Elsevier

Access to resources Recommend Favorite

Designing communicating transaction processes by supervisory control theory

By Feng L. Wonham W. Thiagarajan P.

Formal Methods in System Design, Vol. 30, Iss. 2, 2007-04 ,pp. : 117-141

Springer Publishing Company

Access to resources Recommend Favorite

Safe Supervisory Control Under Observability Failure

By Sánchez Antonia Montoya Francisco

Discrete Event Dynamic Systems, Vol. 16, Iss. 4, 2006-12 ,pp. : 493-525

Springer Publishing Company

Access to resources Recommend Favorite