Almost 20 years after the original conception, we revisit several fundamental question about modal transition systems. First, we demonstrate the incompleteness of the standard modal refinement using a counterexample due to Hüttel. Deciding any refinement, complete with respect to the standard notions of implementation, is shown to be computationally hard (co-NP hard). Second, we consider four forms of consistency (existence of implementations) for modal specifications. We characterize each operationally, giving algorithms for deciding, and for synthesizing implementations, together with their complexities. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Larsen, K. G., Nyman, U., & Wa̧sowski, A. (2007). On modal refinement and consistency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4703 LNCS, pp. 105–119). Springer Verlag. https://doi.org/10.1007/978-3-540-74407-8_8
Mendeley helps you to discover research relevant for your work.