Ordered SOS process languages for branching and eager bisimulations

Information and Computation

Volumn 178, Issue 1, 2002, Pages 180-213

  Ulidowski, Irek ^a   Phillips, Iain ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Branching bisimulation; Congruence results; Eager bisimulation; Formats of SOS rules; GSOS format; Ordered SOS format; Process languages; Process preorders; Structured operational semantics (SOS)

Indexed keywords

COMPUTER SIMULATION; FORMAL LOGIC; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING;

BRANCHING BISIMULATION; PROCESS LANGUAGES; STRUCTURED OPERATIONAL SEMANTICS;

SEMANTICS;

EID: 0037057857     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(02)93161-5     Document Type: Article

References (52)

1. Abramsky, S., (1987), Observation equivalence as a testing equivalence, Theoret. Comput. Sci. 53, 225-241.
2. Aceto, L. (1994), Deriving complete inference systems for a class of GSOS languages generating regular behaviours, in "Proceedings of the 5th International Conference CONCUR'94," Lecture Notes in Computer Science, Vol. 789, Springer-Verlag, Berlin.
3. Aceto, L., Bloom, B., and Vaandrager, F. W. (1994). Turning SOS rules into equations, Inform. and Comput. 111, 1-52.
4. Aceto, L., Fokkink, W., van Glabbeek, R., and Ingólfsdóttir, A. (1996), Axiomatizing prefix iteration with silent steps, Inform. and Comput. 127, 1-52.
5. Aceto, L., and Ingólfsdóttir, A. (1996), CPO models for compact GSOS languages, Inform. and Comput. 129(2), 107-141.
6. Aceto, L., and Ingólfsdóttir, A. (1996), An equational axiomatisation of observation congruence for prefix iteration, in "Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology AMAST'96" (M. Wirsing and M. Nivat, Eds.), Lecture Notes in Computer Science, Vol. 1101, Springer-Verlag, Berlin.
7. Baeten, J. C. M., Bergstra, J. A., and Klop, J. W. (1986), Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inform. XI(2), 127-168.
8. Baeten, J. C. M., Bergstra, J. A., Klop, J. W., and Weijland, W. P. (1989), Term-rewriting systems with rule priorities, Theoret. Comput. Sci. 67, 283-301.
9. Baeten, J. C. M., and Weijland, W. P. (1990), "Process Algebra, Cambridge Tracts in Theoretical Computer Science," Vol. 18, Cambridge Univ. Press, Cambridge.
10. Bergstra, J. A., and Klop, J. W. (1984), Process algebra for synchronous communication, Inform. and Control 60, 109-137.
11. Bloom, B. (1990), "Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages," Ph.D. thesis, Massachusetts Institute of Technology.
12. Bloom, B. (1990), "Strong Process Equivalence in the Presence of Hidden Moves," Preliminary report, Massachusetts Institute of Technology.
13. Bloom, B. (1995), Structural operational semantics for weak bisimulations, Theoret. Comput. Sci. 146, 27-68.
14. Bloom, B., Istrail, S., and Meyer, A. R. (1988), Bisimulation can't be traced: Preliminary report, in "Conference Record of the 15th ACM Symposium on Principles of Programming Languages."
15. Bloom, B., Istrail, S., and Meyer, A. R. (1995), Bisimulation can't be traced, J. Assoc. Comput. Mach. 42(1), 232-268.
16. De Boer, F. S., and Palamidessi, C. (1994), Embedding as a tool for language comparison, Inform. and Comput. 108, 128-157.
17. Fokkink, W. (1996), On the completeness of the equations for the Kleene star in bisimulation, in "Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology AMAST'96" (M. Wirsing and M. Nivat, Eds.), Lecture Notes in Computer Science, Vol. 1101, Springer-Verlag, Berlin.
18. Fokkink, W. (2000), Rooted branching bisimulation as a congruence, J. Comput. System Sci. 60(1), 13-37.
19. Van Glabbeek, R. J. (1990), "Comparative Concurrency Semantics and Refinement of Actions," Ph.D. thesis, CWI.
20. van Glabbeek, R. J., and Weijland, W. P. (1996), Branching time and abstraction in bisimulation semantics, J. Assoc. Comput. Mach. 43(3), 555-600.
21. Groote, J. F. (1993), Transition system specifications with negative premises, Theoret. Comput. Sci. 118(2), 263-299.
22. Groote, J. F., and Vaandrager, F. (1992), Structured operational semantics and bisimulation as a congruence, Inform. and Comput. 100, 202-260.
23. Hennessy, M. (1988), "An Algebraic Theory of Processes," MIT Press, Cambridge, MA.
24. Hennessy, M., and Regan, T. (1995), A process algebra for timed systems, Inform. and Comput. 117, 221-239.
25. Hoare, C. A. R. (1985), "Communicating Sequential Processes," Prentice Hall, New York.
26. Milner, R. (1980), "A Calculus for Communicating Systems," Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, Berlin.
27. Milner, R. (1981), A modal characterisation of observable machine behaviours. in "Proceedings of CAAP'81" (G. Astesiano and C. Böhm, Eds.), Lecture Notes in Computer Science, Vol. 112, Springer-Verlag, Berlin.
28. Milner, R. (1989), "Communication and Concurrency," Prentice Hall, New York.
29. Nicollin, X., and Sifakis, J. (1991), An overview and synthesis on timed process algebras, in "Proceedings of CAV'91" (K. G. Larsen and A. Skou, Eds.), Lecture Notes in Computer Science, Vol. 575, Springer-Verlag, Berlin.
30. Nicollin, X., and Sifakis, J. (1994), The algebra of timed processes, ATP: Theory and application, Inform. and Comput. 114, 131-178.
31. Park, D. M. (1981), Concurrency on automata and infinite sequences, in "Conference on Theoretical Computer Science" (P. Deussen, Ed.), Lecture Notes in Computer Science, Vol. 104, Springer-Verlag, Berlin.
32. Phillips, I. C. C. (1987), Refusal testing, Theoret. Comput. Sci. 50, 241-284.
33. Phillips, I. C. C. (1994), Approaches to priority in process algebras, Unpublished manuscript.
34. Phillips, I. C. C., and Ulidowski, I. (1995), "Stable and timed formats for process algebra," Technical Report, Imperial College.
35. Phillips, I. C. C., and Ulidowski, I. (1996), Ordered SOS rules and weak bisimulation, in "Advances in Theory and Formal Methods of Computing" (A. Adalat, S. Jourdan, and G. McCusker, Eds.), Imperial College Press.
36. Plotkin, G. D. (1977), LCF considered as a programming language, Theoret. Comput. Sci. 5, 223-256.
37. Plotkin, G. D. (1981), "A Structural Approach to Operational Semantics," Technical Report DAIMI FN-19, Aarhus University.
38. Shapiro, E. (1991), Separating concurrent languages with categories of language embeddings, in "Proceedings of 23rd Annual ACM Symposium on Theory of Computing," pp. 198-208.
39. Shapiro, E. (1992), Embeddings among concurrent programming languages, in "Proceedings of 3rd International Conference CONCUR'92" (W. R. Cleaveland, Ed.), Lecture Notes in Computer Science, Vol. 630, pp. 486-503, Springer-Verlag, Berlin/New York.
40. De Simone, R. (1985), Higher-level synchronising devices in MEIJE-SCCS, Theoret. Comput. Sci. 37, 245-267.
41. Turi, D., and Plotkin, G. D. (1997), Towards a mathematical operational semantics, in "Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science," pp. 280-291, IEEE, Computer Society Press, Los Alamitos, CA.
42. Ulidowski, I. (1992), Equivalences on observable processes, in "Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science," pp. 148-159, IEEE, Computer Science Press, Los Alamitos, CA.
43. Ulidowski, I. (1994), "Local Testing and Implementable Concurrent Processes," Ph.D. thesis, Imperial College, University of London.
44. Ulidowski, I. (2000), Finite axiom systems for testing preorder and De Simone process languages, Theoret. Comput. Sci. 239(1), 97-139.
45. Ulidowski, I., and Phillips, I. C. C. (1997), Formats of ordered SOS rules with silent actions, in "Proceedings of the 7th International Conference on Theory and Practice of Software Development TAPSOFT'97" (M. Bidoit and M. Dauchet, Eds.), Lecture Notes in Computer Science, Vol. 1214, Springer-Verlag, Berlin.
46. Ulidowski, I., and Yuen, S. (1997), Extending process languages with time, in "Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology AMAST'97" (M. Johnson, Ed.), Lecture Notes in Computer Science, Vol. 1349, Springer-Verlag, Berlin.
47. Ulidowski, I., and Yuen, S. (2000), Process languages for rooted eager bisimulation, in "Proceedings of the 11th International Conference on Concurrency Theory CONCUR2000" (D. Miller and C. Palamidessi, Eds.), Lecture Notes in Computer Science, Vol. 1877, Springer-Verlag, Berlin.
48. Vaandrager, F. W. (1991), On the relationship between process algebra and input/output automata, in "Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science," IEEE, Computer Society Press, Los Alamitos, CA.
49. Verhoef, C. (1995), A congruence theorem for structured operational semantics with predicates and negative premises, Nordic J. Computing 2(2), 274-302.
50. Walker, D. (1990), Bisimulation and divergence, Inform. and Comput. 85, 202-241.
51. Wang, Y. (1991), "A Calculus of Real Time Systems," Ph.D. thesis, Chalmers University of Technology.
52. Weijland, W. P. (1989), "Synchrony and Asynchrony in Process Algebra," Ph.D. thesis, University of Amsterdam.