Axiomatizations for the perpetual loop in process Algebra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 571-581

  Fokkink, Wan ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

BASIC PROCESS ALGEBRA; IN-PROCESS; KLEENE STAR; MODULO BISIMULATION;

ALGEBRA;

EID: 84951205573     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_212     Document Type: Conference Paper

References (23)

1. L. Aceto and W.J. Fokkink. An equationai axiomatization for multi-exit iteration. Report RS-96-22, BRICS, Aalborg University. 1996. Accepted for publication in Information and Computation.
2. L. Aceto, W.J. Fokkink, R.J. van Glabbeek, and A. Ingolfsdottir. Axiomatizing prefix iteration with silent steps. Information and Computation, 127(1):26-40, 1996.
3. L. Aceto, W.J. Fokkink, and A. Ingolfsdottir. A menagerie of non-finiteiy based process semantics over BPA: from ready simulation to completed traces. Report RS-96-23, BRICS, Aalborg University, 1996.
4. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM, 40(3):653-682, 1993.
5. J.C.M. Baeten and C. Verhoef. A congruence theorem for structured operational semantics with predicates. In Proceedings CONCUR'93, LNCS 715, pp. 477-492. Springer, 1993.
6. J.A. Bergstra, I. Bethke, and A. Ponse. Process algebra with iteration and nesting. The Computer Journal, 37(4):243-258, 1994.
7. J.A. Bergstra, J.A. Hfflebrand and A. Ponse. Grid protocols based on synchronous communication. Science of Computer Programming, 1997, To appear.
8. J.A. Bergstra and P. Klint. The discrete time toolbus. In Proceedings AMAST'96, LNCS 1101, pp. 286-305. Springer, 1996.
9. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60(1 3):109-137, 1984.
10. J.A. Bergstra and J.W. Klop. Verification of an alternating bit protocol by means of process algebra. In Proceedings Spring School on Mathematical Methods of Specification and Synthesis of Software Systems, LNCS 215, pp. 9-23. Springer, 1985.
11. W.J. Fokkink. On the completeness of the equations for the Kleene star in bisimulation. In Proceedings AMAST'96, LNCS 1101, pp. 180-194. Springer, 1996.
12. W.J. Fokkink. An axiomatization for the terminal cycle. Logic Group Preprint Series 167, Utrecht University, 1996. Available at http://www.phil.ruu.nl.
13. W.J. Fokkink and R.J. van Glabbeek. Ntyft/ntyxt rules reduce to ntree rules. Information and Computation, 126(1):1-10, 1996.
14. W.J. Fokkink and H. Zantema. Basic process algebra with iteration: completeness of its equationai axioms. The Computer Journal, 37(4):259-267, 1994.
15. S.C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, pages 3-41. Princeton University Press, 1956.
16. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(2):366-390, 1994.
17. R. Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences, 28:439-466, 1984.
18. R. Milner. The polyadic π-calcuius: a tutorial. In Proceedings Marktoberdorf Summer School '91, Logic and Algebra of Specification, NATO ASI Series F94, pp. 203-246. Springer, 1993.
19. D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, LNCS 104, pp. 167-183. Springer, 1981.
20. G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University, 1981.
21. A. Ponse. Personal communication, March 1997. See also the handouts for the course "Concurrency and Distributed Systems, avalailable at http://adam.wins.uva.nl/alban.
22. A. Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the ACM, 13(1):158-169, 1966.
23. P.M. Sewell. Bisimulation is not finitely (first order) equationally axiomatisable. In Proceedings LICS 94, pp. 62-70. IEEE Computer Society Press, 1994