Modal Process Rewrite Systems

We consider modal transition systems with infinite state space generated by finite sets of rules. In particular, we extend process rewrite systems to the modal setting and investigate decidability of the modal refinement relation between systems from various subclasses. Since already simulation is undecidable for most of the cases, we focus on the case where either the refined or the refining process is finite. Namely, we show decidability for pushdown automata extending the non-modal case and surprising undecidability for basic parallel processes. Further, we prove decidability when both systems are visibly pushdown automata. For the decidable cases, we also provide complexities. Finally, we discuss a notion of bisimulation over MTS.

[1]  Nancy A. Lynch,et al.  I/o automata: a model for discrete event systems , 1988 .

[2]  Ivana Cerná,et al.  Modal Transition Systems: Composition and LTL Model Checking , 2011, ATVA.

[3]  Kim G. Larsen,et al.  Dual-Priced Modal Transition Systems with Time Durations , 2012, LPAR.

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

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

[6]  Sriram K. Rajamani,et al.  Compositional may-must program analysis: unleashing the power of alternation , 2010, POPL '10.

[7]  Kim Guldstrand Larsen,et al.  Timed Modal Specification —Theory and Tools , 1997 .

[8]  Kim G. Larsen,et al.  Quantitative Refinement for Weighted Modal Transition Systems , 2011, MFCS.

[9]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[10]  Kim G. Larsen,et al.  Generality in design and compositional verification usingTav , 1992, Formal Methods Syst. Des..

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

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

[13]  Piotr Sankowski,et al.  Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings , 2011, MFCS.

[14]  Perdita Stevens,et al.  Modelling Recursive Calls with UML State Diagrams , 2003, FASE.

[15]  Patrice Godefroid,et al.  Generalized Model Checking: Reasoning about Partial State Spaces , 2000, CONCUR.

[16]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[17]  Antonín Kucera,et al.  Simulation Preorder on Simple Process Algebras , 1999, ICALP.

[18]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[19]  Benjamin C. Pierce,et al.  Theoretical Aspects of Computer Software , 2001, Lecture Notes in Computer Science.

[20]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[21]  Faron Moller,et al.  Checking Regular Properties of Petri Nets , 1995, CONCUR.

[22]  Kim G. Larsen,et al.  Compositional Design Methodology with Constraint Markov Chains , 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.

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

[24]  Jirí Srba.  Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation , 2006, CSL.

[25]  Axel Legay,et al.  A Modal Interface Theory for Component-based Design , 2011, Fundam. Informaticae.

[26]  Jan Friso Groote,et al.  Undecidable Equivalences for Basic Process Algebra , 1994, Inf. Comput..

[27]  Kim G. Larsen,et al.  Modal transition systems with weight intervals , 2012, J. Log. Algebraic Methods Program..

[28]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[30]  Luca Aceto,et al.  Graphical representation of covariant-contravariant modal formulae , 2011, EXPRESS.

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

[32]  Glenn Bruns,et al.  An Industrial Application of Modal Process Logic , 1997, Sci. Comput. Program..

[33]  Sundar Sarukkai,et al.  FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings , 2005, FSTTCS.

[34]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

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

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

[37]  Thomas A. Henzinger,et al.  Interface automata , 2001, ESEC/FSE-9.

[38]  Kim G. Larsen,et al.  ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems , 2010, ATVA.

[39]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.

[40]  Kim G. Larsen,et al.  Modal I/O Automata for Interface and Product Line Theories , 2007, ESOP.

[41]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[42]  Richard Mayr.  Process rewrite systems , 1997, EXPRESS.

[43]  Rajeev Alur,et al.  Visibly pushdown languages , 2004, STOC '04.

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

[45]  Nathalie Bertrand,et al.  Modal event-clock specifications for timed component-based design , 2012, Sci. Comput. Program..

[46]  Rolf Hennicker,et al.  Process Refinement and Asynchronous Composition with Modalities , 2010, ACSD/Petri Nets Workshops.

[47]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.

[48]  Kim G. Larsen,et al.  Parametric Modal Transition Systems , 2011, ATVA.

[49]  Kedar S. Namjoshi.  Abstraction for Branching Time Properties , 2003, CAV.

[50]  Alarico Campetelli,et al.  Don't Know for Multi-valued Systems , 2009, ATVA.

[51]  Bart Jacobs,et al.  A Logic for the Java Modeling Language JML , 2001, FASE.

[52]  Antonín Kucera,et al.  On the Complexity of Semantic Equivalences for Pushdown Automata and BPA , 2002, MFCS.

[53]  Hans Hüttel,et al.  Undecidable equivalences for basic parallel processes , 1994, Inf. Comput..

[54]  Patrícia Duarte de Lima Machado,et al.  Unit Testing for CASL Architectural Specifications , 2002, MFCS.

[55]  Axel Legay,et al.  MIO Workbench: A Tool for Compositional Design with Modal Input/Output Interfaces , 2011, ATVA.

[56]  Rolf Hennicker,et al.  Interface Theories for (A)synchronously Communicating Modal I/O-Transition Systems , 2010, FIT.

[57]  Jeannette M. Wing,et al.  A behavioral notion of subtyping , 1994, TOPL.

[58]  K. Namjoshi,et al.  The existence of finite abstractions for branching time model checking , 2004, LICS 2004.

[59]  Antonín Kucera,et al.  Why Is Simulation Harder than Bisimulation? , 2002, CONCUR.

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

[61]  Insup Lee,et al.  CONCUR '95: Concurrency Theory , 1995, Lecture Notes in Computer Science.

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

[63]  Vojtech Rehák,et al.  Reachability of Hennessy-Milner Properties for Weakly Extended PRS , 2005, FSTTCS.

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