A characterization of regular expressions under bisimulation

Journal of the ACM

Volumn 54, Issue 2, 2007, Pages

  Baeten, J C M ^a   Corradini, F ^b   Grabmayer, C A ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF CAMERINO   (Italy)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Bisimulation equivalence; Regular expressions

Indexed keywords

FINITE AUTOMATA; MATHEMATICAL OPERATORS;

BISIMULATION EQUIVALENCE; REGULAR EXPRESSIONS;

PROBLEM SOLVING;

EID: 34247188019     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1219092.1219094     Document Type: Article

References (32)

1. ACETO, L., FOKKINK, W., AND VERHOEF, C. 2001. Structural operational semantics. In Handbook of Process Algebra, J. Bergstra, A. Ponse, and S. Smolka, Eds. Elsevier Science, Amsterdam, The Netherlands, 197-292.
2. BAETEN, J., AND BERGSTRA, J. 1988. Global renaming operators in concrete process algebra. Inf. Comput. 78, 205-245.
3. BAETEN, J., AND BERGSTRA, J. 1990. Process algebra with a zero object. In Proceedings CONCUR'90, J. Baeten and J. Klop, Eds. Lecture Notes in Computer Science, vol. 458. Springer-Verlag, New York, 83-98.
4. BAETEN, J., BERGSTRA, J., AND KLOP, J. 1987. On the consistency of Koomen's fair abstraction rule. Theoret. Comput. Sci. 51, 1/2, 129-176.
5. BAETEN, J., BERGSTRA, J., AND KLOP, J. 1993. Decidability of bisimulation equivalence for processes generating context-free languages. J. ACM 40, 3, 653-682.
6. BAETEN, J., AND CORRADINI, F. 2005. Regular expressions in process algebra. In Proceedings LICS'05. IEEE Computer Society Press, Los Alamitos, CA, 12-19. (Also report CS-R 05-11, Computer Science, Technische Universiteit Eindhoven.)
7. BAETEN, J., AND VERHOEF, C. 1995. Concrete process algebra. In Handbook of Logic in Computer Science, S. Abramsky, D. Gabbay, and T. Maibaum, Eds. Vol. 4. Oxford University Press, Oxford, UK, 149-269.
8. BAETEN, J., AND WEIJLAND, W. 1990. Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, MA.
9. BERGSTRA, J., BETHKE, I., AND PONSE, A. 1994. Process algebra with iteration and nesting. Comput. J. 37, 4, 243-258.
10. BERGSTRA, J., FOKKINK, W., AND PONSE, A. 2001. Process algebra with recursive operations. In Handbook of Process Algebra, J. Bergstra, A. Ponse, and S. Smolka, Eds. Elsevier Science, Amsterdam, The Netherlands, 333-390.
11. BERGSTRA, J., AND KLOP, J. 1984. The algebra of recursively defined processes and the algebra of regular processes. In Proceedings 11th ICALP, J. Paredaens, Ed. Lecture Notes in Computer Science, vol. 172. Springer-Verlag, New York, 82-95.
12. BOSSCHER, D. 1997. Grammars modulo bisimulation. Ph.D. University of Amsterdam, Amsterdam, The Netherlands.
13. CORRADINI, F. 2000. A step forward towards equational axiomatizations of Milner bisimulation in Kleene star. In Proceedings FICS 2000.
14. CORRADINI, F., DE NICOLA, R., AND LABELLA, A. 2002. An equational axiomatization of bisimulation over regular expressions. J. Logic Comput. 12, 301-320.
15. DE NICOLA, R., AND LABELLA, A. 2003. Nondeterministic regular expressions as solutions of equational systems. Theoret. Comput. Sci. 203, 179-189.
16. EGGAN, L. 1963. Transition graphs and the star-height of regular events. Mich. Math. J. 20, 385-397.
17. HASHIGUCHI, K. 1983. Representation theorems on regular languages. J. Comput. Syst. Sci. 27, 101-105.
18. HIRSHFELD, Y., AND MOLLER, F. 1996. Decidability results in automata and process theory. In Proceedings of Logics for Concurrency: Automata versus Structure. The VIII Banff Higher Order Workshop, G. Birtwistle and F. Moller, Eds. Lecture Notes in Computer Science, vol. 1043. Springer-Verlag, New York, 102-148.
19. HIRSHFELD, Y., AND MOLLER, F. 2000. On the star height of unary regular behaviours. In Proof, Language, and Interaction (Essays in Honour of Robin Milner), G. Plotkin, C. Stirling, and M. Tofte, Eds. Foundations of Computing. MIT Press, Cambridge, MA, Chapter 16, 497-509.
20. HOARE, C. 1985. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, NJ.
21. MCNAUGHTON, R. 1966. The loop complexity of regular events. Tech. Rep., Machine Structures Group Memo 18, MIT, Cambridge, MA.
22. MILNER, R. 1984. A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci. 28, 3, 439-466.
23. MILNER, R. 1989. Communication and Concurrency. Prentice Hall, Englewood Cliffs, NJ.
24. PIN, J.-E., STRAUBING, H., AND THÉRIEN, D. 2001. Some results on the generalized star-height problem. Inf. Comput. 101, 2, 219-250.
25. PLOTKIN, G. 2004. A structural approach to operational semantics. J. Logic Algeb. Prog. 60, 17-139. (Reprint from 1981 in Special Issue on Structural Operational Semantics.)
26. SÉNIZERGUES, G. 2001. L(A)=L(B)? decidability results from complete formal systems. Theoret. Comput. Sci. 251, 1-166.
27. SEWELL, P. 1997. Nonaxiomatisability of equivalences over finite state processes. Ann. Pure Appl. Logic 90, 163-191.
28. STIRLING, C. 2001. Decidability of DPDA equivalence. Theoret. Comput. Sci. 255, 1-31.
29. TERESE. 2003. Term Rewriting Systems. Number 55 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press.
30. TROEGER, D. 1993. Step bisimulation is pomset equivalence on a parallel language without explicit internal choice. Math. Struct. Comput. Sci. 3, 1, 25-62.
31. VAN BEEK, D., MAN, K., RENIERS, M., ROODA, J., AND SCHIFFELERS, R. 2006. Syntax and consistent equation semantics of hybrid chi. J. Logic Algeb. Prog. 68, 1/2, 129-210.
32. VAN GLABBEEK, R. 2001. The linear time - Branching time spectrum I. The semantics of concrete, sequential processes. In Handbook of Process Algebra, J. Bergstra, A. Ponse, and S. Smolka, Eds. Elsevier Science, Amsterdam, The Netherlands, 3-100.