Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete

Modal transition systems (MTS), a specification formalism introduced more than 20 years ago, has recently received a considerable attention in several different areas. Many of the fundamental questions related to MTSs have already been answered. However, the problem of the exact computational complexity of thorough refinement checking between two finite MTSs remained unsolved. We settle down this question by showing EXPTIME-completeness of thorough refinement checking on finite MTSs. The upper-bound result relies on a novel algorithm running in single exponential time providing a direct goal-oriented way to decide thorough refinement. If the right-hand side MTS is moreover deterministic, or has a fixed size, the running time of the algorithm becomes polynomial. The lower-bound proof is achieved by reduction from the acceptance problem of alternating linear bounded automata and the problem remains EXPTIME-hard even if the left-hand side MTS is fixed.

[1]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[2]  Roberto Passerone,et al.  Why Are Modalities Good for Interface Theories? , 2009, 2009 Ninth International Conference on Application of Concurrency to System Design.

[3]  Kim G. Larsen,et al.  EXPTIME-complete Decision Problems for Modal and Mixed Specifications , 2009, EXPRESS.

[4]  Radha Jagadeesan,et al.  Abstraction-Based Model Checking Using Modal Transition Systems , 2001, CONCUR.

[5]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[6]  Kim G. Larsen,et al.  20 Years of Modal and Mixed Specifications , 2008, Bull. EATCS.

[7]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[8]  J. Gabarró,et al.  Deciding bisimilarity isP-complete , 1992, Formal Aspects of Computing.

[9]  Nathalie Bertrand,et al.  Refinement and Consistency of Timed Modal Specifications , 2009, LATA.

[10]  Petr Jancar,et al.  Behavioural Equivalences on Finite-State Systems are PTIME-hard , 2005, Comput. Artif. Intell..

[11]  Thomas A. Henzinger,et al.  The Embedded Systems Design Challenge , 2006, FM.

[12]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[13]  Marsha Chechik,et al.  Merging partial behavioural models , 2004, SIGSOFT '04/FSE-12.

[14]  José L. Balcázar,et al.  Deciding Bisimilarity is P-Complete , 1992, Formal Aspects Comput..

[15]  Harald Fecher,et al.  Comparing disjunctive modal transition systems with an one-selecting variant , 2008, J. Log. Algebraic Methods Program..

[16]  Sebastián Uchitel,et al.  MTSA: The Modal Transition System Analyser , 2008, 2008 23rd IEEE/ACM International Conference on Automated Software Engineering.

[17]  Marsha Chechik,et al.  Mixed Transition Systems Revisited , 2008, VMCAI.

[18]  Kim G. Larsen,et al.  On determinism in modal transition systems , 2009, Theor. Comput. Sci..

[19]  Flemming Nielson,et al.  Modal Abstractions of Concurrent Behaviour , 2008, SAS.

[20]  Jean-Baptiste Raclet,et al.  Residual for Component Specifications , 2008, Electron. Notes Theor. Comput. Sci..

[21]  Kim G. Larsen,et al.  Complexity of Decision Problems for Mixed and Modal Specifications , 2008, FoSSaCS.

[22]  Thomas A. Henzinger,et al.  The Discipline of Embedded Systems Design , 2007, Computer.

[23]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[24]  Radha Jagadeesan,et al.  Modal Transition Systems: A Foundation for Three-Valued Program Analysis , 2001, ESOP.

[25]  Sebastián Uchitel,et al.  MTSA: Eclipse support for modal transition systems construction, analysis and elaboration , 2007, eclipse '07.

[26]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[27]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.