Formats of ordered SOS rules with silent actions

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

Volumn 1214, Issue , 1997, Pages 297-308

  Ulidowski, Irek ^a   Phillips, Iain ^b  

^a KYOTO UNIVERSITY   (Japan)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; SYSTEMS ENGINEERING;

PROCESS ALGEBRAS; STRUCTURAL OPERATIONAL SEMANTICS; WEAK BISIMULATION; WEAK BISIMULATIONS;

SOFTWARE DESIGN;

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

References (20)

1. S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53:225-241, 1987.
2. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced. Journal of ACM, 42(1), 1995. Also appeared as Technical Report TR 90-1150, Cornell, 1990.
3. B. Bloom. Strong process equivalence in the presence of hidden moves. Preliminary report, MIT, 1990.
4. B. Bloom. Structural operational semantics for weak bisimulations. Theoretical Computer Science, 146:27-68, 1995.
5. J.C.M Baeten and W.P Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 1990.
6. R. de Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245-267, 1985.
7. J.F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118, 1993.
8. J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100:202-260, 1992.
9. M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117, 1995.
10. R. Milner. A modal characterisation of observable machine behaviours. In G. Astesiano and C. Bohm, editors, CAAP 81, pages 25-34, Berlin, 1981. Springer-Verlag. LNCS 112.
11. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
12. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.
13. I.C.C. Phillips and I. Ulidowski. Ordered SOS rules and weak bisimulation. In A. Adalat, S. Jourdan, and G. McCusker, editors, Theory and Formal Methods 1996, London, 1996. Imperial College Press.
14. I. Ulidowski. Equivalences on observable processes. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, 1992.
15. I. Ulidowski. Local Testing and Implementable Concurrent Processes. PhD thesis, Imperial College, University of London, 1994.
16. I Ulidowski and I.C.C. Phillips. Formats of ordered SOS rules with silent actions. Technical report, RIMS, Kyoto University, 1996. Available at http://www.kurims.kyoto-u.ac.jp/~irek/.
17. FW Vaandrager. On the relationship between process algebra and input/output automata. In Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science, Amsterdam, 1991.
18. R.J. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, CWI, 1990.
19. D. Walker. Bisimulation and divergence. Information and Computation, 85(2) 1990
20. Y. Wang. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, Góteborg, Sweden, 1991.