A characterization of regular expressions under bisimulation

We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions, and we show how to determine whether a given finite automaton is in this set. As an application, we consider the star height problem.

[1]  Peter Sewell,et al.  Nonaxiomatisability of Equivalences over Finite State Processes , 1997, Ann. Pure Appl. Log..

[2]  Jan A. Bergstra,et al.  Process Algebra with Recursive Operations , 2001, Handbook of Process Algebra.

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

[4]  K. Hashiguchi,et al.  Representation Theorems on Regular Languages , 1983, J. Comput. Syst. Sci..

[5]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[6]  Chris Verhoef,et al.  Concrete process algebra , 1995, LICS 1995.

[7]  R. V. Glabbeek.  CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes , 2001 .

[8]  D.J.B. Bosscher,et al.  Grammars modulo bisimulation , 1997 .

[9]  Géraud Sénizergues,et al.  L(A) = L(B)? Decidability Results from Complete Formal Systems , 2002, ICALP.

[10]  Jan A. Bergstra,et al.  Process Algebra with a Zero Object , 1990, CONCUR.

[11]  Géraud Sénizergues,et al.  L(A) = L(B) ? decidability results from complete formal systems , 2001 .

[12]  Rocco De Nicola,et al.  Nondeterministic regular expressions as solutions of equational systems , 2003, Theor. Comput. Sci..

[13]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[14]  Jan A. Bergstra,et al.  Global Renaming Operators in Concrete Process Algebra , 1988, Inf. Comput..

[15]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[16]  Faron Moller,et al.  On the star height of unary regular behaviours , 2000, Proof, Language, and Interaction.

[17]  Colin Stirling,et al.  Decidability of DPDA equivalence , 2001, Theor. Comput. Sci..

[18]  Douglas R. Troeger.  Step bisimulation is pomset equivalence on a parallel language without explicit internal choice , 1993, Mathematical Structures in Computer Science.

[19]  A. Salomaa.  Regular expression , 2003 .

[20]  Robert McNaughton,et al.  The loop complexity of regular events , 1969, Inf. Sci..

[21]  Jan A. Bergstra,et al.  Process Algebra with Iteration and Nesting , 1994, Comput. J..

[22]  Jan A. Bergstra,et al.  The Algebra of Recursively Defined Processes and the Algebra of Regular Processes , 1984, ICALP.

[23]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[24]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[25]  Jan A. Bergstra,et al.  Decidability of bisimulation equivalence for process generating context-free languages , 1987, JACM.

[26]  Jos C. M. Baeten,et al.  Regular expressions in process algebra , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[27]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[28]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[29]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[30]  L. Eggan.  Transition graphs and the star-height of regular events. , 1963 .

[31]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[32]  Rocco De Nicola,et al.  An Equational Axiomatization of Bisimulation over Regular Expressions , 2002, J. Log. Comput..

[33]  Howard Straubing,et al.  Some Results on the Generalized Star-Height Problem , 1992, Inf. Comput..

[34]  Ka Lok Man,et al.  Syntax and consistent equation semantics of hybrid Chi , 2006, J. Log. Algebraic Methods Program..

[35]  Faron Moller,et al.  Decidability Results in Automata and Process Theory , 1996, Banff Higher Order Workshop.

[36]  Terese.  Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.