Axiomatizing flat iteration

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

Volumn 1243, Issue , 1997, Pages 228-242

  van Glabbeek, R J ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957863956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63141-0_16     Document Type: Conference Paper

References (19)

1. L. ACETO AND J.F. GROOTE (1995), A complete equational axiomatization for MPA with string iteration, BRICS Research Report RS-95-28, Department of Mathematics and Computer Science, Aalborg University. Available by anonymous ftp from ftp.daimi,aau. dk in the directory pub/BRICS/RS/95/28.
2. L. ACETO, W. FOKKINK, R. VAN GLABBEEK AND A. INGÓLFSDÓTTIR (1996), Axiomatizing prefix iteration with silent steps, I&C 127(1), pp. 26-40.
3. L. ACETO AND A. INGÓLFSDÓTTIR (1996), An equational axiomatization of observation congruence for prefix iteration, in Proc. AMAST ’96, Munich, Germany, M. Wirsing and M. Nivat, eds., LNCS 1101, Springer-Verlag, pp. 195-209.
4. J. BAETEN, J. BERGSTRA AND J. KLOP (1987), On the consistency of Koomen’s fair abstraction rule, TCS 51, pp. 129-176.
5. T. BASTEN (1996), Branching bisimilarity is an equivalence indeed!, IPL 58(3), pp. 141-147.
6. J. BERGSTRA, I. BETHKE AND A. PONSE (1994), Process algebra with iteration and nesting, Computer Journal 37, pp. 243-258. Originally appeared as report P9314, Programming Research Group, University of Amsterdam, 1993.
7. J. BERGSTRA AND J. KLOP (1984), The algebra of recursively defined processes and the algebra of regular processes, in Proceedings 11 th ICALP, Antwerpen, J. Paredaens, ed., LNCS 172, Springer-Verlag, pp. 82-95.
8. F. CORRADINI, R. DE NICOLA AND A LABELLA (1995), Fully abstract models for nondeterministic Kleene algebras (extended abstract), in Proc. CONCUR 95, Philadelphia, I. Lee and S. Smolka, eds., LNCS 962, Springer-Verlag, pp. 130-144.
9. W. FOKKINK (1994), A complete equational axiomatization for prefix iteration, IPL 52, pp. 333-337.
10. W. FOKKINK (1996), A complete axiomatization for prefix iteration in branching bisimulation, Fundamenta Informaticae 26, pp. 103-113.
11. W. FOKKINK AND H. ZANTEMA (1994), Basic process algebra with iteration: Completeness of its equational axioms, Computer Journal 37, pp. 259-267.
12. R. v. GLABBEEK (1995), Branching bisimulation as a tool in the analysis of weak bisimulation. Available at ftp:// boole. stemford, edu/pub/DVI/tool.dv.gz.
13. R. v. GLABBEEK AND W. WEIJLAND (1996), Branching time and abstraction in bisimulation semantics, JACM 43(3), pp. 555-600.
14. M. HENNESSY AND R. MILNER (1985), Algebraic laws for nondeterminism and concurrency, JACM 32, pp. 137-161.
15. S. KLEENE (1956), Representation of events in nerve nets and finite automata, in Automata Studies, C. Shannon and J. McCarthy, eds., Princeton University Press, pp. 3-41.
16. R. MILNER (1989), Communication and Concurrency, Prentice-Hall.
17. R. MILNER (1989), A complete axiomatisation for observational congruence of finite-state behaviours, I&C 81, pp. 227-247.
18. E.-R. OLDEROG AND C.A.R. HOARE (1986), Specification-oriented semantics for communicating processes, Acta Informatica 23, pp. 9-66.
19. P. SEWELL (1994), Bisimulation is not finitely (first order) equationally axiomatisable, in Proc. 9 th LICS, Paris, IEEE Computer Society Press, pp. 62-70