An Equational Axiomatization for Multi-exit Iteration

Information and Computation

Volumn 137, Issue 2, 1997, Pages 121-158

  Aceto, Luca ^a   Fokkink, Wan ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000128341     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2645     Document Type: Article

References (47)

1. Aceto, L., Fokkink, W. J., van Glabbeek, R., and Ingólfsdóttir, A. (1996), Axiomatizing prefix iteration with silent steps, Inform. and Comput. 127, 26-40.
2. 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. [Available by anonymous ftp at the address ftp.brics.aau.dk in the directory pub/BRICS/RS/95/2]
3. Aceto, L., and Ingólfsdóttir, A. (1996), An equational axiomatization of observation congruence for prefix iteration, in "Lecture Notes in Computer Science," Vol. 1101, pp. 195-209, Springer-Verlag, Berlin/New York. [Full version available as BRICS Report RS-95-5, January 1995]
4. Baeten, J., Bergstra, J., and Klop, J. (1993), Decidability of bisimulation equivalence for processes generating context-free languages, J. Assoc. Comput. Mach. 40, 653-682.
5. Baeten, J., and Klop, J., Eds. (1990), "Proceedings CONCUR 90, Amsterdam," Lecture Notes in Computer Science, Vol. 458, Springer-Verlag, Berlin/New York.
6. Baeten, J., and Verhoef, J., A congruence theorem for structured operational semantics, in "Lecture Notes in Computer Science," Vol. 715, pp. 477-492, Springer-Verlag, Berlin/New York.
7. Baeten, J., and Weijland, W. (1990), "Process Algebra," Cambridge Tracts in Theoretical Computer Science 18, Cambridge Univ. Press, Cambridge, UK.
8. Bergstra, J., Bethke, I., and Ponse, A. (1993), "Process Algebra with Iteration," Report CS-R9314, Programming Research Group, University of Amsterdam, 1993. [Available by anonymous ftp at the address fwi.uva.nl as file pub/programming-research/reports/1993/P9314.ps.Z]
9. Bergstra, J., Bethke, I., and Ponse, A. (1994), Process algebra with iteration and nesting, Comput. J. 37, 243-258.
10. Bergstra, J., and Klop J.(1982), "Fixed Point Semantics in Process Algebras," Report IW 206, Mathematisch Centrum, Amsterdam.
11. Bergstra, J., and Klop, J. (1985), Algebra of communicating processes with abstraction, Theoret. Comput. Sci. 37, 77-121.
12. Best, E., Ed. (1993), "Proceedings CONCUR 93, Hildesheim, Germany," Lecture Notes in Computer Science, Vol. 715, Springer-Verlag, Berlin/New York.
13. Bloom, S. L., and Ésik, Z. (1993), Equational axioms for regular sets, Math. Structures Comput. Sci. 3, 1-24.
14. Caucal, D. (1990), Graphes canoniques de graphes algébriques, Theor. Inform. Appl. 24, 339-352.
15. Conway, J. H. (1971), "Regular Algebra and Finite Machines" (R. Brown and J. De Wet, Eds.), Mathematics Series, Chapman & Hall, London.
16. Cooper, D. (1971), Programs for mechanical program verification, in "Machine Intelligence" (B. Meltzer and D. Michie, Eds.), Vol. 6, pp. 43-59, Edinburgh Univ. Press, Edinburgh.
17. Copi, I., Elgot, C., and Wright, J. (1958), Realization of events by logical nets, J. Assoc. Comput. Mach. 5, 181-196.
18. Engeler, E. (1971), Structure and meanings of elementary programs, in "Symposium on Semantics of Algorithmic Languages" (E. Engeler, Ed.), Lecture Notes in Mathematics, Vol. 188, pp. 89-101, Springer-Verlag, Berlin/New York.
19. Fokkink, W., and Glabbeek, R. J. v. (1996), Ntyft/ntyxt rules reduce to ntree rules, Inform. and Comput. 126, 1-10.
20. Fokkink, W. J. (1994), A complete equational axiomatization for prefix iteration, Inform. Process. Lett. 52, 333-337.
21. Fokkink, W. J. (1996), A complete axiomatization for prefix iteration in branching bisimulation, Fund. Informat. 26, 103-113.
22. Fokkink, W. J. (1996), On the completeness of the equations for the Kleene star in bisimulation, in "Lecture Notes in Computer Science," Vol. 1101, pp. 180-194, Springer-Verlag, Berlin/New York. [A full version of the paper is available by anonymous ftp from phil.rau.nl as logic/PREPRINTS/ preprint141.ps]
23. Fokkink, W. J., and Zantema, H. (1994), Basic process algebra with iteration: Completeness of its equational axioms, Comput. J. 37, 259-267.
24. Fokkink, W. J., and Zantema, H. (1995), Prefix iteration in basic process algebra: Applying termination techniques, in "Proceedings ACP 95, Eindhoven" (A. Ponse, C. Verhoef, and B. v. Vlijmen, Eds.), Report CS-95-14, pp. 139-156, Eindhoven University of Technology.
25. Glabbeek R. J. v. (1990), The linear time-branching time spectrum, in "Lecture Notes in Computer Science," Vol. 458, pp. 278-297, Springer-Verlag, Berlin/New York.
26. Glabbeek, R. J.v. (1993), A complete axiomatization for branching bisimulation congruence of finite-state behaviours, in "Mathematical Foundations of Computer Science 1993, Gdansk, Poland" (A. Borzyszkowski and S. Sokołowski, Eds.), Lecture Notes in Computer Science, Vol. 711, pp. 473-484, Springer-Verlag, Berlin/New York. [Available by anonymous ftp from Boole. stanford.edu]
27. Glabbeek, R. J. v. (1993), The linear time-branching time spectrum. II. The semantics of sequential processes with silent moves, in "Lectures Notes in Computer Science," Vol. 715, pp. 66-81, Springer-Verlag, Berlin/New York.
28. Groote, J. F. (1990), A new strategy for proving ω-completeness with applications in process algebra, in "Lecture Notes in Computer Science," Vol. 458, pp. 314-331, Springer-Verlag, Berlin/ New York.
29. Hoare, C. (1985), "Communicating Sequential Processes," Prentice-Hall International, Englewood Cliffs, NJ.
30. Keller, R. (1976), Formal verification of parallel programs, Comm. ACM 19, 371-384.
31. Kleene, S. (1956), Representation of events in nerve nets and finite automata, in "Automata Studies" (C. Shannon and J. McCarthy, Eds.), pp. 3-41, Princeton Univ. Press, Princeton, NJ.
32. Kozen, D. (1994), A completeness theorem for Kleene algebras and the algebra of regular events, Inform. and Comput. 110, 366-390.
33. Krob, D. (1991), Complete systems of B-rational identities, Theoret. Comput. Sci. 89, 207-343.
34. Manna, Z. (1974), "Mathematical Theory of Computation," McGraw-Hill, New York.
35. Milner, R. (1980), "A Calculus of Communicating Systems," Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, Berlin/New York.
36. Milner, R. (1984), A complete inference system for a class of regular behaviours, J. Comput. System Sci. 28, 439-466.
37. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall International, Englewood Cliffs, NJ.
38. Milner, R. (1989), A complete axiomatisation for observational congruence of finite-state behaviors, Inform. and Comput. 81, 227-247.
39. Park, D. (1981), Concurrency and automata on infinite sequences, in "5th GI Conference, Karlsruhe, Germany" (P. Deussen, Ed.), Lecture Notes in Computer Science, Vol. 104, pp. 167-183, Springer-Verlag, Berlin/New York.
40. Perrin, D. (1990), Finite automata, in "Handbook of Theoretical Computer Science. Vol. B. Formal Models and Semantics" (J. van Leeuwen, Ed.), Chap. 1, pp. 1-57, Elsevier, Amsterdam.
41. Plotkin, G. (1981), "A Structural Approach To Operational Semantics," Report DAIMI FN-19, Computer Science Department, Aarhus University.
42. Salomaa, A. (1966), Two complete axiom systems for the algebra of regular events, J. Assoc. Comput. Mach. 13, 158-169.
43. Salomaa, A. (1969), "Theory of Automata" (I. N. Sneddon and M. Stark, Eds.), International Series of Monographs in Pure and Applied Mathematics, Vol. 100, Pergamon, Oxford.
44. Sewell, P. M. (1994), Bisimulation is not finitely (first order) equationally axiomatisable, in "Proceedings, 9th Annual Symposium on Logic in Computer Science, Paris, France," pp. 62-70, IEEE Comput. Soc. Press, New York.
45. Troeger, D. R. (1993), Step bisimulation is pomset equivalence on a parallel language without explicit internal choice, Math. Structures Comput. Sci. 3, 25-62.
46. Wirsing, M., and Nivat, M., Eds. (1966), "Algebraic Methodology and Software Technology: 5th International Conference, AMAST '96, Munich, Germany," Lecture Notes in Computer Science, Vol. 1101, Springer-Verlag, Berlin/New York.
47. Yanov, Y. (1960), The logical schemes of algorithms, in "Problems in Cybernetics," Vol. 1, pp. 82-140, Pergamon Press, New York. [English translation]