A complete axiomatization for prefix iteration in branching bisimulation

Fundamenta Informaticae

Volumn 26, Issue 2, 1996, Pages 103-113

  Fokkink, Wan ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; EQUIVALENCE CLASSES; FINITE AUTOMATA; MATHEMATICAL OPERATORS;

BRANCHING BISIMULATION; FINITE EQUATIONAL AXIOMATIZATION; PREFIX ITERATION;

ITERATIVE METHODS;

EID: 0030148087     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-26201     Document Type: Article

References (24)

1. L. Aceto, W.J. Fokkink, R.J. van Glabbeek, and A. Ingólfsdóttir. Axiomatizing prefix iteration with silent steps. Technical Report, University of Aarhus, 1995.
2. L. Aceto and J.F. Groote. A complete equational axiomatization for MPA with string iteration. Technical Report RS-95-28, University of Aarhus, 1995.
3. L. Aceto and A. Ingólfsdóttir. A complete equational axiomatization for prefix iteration with silent steps. Technical Report RS-95-5, University of Aarhus, 1995.
4. J.C.M. Baeten and J.A. Bergstra. Discrete time process algebra. In Proceedings 3rd Conference on Concurrency Theory (CONCUR'92), Stony Brook (1992),
5. W.R. Cleaveland, ed., Lecture Notes in Computer Science 630, Springer, pp. 401-420.
6. Revised version to appear in Formal Aspects of Computing.
7. J.C.M. Baeten and R.J. van Glabbeek. Another look at abstraction in process algebra. In Proceedings 14th International Colloquium on Automata, Languages and Programming (ICALP'87), Karlsruhe (1987), Th. Ottmann, ed., Lecture Notes in Computer Science 267, Springer, pp. 84-94.
8. J.A. Bergstra, I. Bethke, and A. Ponse. Process algebra with iteration and nesting. The Computer Journal 37, 4 (1994), 243-258.
9. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control 60, 1/3 (1984), 109-137.
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 '85, Wendisch-Rietz (1985), W. Bibel and K.P. Jantke, eds., Lecture Notes in Computer Science 215, Springer, pp. 9-23.
11. W.J. Fokkink. A complete equational axiomatization for prefix iteration. Information Processing Letters 52, 6 (1994), 333-337.
12. W.J. Fokkink and H. Zantema. Basic process algebra with iteration: completeness of its equational axioms. The Computer Journal 37, 4 (1994), 259-267.
13. W.J. Fokkink and H. Zantema. Prefix iteration in basic process algebra: applying termination techniques. In Proceedings 2nd Workshop on the Algebra of Communicating Processes (ACP'95), Eindhoven (1995), A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, eds., Technical Report CS-95-14, Eindhoven University of Technology, pp. 139-156.
14. R.J. van Glabbeek. Branching bisimulation as a tool in the analysis of weak bisimulation. Unpublished manuscript, 1995. Available at http://boole.stanford. edu/~rvg/pub/tool.dvi.gz.
15. R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. In Proceedings 11th IFIP World Computer Congress, San Francisco (1989), G.X. Ritter, ed., North-Holland, pp. 613-618. To appear in Journal of the ACM.
16. J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation 100, 2 (1992), 202-260.
17. S.C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies (1956), Princeton University Press, pp. 3-41.
18. R. Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences 28 (1984), 439-466.
19. D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, Karlsruhe (1981), P. Deussen, ed., Lecture Notes in Computer Science 104, Springer, pp. 167-183.
20. G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.
21. A. Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the ACM 13, 1 (1966), 158-169.
22. P. Sewell. Bisimulation is not finitely (first order) equationally axiomatisable. In Proceedings 9th IEEE Symposium on Logic in Computer Science (LICS'94), Paris (1994), IEEE Computer Society Press, pp. 62-70.
23. C. Verhoef. A general conservative extension theorem in process algebra. In Proceedings IFIP Conference on Programming Concepts, Methods and Calculi (PRO-COMET'94), San Miniato (1994), E.-R. Olderog, ed., IFIP Transactions A-56, Elsevier, pp. 149-168.
24. s. In Proceedings 6th Conference on Rewriting Techniques and Applications (RTA'95), Kaiserslautern (1995), J. Hsiang, ed., Lecture Notes in Computer Science 914, Springer, pp. 41-55.