Rooted branching bisimulation as a congruence

Journal of Computer and System Sciences

Volumn 60, Issue 1, 2000, Pages 13-37

  Fokkink, Wan ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL LINGUISTICS; CONFORMAL MAPPING; FUNCTIONS; ITERATIVE METHODS; MATHEMATICAL MODELS; THEOREM PROVING;

CONFERENCE THEOREM; GROOTE NTYFT FORMAT; ROOTED BRANCHING SIMULATION; TRANSITION SYSTEM SPECIFICATION;

COMPUTER SIMULATION;

EID: 0034140160     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1663     Document Type: Article

References (37)

1. J. C. M. Baeten, J. A. Bergstra, and J. W. Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inform. 9 (1996), 127-167.
2. J. C. M. Baeten, J. A. Bergstra, J. W. Klop, and W. P. Weijland, Term-rewriting systems with rule priorities, Theoret. Comput. Sci. 67 (1989), 283-301.
3. J. C. M. Baeten and R. J. van Glabbeek, Another look at abstraction in process algebra, in "Proceedings 14th Colloquium on Automata, Languages and Programming (ICALP'87), Karlsruhe" (T. Ottmann, Ed.), Lecture Notes in Computer Science, Vol. 267, pp. 84-94, Springer-Verlag, Berlin, 1987.
4. J. C. M. Baeten and C. Verhoef, A congruence theorem for structured operational semantics with predicates, in "Proceedings 4th Conference on Concurrency Theory (CONCUR'93), Hildesheim" (E. Best, Ed.), Lecture Notes in Computer Science, Vol. 715, pp. 477-492, Springer-Verlag, Berlin, 1993.
5. J. C. M. Baeten and W. P. Weijland, "Process Algebra," Cambridge Tracts in Theoretical Computer Science, Vol. 18, Cambridge University Press, Cambridge, UK, 1990.
6. J. W. de Bakker and J. I. Zucker, Processes and the denotational semantics of concurrency, Inform. and Control 54 (1982), 70-120.
7. T. Basten, Branching bisimilarity is an equivalence indeed!, Inform. Process. Lett. 58 (1996), 141-147.
8. B. Bloom, Structural operational semantics for weak bisimulations, Theoret. Comput. Sci. 146 (1995), 25-68.
9. B. Bloom, S. Istrail, and A. R. Meyer, Bisimulation can't be traced, J. Assoc. Comput. Mach. 42 (1995), 232-268.
10. R. N. Bol and J. F. Groote, The meaning of negative premises in transition system specifications, J. Assoc. Comput. Mach. 43 (1996), 863-914.
11. W. J. Fokkink, Language preorder as a precongruence, Theoret. Comput. Sci., to appear.
12. W. J. Fokkink and R. J. van Glabbeek, Ntyft/ntyxt rules reduce to ntree rules, Inform. and Comput. 126 (1996), 1-10.
13. W. J. Fokkink and C. Verhoef, A conservative look at operational semantics with variable binding, Inform. and Comput. 146 (1998), 24-54.
14. A. van Gelder, K. Ross, and J. S. Schlipf, The well-founded semantics for general logic programs, J. Assoc. Comput. Mach. 38 (1991), 620-650.
15. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in "Proceedings 5th Conference on Logic Programming," pp. 1070-1080, MIT Press, Cambridge, MA, 1988.
16. R. J. van Glabbeek, Bounded nondeterminism and the approximation induction principle in process algebra, in "Proceedings 4th Symposium on Theoretical Aspects of Computer Science (STACS'87), Passau" (F. J. Brandeburg, G. Vidal-Naquet, and M. Wirsing, Eds.), Lecture Notes in Computer Science, Vol. 247, pp. 336-347, Springer-Verlag, Berlin, 1987.
17. R. J. van Glabbeek, The linear time - branching time spectrum, in "Proceedings 1st Conference on Concurrency Theory (CONCUR'90), Amsterdam" (J. C. M. Baeten and J. W. Klop, Eds.), Lecture Notes in Computer Science, Vol. 458, pp. 278-297, Springer-Verlag, Berlin, 1990.
18. R. J. van Glabbeek, The linear time - branching time spectrum II: The semantics of sequential systems with silent moves, in "Proceedings 4th Conference on Concurrency Theory (CONCUR'93), Hildesheim" (E. Best, Ed.), Lecture Notes in Computer Science, Vol. 715, pp. 66-81, Springer-Verlag, Berlin, 1993.
19. R. J. van Glabbeek, Full abstraction in structural operational semantics, in "Proceedings 3rd Conference on Algebraic Methodology and Software Technology (AMAST'93), Enschede" (M. Nivat, C. Rattray, T. Rus, and G. Scollo, Eds.), Workshops in Computing, pp. 77-84, Springer-Verlag, Berlin, 1993.
20. R. J. van Glabbeek, What is branching time and why to use it?, in "The Concurrency Column, Bulletin of the EATCS" (M. Nielsen, Ed.), Vol. 53, pp. 190-198, 1994.
21. R. J. van Glabbeek, The meaning of negative premises in transition system specifications II. Extended abstract, in "Proceedings 23rd Colloquium on Automata, Languages, and Programming (ICALP'96), Paderborn" (F. Meyer auf der Heide and B. Monien, Eds.), pp. 502-513, Lecture Notes in Computer Science, Vol. 1099, Springer-Verlag, Berlin, 1996.
22. R. J. van Glabbeek and W. P. Weijland, Branching time and abstraction in bisimulation semantics, J. Assoc. Comput. Mach. 43 (1996), 555-600.
23. J. F. Groote, Transition system specifications with negative premises, Theoret. Comput. Sci. 118 (1993), 263-299.
24. J. F. Groote and F. W. Vaandrager, Structured operational semantics and bisimulation as a congruence, Inform. and Comput. 100 (1992), 202-260.
25. S. C. Kleene, Representation of events in nerve nets and finite automata, in "Automata Studies," pp. 3-41, Princeton University Press, Princeton, 1956.
26. R. Milner, A modal characterisation of observable machine-behaviour, in "Proceedings 6th Colloquium on Trees in Algebra and Programming (CAAP'81), Genoa" (E. Astesiano and C. Böhm, Eds.), Lecture Notes in Computer Science, Vol. 112, pp. 25-34, Springer-Verlag, Berlin, 1981.
27. R. Milner, "Communication and Concurrency," Prentice-Hall, New York, 1989.
28. D. M. R. Park, Concurrency and automata on infinite sequences, in "Proceedings 5th GI Conference, Karlsruhe" (P. Deussen, Ed.), Lecture Notes in Computer Science, Vol. 104, pp. 167-183, Springer-Verlag, Berlin, 1981.
29. G. D. Plotkin, "A Structural Approach to Operational Semantics," Report DAIMI FN-19, Aarhus University, 1981.
30. J. C. van de Pol, Operational semantics of rewriting with priorities, Theoret. Comput. Sci. 200 (1998), 289-312.
31. T. C. Przymusinski, On the declarative semantics of deductive databases and logic programs, in "Foundations of Deductive Databases and Logic Programming, Los Altos" (J. Minker, Ed.), pp. 193-216, Morgan Kaufmann, San Mateo, CA, 1988.
32. T. C. Przymusinski, The well-founded semantics coincides with the three-valued stable semantics, Fund. Inform. 13 (1990), 445-463.
33. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955), 285-309.
34. I. Ulidowski and I. Phillips, Formats of ordered SOS rules with silent actions, in "Proceedings 7th Conference on Theory and Practice of Software Development (TAPSOFT'97), Lille" (M. Bidoit and M. Dauchet, Eds.), Lecture Notes in Computer Science, Vol. 1214, pp. 297-308, Springer-Verlag, Berlin, 1997.
35. F. W. Vaandrager, "Algebraic Techniques for Concurrency and their Application," Ph.D. thesis, University of Amsterdam, 1990.
36. C. Verhoef, A congruence theorem for structured operational semantics with predicates and negative premises, Nordic J. Comput. 2 (1995), 274-302.
37. J. L. M. Vrancken, The algebra of communicating processes with empty process, Theoret. Comput. Sci. 177 (1997), 287-328.