Dynamic Communicating Automata and Branching High-Level MSCs

We study dynamic communicating automata (DCA), an extension of classical communicating finite-state machines that allows for dynamic creation of processes. The behavior of a DCA can be described as a set of message sequence charts (MSCs). While DCA serve as a model of an implementation, we propose branching high-level MSCs (bHMSCs) on the specification side. Our focus is on the implementability problem: given a bHMSC, can one construct an equivalent DCA? As this problem is undecidable, we introduce the notion of executability, a decidable necessary criterion for implementability. We show that executability of bHMSCs is EXPTIME-complete. We then identify a class of bHMSCs for which executability effectively implies implementability.

[1]  R. Meyer.  On Boundedness in Depth in the π-Calculus ⋆ , 2008 .

[2]  Luc Segoufin.  Automata and Logics for Words and Trees over an Infinite Alphabet , 2006, CSL.

[3]  Anca Muscholl,et al.  Infinite-State High-Level MSCs: Model-Checking and Realizability , 2002, ICALP.

[4]  Adriano Peron,et al.  Verification of Well-Formed Communicating Recursive State Machines , 2006, VMCAI.

[5]  Supratik Mukhopadhyay,et al.  Dynamic Message Sequence Charts , 2002, FSTTCS.

[6]  Markus Lohrey,et al.  Realizability of high-level message sequence charts: closing the gaps , 2003, Theor. Comput. Sci..

[7]  Juhani Karhumäki,et al.  Computer Science - Theory and Applications , 2014, Lecture Notes in Computer Science.

[8]  Pascal Weil,et al.  Rationality in Algebras with a Series Operation , 2002, Inf. Comput..

[9]  Benedikt Bollig,et al.  Realizability of Dynamic MSC Languages , 2010, CSR.

[10]  ROBIN MILNER,et al.  Edinburgh Research Explorer A Calculus of Mobile Processes, I , 2003 .

[11]  Madhavan Mukund,et al.  A theory of regular MSC languages , 2005, Inf. Comput..

[12]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[13]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[14]  Manindra Agrawal,et al.  FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science , 2002, Lecture Notes in Computer Science.

[15]  Vladimiro Sassone,et al.  High-Level Petri Nets as Type Theories in the Join Calculus , 2001, FoSSaCS.

[16]  Rajeev Alur,et al.  Realizability and verification of MSC graphs , 2005, Theor. Comput. Sci..

[17]  Andrew D. Gordon,et al.  A Chart Semantics for the Pi-Calculus , 2007, EXPRESS.

[18]  Pascal Weil,et al.  Series-parallel languages and the bounded-width property , 2000, Theor. Comput. Sci..

[19]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

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

[21]  Mohamed Faouzi Atig,et al.  Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads , 2009, TACAS.

[22]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[23]  Helmut Seidl,et al.  Haskell Overloading is DEXPTIME-Complete , 1994, Inf. Process. Lett..

[24]  Rémi Morin,et al.  Recognizable Sets of Message Sequence Charts , 2002, STACS.

[25]  Anca Muscholl,et al.  A Kleene theorem and model checking algorithms for existentially bounded communicating automata , 2006, Inf. Comput..

[26]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .