A menagerie of non-finitely based process semantics over BPA* — from ready simulation to completed traces

Mathematical Structures in Computer Science

Volumn 8, Issue 3, 1998, Pages 193-230

  Aceto, Luca ^a   Fokkink, Wan ^b   Ingolfsdottir, Anna ^a  

^a DANISH NATIONAL RESEARCH FOUNDATION   (Denmark)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001550397     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129597002491     Document Type: Article

References (69)

1. Aceto L. (1994) On Axiomatising finite concurrent processes'. SIAM Journal on Computing 23 (4) 852–863.
2. Aceto, L., Fokkink, W. J. and Ingolfsdottir, A. (1996) An equational axiomatization for multi-exit iteration Research Report RS-96-22, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Computer Science, Aalborg University, June 1996. (To appear in Information and Computation. Available by anonymous ftp at the address ftp.brics. aau. dk in the directory pub/BRICS/RS/96/22.)
3. Aceto, L., Fokkink, W. J. and Ingolfsdottir, A. (1996 On a question of A. Salomaa: The equational theory of regular expressions over a singleton alphabet is not finitely based. Research Report RS-96-36, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation) Department of Mathematics and Computer Science, Aalborg University, October 1996. (To appear in Theoretical Computer Science. Available by anonymous ftp at the address ftp.brics. aau. dk in the directory pub/BRICS/RS/96/36.)
4. Aceto, L. Glabbeek van, R., Fokkink, W.J. Ingolfsdottir, A. (1996). Axiomatizing prefix iteration with silent steps. Information and Computation 127 26–40.
5. Aceto, L. and Groote, J. F. (1995). A complete equational axiomatization for MPA with string iteration. Research Report RS-95-28, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Mathematics and Computer Science, Aalborg University, May 1995. (Available by anonymous ftp at the address ftp.brics. aau. dk in the directory pub/BRICS/RS/95/28.)
6. Aceto, L. and Ingolfsdottir, A. (1996) An equational axiomatization of observation congruence for prefix iteration. Wirsing, M. and Nivat, M. (eds.) Algebraic Methodology and Software Tech-nology: 5th International Conference, AMAST '96 Munich, Germany. Springer-Lecture Notes in Computer Science 1101 195–209. (Full version available as BRICS Report RS-95-5, January 1995.)
7. Austry, D. and Boudol, G. (1984). Algebre de processus et synchronisations. Theoretical Comput. Sci. 30 91–131.
8. Baeten, J., Bergstra, J. and Klop, J. (1993) Decidability of bisimulation equivalence for processes generating context-free languages. J. Assoc. Comput. Mach. 40 (1993) 653–682.
9. Baeten, J. and Weijland, W. (1990) Process Algebra Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press.
10. Bergstra, J., Bethke, I. and Ponse, A. (1994) Process algebra with iteration and nesting. Computer Journal 37 243–258.
11. Bergstra, J., Bethke, I. and Ponse, A. (1994). Process algebra with iteration and nesting Computer Journal 37: 243–258
12. Bergstra, J. and Klop, J. (1982). Fixed point semantics in process algebras. Report IW 206, Mathe-matisch Centrum, Amsterdam.
13. Bergstra, J. and Klop, J. (1985). Algebra of communicating processes with abstraction. Theoretical Comput. Sci. 37 77–121.
14. Bloom, B., Istrail, S. and Meyer, A. R. (1995). Bisimulation can't be traced. J. Assoc. Comput. Mach. 42 232–268.
15. Bloom S.L. (1976). Varieties of ordered algebras J. Comput. System Sci. 13 200–212.
16. Bloom, S. L. and Esik, Z. (1993b) Iteration Theories: The Equational Logic of Iterative Processes. In: Brauer, W., Rozenberg, G. and Salomaa A. (eds.) EATCS Monographs on Theoretical Computer Science, Springer-Verlag.
17. Bloom S.L. Esik Z. (1993). Iteration Theories: The Equational Logic of Iterative Processes. In: Brauer, W., Rozenberg, G. and Salomaa A. (eds. EATCS Monographs on Theoretical Computer Science, Springer-Verlag.
18. Bloom S.L. Esik Z. 1994. Iteration algebras of finite state process behaviours (Unpublished manuscript. Available by anonymous ftp from menger. eecs. stevens-tech. edu in the directory /pub/bloom/papers/processes.)
19. Bonnier-Rigny, A. and Krob, D. (1994) A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring. Theoretical Comput. Sci. 134 27–50.
20. Conway, J. H. (1971) Regular Algebra and Finite Machines, Mathematics Series (Brown, R. and De Wet, J. (eds.)), Chapman and Hall, London.
21. Copi I., Elgot, C. and Wright, J. (1958) Realization of events by logical nets. J. Assoc. Comput. Mach. 5 181–196.
22. Corradini, F., De Nicola, R. and Labella, A. (1995) Fully abstract models for nondeterministic Kleene algebras (extended abstract). In: Lee, I. and Smolka, S. (eds.) Proceedings CONCUR 95, Philadelphia, USA. Springer-Verlag Lecture Notes in Computer Science 962 130–144.
23. Crvenkovic, S. and Madarasz, R. (1993) On Kleene algebras. Theoretical Comput. Sci. 108 17–24.
24. De Nicola, R. and Labella, A. (1994) A completeness theorem for nondeterministic Kleene algebras. In: Proceedings of MFCS ’94. Springer-Verlag Lecture Notes in Computer Science 841 536–545.
25. Eilenberg, S. (1974) Automata, Languages, and Machines. Pure and Applied Mathematics 59-A, Academic Press.
26. Esik, Z. (1988) Independence of the equational axioms for iteration theories. J. Comput. System Sci. 36 66–76.
27. Esik, Z. (1995) Group axioms for iteration. (Unpublished manuscript.)
28. Esik, Z. (1996) Personal communication, May 1996.
29. Esik, Z. and Bernatsky, L. (1995) Equational properties of Kleene algebras of relations with conversion. Theoretical Comput. Sci. 137 237–251.
30. Fokkink, W. J. (1994) A complete equational axiomatization for prefix iteration. Inf. Process. Lett. 52 333–337.
31. Fokkink, W. J. (1996a) A complete axiomatization for prefix iteration in branching bisimulation Fundamenta Informaticae 26 103–113.
32. Fokkink, W. J. (1996b) On the completeness of the equations for the Kleene star in bisimulation. In: Wirsing, M. and Nivat, M. (eds.) Algebraic Methodology and Software Technology: 5th International Conference, AMAST ’96, Munich, Germany. Springer-Verlag Lecture Notes in Computer Science 1101 180–194. (A full version of the paper is available by anonymous ftp from phil.ruu.nl as logic/PREPRINTS/preprintl41.ps.)
33. Fokkink, W.J. and Zantema, H. (1994) Basic process algebra with iteration: Completeness of its equational axioms. Computer Journal 37 259–267.
34. Fokkink, W.J. and Zantema, H. (1997) Termination modulo equations by abstract commutation with an application to iteration. Theoretical Comput. Sci. 177 407–423.
35. Gischer, J. F. (1988) The equational theory of pomsets. Theoretical Comput. Sci. 61 199–224.
36. van Glabbeek, R. J. (1990a) The linear time - branching time spectrum. In: Baeten, J. and Klop, J. (eds.) Proceedings CONCUR 90, Amsterdam. Springer-Verlag Lecture Notes in Computer Science 458 278–297.
37. van Glabbeek, R. J. (1990b) Comparative Concurrency Semantics and Refinement of Actions, Ph.D. thesis, Free University, Amsterdam.
38. van Glabbeek, R. J. (1993a) The linear time - branching time spectrum II: the semantics of sequential processes with silent moves. In: Best, E. (ed.) Proceedings CONCUR 93, Hildesheim, Germany. Springer-Verlag Lecture Notes in Computer Science 715 66–81.
39. van Glabbeek, R. J. (1993b) Full abstraction in structural operational semantics (extended ab-stract). In: Nivat, M., Rattray, C., Rus, T. and Scollo, G. (eds.) Proceedings of the Third Inter-national Conference on Algebraic Methodology and Software Technology (AMAST ’93), Twente, The Netherlands, Workshops in Computing, Springer-Verlag 77–84. Groote, J. F. and Vaandrager, F. (1992) Structured operational semantics and bisimulation as a congruence. Information and Computation 100 202–260.
40. Hennessy, M. (1988a) Algebraic Theory of Processes, MIT Press.
41. Hennessy, M. (1988b) Axiomatising finite concurrent processes. SIAM Journal on Computing 17 (5) 997–1017.
42. Hoare, C. (1982) Specifications, programs and implementations, Technical Monograph PRG-29, Programming Research Group, Oxford University.
43. Hoare, C. (1985) Communicating Sequential Processes, Prentice-Hall International.
44. Jonsson, B. (1988) The theory of binary relations. In: Algebraic Logic, Colloquia Mathematica Societatis Janos Bolyai 54, North-Holland 245–292.
45. Keller, R. (1976) Formal verification of parallel programs. Comm. ACM 19 371–384.
46. Kleene, S. (1956) Representation of events in nerve nets and finite automata. In: Shannon, C. and McCarthy, J. (eds.) Automata Studies, Princeton University Press 3–41.
47. Kozen, D. (1994) A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110 366–390.
48. Krob, D. (1991) Complete systems of B-rational identities. Theoretical Comput. Sci. 89 207–343.
49. Krob, D. (1992) Models of a K-rational identity system. J. Comput. System Sci. 45 396–434.
50. Larsen, K. G. and Skou, A. (1991) Bisimulation through probabilistic testing. Information and Computation 94 1–28.
51. Milner, R. (1980) A Calculus of Communicating Systems. Springer-Verlag Lecture Notes in Computer Science 92 1980.
52. Milner, R. (1983) Calculi for synchrony and asynchrony. Theoretical Comput. Sci. 25 267–310.
53. Milner, R. (1984) A complete inference system for a class of regular behaviours. J. Comput. System Sci. 28 439–466.
54. Milner, R. (1989a) Communication and Concurrency, Prentice-Hall International.
55. Milner, R. (1989b) A complete axiomatisation for observational congruence of finite-state behaviors. Information and Computation 81 227–247.
56. Moller, F. (1989) Axioms for Concurrency, Ph.D. thesis, Report CST-59-89, Department of Computer Science, University of Edinburgh.
57. Niven, I. and Zuckerman, H. (1966) An Introduction to the Theory of Numbers (2nd edition), John Wiley and Sons.
58. Olderog, E.-R. and Hoare, C. (1986) Specification-oriented semantics for communicating processes. Acta Inf. 23 9–66.
59. th GI Conference, Karlsruhe, Germany. Springer-Verlag Lecture Notes in Computer Science 104 167—183.
60. Plotkin, G. (1981) A structural approach to operational semantics, Report DAIMI FN-19, Computer Science Department, Aarhus University.
61. Pratt, V. R. (1990) Action logic and pure induction. In: van Eijck, J. (ed.) Proceedings Logics in Al (European Workshop JELIA ’90). Springer-Verlag Lecture Notes in Computer Science 478 97–120.
62. Redko, V. (1964a) On defining relations for the algebra of regular events. Ukrainskii Matematicheskii Zhurnal. 16 120–126. (In Russian.)
63. Redko, V. (1964b) On the algebra of commutative events. Ukrainskii Matematicheskii Zhurnal 16 185–195. (In Russian.)
64. th Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, New York, IEEE 140–149.
65. Salomaa, A. (1969) Theory of Automata, International Series of Monographs in Pure and Applied Mathematics (Sneddon, I. N. and Stark, M. (eds.)) 100, Pergamon Press, Oxford.
66. Salomaa, A. (1996) Personal communication, June 1996.
67. th Annual Symposium on Logic in Computer Science, Paris, France, IEEE Computer Society Press 62–70.
68. Sewell, P. (1996) Nonaxiomatisability of equivalences over finite state processes. (Draft paper available from the World Wide Web at the URL http://www.cl.cam.ac.uk/users/pes20/. To appear in Annals of Pure and Applied Logic.)
69. Vrancken J. (1997) The algebra of communicating processes with empty process. Theoretical Comput. Sci. 177 287–328.