An equational axiomatization of observation congruence for prefix iteration

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

Volumn 1101, Issue , 1996, Pages 195-209

  Aceto, Luca ^a   Ingólfsdóttir, Anna ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SOFTWARE ENGINEERING;

ATOMIC ACTIONS; AXIOM SYSTEM; AXIOMATIZATION; KLEENE STAR; OBSERVATION CONGRUENCES; OPEN TERMS; STRONG BISIMULATION; UNOBSERVABLE;

ITERATIVE METHODS;

EID: 84947905921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014316     Document Type: Conference Paper

References (18)

1. L. Aceto, W. Fokkink, R. van Glabbeek, and A. Ingólfsdóttir, Axiomatizing prefix iteration with silent steps, Research Report RS-95-56, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Mathematics and Computer Science, Aalborg University, November 1995. To appear in Information and Computation. Available by anonymous ftp at the address ftp.brics.aau.dk in the directory pub/BRICS/RS/95/56.
2. L. Aceto and A. Ingólfsdóttir, A complete equational axiomatization for prefix iteration with silent steps, Research Report RS-95-5, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Department of Mathematics and Computer Science, Aalborg University, Jan. 1995. Available by anonymous ftp at the address ftp.brics.aau.dk in the directory pub/BRICS/RS/95/5.
3. J. Bergstra, I. Bethke, and A. Ponse, Process algebra with iteration and nesting, Computer Journal, 37 (1994), pp. 243-258.
4. J. Bergstra and J. Klop, Process algebra for synchronous communication, Information and Computation, 60 (1984), pp. 109-137.
5. F. Corradini, R. De Nicola, and A. Labella, Fully abstract models for nondeterministic Kleene algebras (extended abstract), in Proceedings CONCUR 94, Philadelphia, PA, USA, I. Lee and S. Smolka, eds., vol. 962 of Lecture Notes in Computer Science, Springer-Verlag, 1995, pp. 130-144.
6. R. De Nicola and A. Labella, A completeness theorem for nondeterministic Kleene algebras, in Proceedings of MFCS '94, vol. 841 of Lecture Notes in Computer Science, Springer-Verlag, 1994.
7. W. Fokkink, A complete equational axiomatization for prefix iteration, Inf. Process. Lett., 52 (1994), pp. 333-337.
8. A complete axiomatization for prefix iteration in branching bisimulation, Logic Group Preprint Series 126, Dept. of Philosophy, Utrecht University, Jan. 1995. To appear in Fundamenta Informaticae. Available by anonymous ftp from phil.ruu.nl as logic/PREPRINTS/preprint126.ps.
9. On the completeness of the equations for the Kleene star in bisimulation, 1996. In this volume. A full version of the paper is available by anonymous ftp from phil.ruu.nl as logic/PREPRINTS/preprint141.ps.
10. W. Fokkink and H. Zantema, Basic process algebra with iteration: Completeness of its equational axioms, Computer Journal, 37 (1994), pp. 259-267.
11. J.F. Groote, A new strategy for proving ω-completeness with applications in process algebra, in Proceedings CONCUR 90, Amsterdam, J. Baeten and J. Klop, eds., vol. 458 of Lecture Notes in Computer Science, Springer-Verlag, 1990, pp. 314-331.
12. M. Hennessy, A term model for synchronous processes, Information and Control, 51 (1981), pp. 58-75.
13. S. Kleene, Representation of events in nerve nets and finite automata, in Automata Studies, C. Shannon and J. McCarthy, eds., Princeton University Press, 1956, pp. 3-41.
14. L. Lamport, How to write a proof, Research Report 94, Digital Equipment Corporation, Systems Research Center, Feb. 1993.
15. R. Milner, Communication and Concurrency, Prentice-Hall International, Englewood Cliffs, 1989.
16. th GI Conference, Karlsruhe, Germany, P. Deussen, ed., vol. 104 of Lecture Notes in Computer Science, Springer-Verlag, 1981, pp. 167-183.
17. G. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
18. th Annual Symposium on Logic in Computer Science, Paris, France, IEEE Computer Society Press, 1994, pp. 62-70.