Decidability of Behavioral Equivalences in Process Calculi with Name Scoping

Local channels and their name scoping rules play a significant role in the study of the expressiveness of process calculi. The paper contributes to the understanding of the expressiveness in the context of CCS by studying the decidability issues of the bisimilarity/similarity checking problems. The strong bisimilarity for a pair of processes in the calculi with only static local channels is shown Π01-complete. The strong bisimilarity between those processes and the finite state processes is proved decidable. The strong similarity between the finite state processes and the processes without name-passing capability is also shown decidable.

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

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

[3]  Frank D. Valencia,et al.  CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence , 2007, APLAS.

[4]  Frank Thilly,et al.  The Theory of Interaction , 1901 .

[5]  Jirí Srba,et al.  Undecidability of bisimilarity by defender's forcing , 2008, JACM.

[6]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[7]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

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

[9]  Frank D. Valencia,et al.  On the Expressive Power of Restriction and Priorities in CCS with Replication , 2009, FoSSaCS.

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

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

[12]  Maurizio Gabbrielli,et al.  Replication vs. Recursive Definitions in Channel Based Calculi , 2003, ICALP.

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

[14]  Antonín Kucera,et al.  Equivalence-checking on infinite-state systems: Techniques and results , 2002, Theory and Practice of Logic Programming.

[15]  Faron Moller,et al.  Decidable Subsets of CCS , 1994, Comput. J..

[16]  Dirk Taubner,et al.  Finite Representations of CCS and TCSP Programs by Automata and Petri Nets , 1989, Lecture Notes in Computer Science.

[17]  Maurizio Gabbrielli,et al.  On the expressive power of recursion, replication and iteration in process calculi , 2009, Mathematical Structures in Computer Science.

[18]  Irène Guessarian.  Semantics of Systems of Concurrent Processes , 1990, Lecture Notes in Computer Science.

[19]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[20]  Antonín Kucera,et al.  Deciding bisimulation-like equivalences with finite-state processes , 2001, Theor. Comput. Sci..

[21]  Ursula Goltz.  CCS and Petri Nets , 1990, Semantics of Systems of Concurrent Processes.

[22]  Yuxi Fu,et al.  On the expressiveness of interaction , 2010, Theor. Comput. Sci..

[23]  C. A. Petri,et al.  Concurrency Theory , 1986, Advances in Petri Nets.

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

[25]  Maurizio Gabbrielli,et al.  Comparing Recursion, Replication, and Iteration in Process Calculi , 2004, ICALP.

[26]  Jirí Srba,et al.  Roadmap of Infinite Results , 2002, Bull. EATCS.

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

[28]  Frank D. Valencia,et al.  On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi , 2004, FoSSaCS.

[29]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[30]  Faron Moller,et al.  Techniques for Decidability and Undecidability of Bisimilarity , 1999, CONCUR.

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

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

[33]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[34]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

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

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

[37]  Ivan Lanese,et al.  Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA , 2008, LICS.