Parametric Modal Transition Systems

Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcome many of the limitations and we investigate the computational complexity of modal refinement checking.

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

[2]  Kim G. Larsen,et al.  Equation solving using modal transition systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

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

[4]  Kim G. Larsen,et al.  Graphical Versus Logical Specifications , 1990, Theor. Comput. Sci..

[5]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

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

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

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

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

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

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

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

[13]  Martin Leucker,et al.  Modeling and Model Checking Software Product Lines , 2008, FMOODS.

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

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

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

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

[18]  Jan Kretínský,et al.  Process Algebra for Modal Transition Systemses , 2010, MEMICS.

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