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 PSPACEhard for mixed, while trivial for modal specifications. We also supply upper bounds suggesting strong links between these problems.
The conference paper REF ) also shows that TR for modal specifications is PSPACE-hard.
Complexity of Decision Problems for Mixed and Modal Specifications ⋆
FoSSaCS
Computer Science