Abstract
We consider decision problems for modal and mixed transition systems used as specifications: the common implementation problem (whether a set of specifications has a common implementation), the consistency problem (whether a single specification has an implementation), and the thorough refinement problem (whether all implementations of one specification are also implementations of another one). Common implementation and thorough refinement are shown to be PSPACE-hard for modal, and so also for mixed, specifications. Consistency is PSPACE-hard for mixed, while trivial for modal specifications. We also supply upper bounds suggesting strong links between these problems. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Antonik, A., Huth, M., Larsen, K. G., Nyman, U., & Wa̧sowski, A. (2008). Complexity of decision problems for mixed and modal specifications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4962 LNCS, pp. 112–126). https://doi.org/10.1007/978-3-540-78499-9_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
