NP-completeness of the supervisor synthesis problem for unrestricted CTL specifications

Bhubaneswar Mishra, Marco Antoniotti

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish (US)
Title of host publicationWorkshop on discrete event systems
Subtitle of host publicationWODES '96 Edinburgh, Scotland, UK August 19-21, 1996
StatePublished - 1996

Cite this

Mishra, B., & Antoniotti, M. (1996). NP-completeness of the supervisor synthesis problem for unrestricted CTL specifications. In Workshop on discrete event systems: WODES '96 Edinburgh, Scotland, UK August 19-21, 1996