Finite axiom systems for testing preorder and De Simone process languages

Theoretical Computer Science

Volumn 239, Issue 1, 2000, Pages 97-139

  Ulidowski, Irek ^a,b  

^a KYOTO UNIVERSITY   (Japan)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Complete axiomatisations; De Simone process languages; Equational logic; Structured Operational Semantics (SOS); Testing semantics

Indexed keywords

EID: 0011221401     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00214-5     Document Type: Article

References (42)

1. S. Abramsky, Observation equivalence as a testing equivalence, Theoret. Comput. Sci. 53 (1987) 225-241
2. L. Aceto, Deriving complete inference systems for a class of GSOS languages generating regular behaviours, in: Proc. 5th Internat. Conf. CONCUR'94, Lecture Notes in Computer Science, vol. 789, Springer, Berlin, 1994.
3. L. Aceto, B. Bloom, F.W. Vaandrager, Turning SOS rules into equations, in: Proc. 7th Annual IEEE Symp. Logic in Computer Science, IEEE Computer Science Press, 1992
4. L. Aceto, B. Bloom, F.W. Vaandrager, Turning SOS rules into equations, Inform. and Comput. 111 (1994) 1-52.
5. L. Aceto, A. Ingólfsdóttir, CPO models for a Class of GSOS languages, in: P.D. Mosses, M. Nelsen, M.I. Schwartzbach (Eds.), Proc. TAPSOFT'95, Lecture Notes in Computer Science, vol. 915, Springer, Berlin, 1995.
6. J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18, Cambridge University Press, Cambridge, 1990.
7. J.A. Bergstra, J.W. Klop, Process algebra for synchronous communication, Inform. and Control 60 (1984) 109-137.
8. J.A. Bergstra, J.W. Klop, Algebra of communicating processes with abstraction, Theoret. Comput. Sci. 37(1) (1985) 77-121.
9. J.A. Bergstra, J.W. Klop, A complete inference system for regular processes with silent moves, in: F.R. Drake, J.K. Truss (Eds.), Logic Colloquium '86, North-Holland, Amsterdam, 1988, pp. 21-81.
10. B. Bloom, Ready simulation, bisimulation, and the semantics of CCS-like languages, Ph.D. Thesis, Massachusetts Institute of Technology, 1990.
11. B. Bloom, Strong process equivalence in the presence of hidden moves, Preliminary Report, Massachusetts Institute of Technology, 1990.
12. B. Bloom, Structural operational semantics for weak bisimulations, Theoret. Comput. Sci. 146 (1995) 27-68.
13. B. Bloom, Structured operational semantics as a specification language, in: Conf. Record 22nd ACM Symp. Principles of Programming Languages, ACM, New York, 1995.
14. B. Bloom, S. Istrail, A.R. Meyer, Bisimulation can't be traced: preliminary report, in: Conf. Record 15th ACM Symp. Principles of Programming Languages, ACM, New York, 1988.
15. B. Bloom, S. Istrail, A.R. Meyer, Bisimulation can't be traced, J. ACM 42(1) (1995) 232-268.
16. R. Cleaveland, M. Hennessy, Priorities in process algebra, Inform. and Comput. 87 (1990) 58-77.
17. R. de Simone, Higher-level synchronising devices in MEIJE-SCCS, Theoret. Comput. Sci. 37 (1985) 245-267.
18. J.F. Groote, Transition system specifications with negative premises, Theoret. Comput. Sci. 118(2) (1993) 263-299.
19. J.F. Groote, F. Vaandrager, Structured operational semantics and bisimulation as a congruence, Inform. and Comput. 100 (1992) 202-260.
20. M. Hennessy, An Algebraic Theory of Processes, The MIT Press, Cambridge, MA, 1988.
21. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, NJ, 1985.
22. R. Milner, A modal characterisation of observable machine behaviours, in: G. Astesiano, C. Böhm, (Eds.), Proc. CAAP'81, Lecture Notes in Computer Science, vol. 112, Springer, Berlin, 1981.
23. R. Milner, A complete inference system for a class of regular behaviours, J. Comput. System Sci. 28 (1984) 439-466.
24. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
25. R. Milner, A complete axiomatisation for observational congruence of finite-state behaviours, Inform. and Comput. 81 (1989) 227-247.
26. F. Moller, The importance of the left merge operator in process algebras, in: M. Paterson (Eds.), Proc. 17th ICALP, Lecture Notes in Computer Science, vol. 443, Springer, Berlin, 1990.
27. R. De Nicola, Extensional equivalences for transition systems, Acta Inform. 24 (1987) 212-237.
28. R. De Nicola, M. Hennessy, Testing equivalences for processes, Theoret. Comput. Sci. 34 (1984) 83-133.
29. R. De Nicola, M. Hennessy, CCS without τ's, in: H. Ehrig, R. Kowalski, G. Levi, U. Montanari (Eds.), Proc. TAPSOFT'87, Lecture Notes in Computer Science, vol. 250, Springer, Berlin, 1987.
30. X. Nicollin, J. Sifakis, An overview and synthesis on timed process algebras, in: K.G. Larsen, A. Skou (Eds.), Proc. CAV'91, Lecture Notes in Computer Science, vol. 575, Springer, Berlin, 1991.
31. G. Plotkin, A structural approach to operational semantics, Technical Report DAIMI FN-19 Aarhus University, 1981.
32. I. Ulidowski, Equivalences on observable processes, in: Proc. 7th Annual IEEE Symp. Logic in Computer Science, IEEE Computer Science Press, 1992
33. I. Ulidowski, Local testing and implementable concurrent processes, Ph.D. Thesis, Imperial College, University of London, 1994.
34. I. Ulidowski, Axiomatisations of weak equivalences for De Simone languages, in: I. Lee, S.A. Smolka (Eds.), Proc. 6th Internat. Conf. Concurrency Theory CONCUR'95, Lecture Notes in Computer Science, vol. 962, Springer, Berlin, 1995.
35. I. Ulidowski, Finite axiom systems for testing preorder and De Simone process languages, in: M. Wirsing, M. Nivat (Eds.), Proc. 5th Internat. Conf. Algebraic Methodology and Software Technology AMAST'96, Lecture Notes in Computer Science, vol. 1101, Springer, Berlin, 1996.
36. I. Ulidowski, I.C.C. Phillips, Formats of ordered SOS rules with silent actions, in: M. Bidoit, M. Dauchet (Eds.), Proc. 7th Internat. Conf. Theory and Practice of Software Development TAPSOFT'97, Lecture Notes in Computer Science, vol. 1214, Springer, Berlin, 1997.
37. I. Ulidowski, I.C.C. Phillips, Ordered SOS rules and process languages for branching and eager bisimulations, Technical Report, Department of Mathematics and Computer Science, Leicester University, 1999.
38. I. Ulidowski, S. Yuen, Extending process languages with time, in: M. Johnson (Eds.), Proc. 6th Internat. Conf. Algebraic Methodology and Software Technology AMAST'97, Lecture Notes in Computer Science, vol. 1349, Springer, Berlin, 1997.
39. F.W. Vaandrager, On the relationship between process algebra and input/output automata, in: Proc. 6th Annual IEEE Symp. Logic in Comput. Sci. IEEE Computer Science Press, 1991.
40. R.J. van Glabbeek, Comparative concurrency semantics and refinement of actions, Ph.D. Thesis, CWI, 1990.
41. R.J. van Glabbeek, A complete axiomatisation for branching bisimulation congruence of finite-state behaviours, in: A.M. Borzyszkowski, S. Sokołowski (Eds.), Proc. MFCS'93, Lecture Notes in Computer Science, vol. 711, Springer, Berlin, 1993.
42. D. Walker, Bisimulation and divergence, Informat. and Comput. 85(2) (1990) 202-241.