Semantics and expressiveness of ordered SOS

Information and Computation

Volumn 207, Issue 2, 2009, Pages 85-119

  Mousavi, Mohammad Reza ^a,b   Phillips, Iain ^c   Reniers, Michel A ^a   Ulidowski, Irek ^d  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b REYKJAVIK UNIVERSITY   (Iceland)

^c IMPERIAL COLLEGE LONDON   (United Kingdom)

^d UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BISIMILARITY; IMPORTANT FEATURES; PHILLIPS; RULE FORMATS; STRUCTURED OPERATIONAL SEMANTICS; TIME-OUTS; TRANSITION RULE;

SYSTEMS ENGINEERING;

EID: 77949467060     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.11.008     Document Type: Conference Paper

References (23)

1. Luca Aceto, Wan J. Fokkink, Chris Verhoef, Structured operational semantics, in: Jan A. Bergstra, Alban Ponse, Scott A. Smolka (Eds.), Handbook of Process Algebra, Elsevier Science, 2001, pp. 197-292.
2. Luca Aceto, Matthew Hennessy, Termination, deadlock, and divergence, Journal of the ACM 39 (1) (1992) 147-187.
3. J.C.M. (Jos) Baeten, Jan A. Bergstra, Jan Willem Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fundamenta Informaticae XI (2) (1986) 127-168.
4. J.C.M. (Jos) Baeten, Jan A. Bergstra, Jan Willem Klop,W. PeterWeijland, Term-rewriting systems with rule priorities, Theoretical Computer Science 67 (2 and 3) (1989) 283-301. (Pubitemid 20626604)
5. Bard Bloom, Sorin Istrail, Albert R. Meyer, Bisimulation can't be traced, Journal of the ACM 42 (1) (1995) 232-268.
6. Roland Bol, Jan Friso Groote, The meaning of negative premises in transition system specifications, Journal of the ACM 43 (5) (1996) 863-914. (Pubitemid 126607647)
7. Wan J. Fokkink, Rob J. van Glabbeek, Ntyft/ntyxt rules reduce to ntree rules, Information and Computation 126 (1) (1996) 1-10.
8. Rob J. van Glabbeek, Bounded nondeterminism and the approximation induction principle in process algebra, in: Franz-Josef Brandenburg, Guy Vidal-Naquet, Martin Wirsing (Eds.), Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science (STACS'87), Lecture Notes in Computer Science, vol. 247, Springer-Verlag, Berlin, Germany, 1987, pp. 336-347.
9. Rob J. van Glabbeek, The meaning of negative premises in transition system specifications II, Journal of Logic and Algebraic Programming 60-61 (2004) 229-258.
10. Jan Friso Groote, Transition system specifications with negative premises, Theoretical Computer Science 118 (2) (1993) 263-299.
11. Jan Friso Groote, Frits W. Vaandrager, Structured operational semantics and bisimulation as a congruence, Information and Computation 100 (2) (1992) 202-260.
12. Matthew C.B. Hennessy, Tim Regan, A process algebra for timed systems, Information and Computation 117 (2) (1995) 221-239.
13. Ruggero Lanotte, Simone Tini, Probabilistic congruence for semistochastic generative processes, in: Vladimiro Sassone (Ed.), Proceedings of the 8th International Conference on Foundations of Software Science and Computational Structures (FOSSACS'05), Lecture Notes in Computer Science, vol. 3441, Springer-Verlag, Berlin, Germany, 2005, pp. 63-78. (Pubitemid 41273699)
14. Chilukuri K. Mohan, Priority rewriting: semantics, confluence, and conditionals, in: Nachum Dershowitz (Ed.), Proceedings of the 3rd International Conference on Rewriting Techniques and Applications (RTA'89), Lecture Notes in Computer Science, vol. 355, Springer-Verlag, Berlin, Germany, 1989, pp. 278-291.
15. MohammadReza Mousavi, Iain C.C. Phillips, Michel A. Reniers, The meaning of ordered SOS, in: S. Arun-Kumar, Naveen Garg (Eds.), Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), Lecture Notes in Computer Science, vol. 4337, Springer-Verlag, Berlin, Germany, 2006, pp. 334-345.
16. MohammadReza Mousavi, Michel Reniers, A congruence rule format with universal quantification, Electronic Notes in Theoretical Computer Science 192 (1) (2007) 109-124. (Pubitemid 47615621)
17. G.D. Plotkin, A structural approach to operational semantics, Journal of Logic and Algebraic Programming 60-61 (2004) 17-139.
18. Jaco van de Pol, Operational semantics of rewriting with priorities, Theoretical Computer Science 200 (1-2) (1998) 289-312. (Pubitemid 128450820)
19. Teodor C. Przymusinski, The well-founded semantics coincides with the three-valued stable semantics, Fundamenta Informaticae 13 (4) (1990) 445-463.
20. Robert de Simone, Higher-level synchronizing devices in MEIJE-SCCS, Theoretical Computer Science 37 (1985) 245-267.
21. Irek Ulidowski, Iain C.C. Phillips, Formats of ordered SOS rules with silent actions, in: Michel Bidoit, Max Dauchet (Eds.), Proceedings of the 7th International Joint Conference on Theory and Practice of Software Development (TAPSOFT'97), Lecture Notes in Computer Science, vol. 1214, Springer-Verlag, Berlin, Germany, 1997, pp. 297-308. (Pubitemid 127053354)
22. Irek Ulidowski, Iain C.C. Phillips, Ordered SOS rules and process languages for branching and eager bisimulations, Information and Computation 178 (1) (2002) 180-213. (Pubitemid 35312295)
23. Muck vanWeerdenburg, Michel A. Reniers, Structural operational semantics with first-order logic, in: MatthewHennessy, Bartek Klin (Eds.), Structural Operational Semantics (SOS'08), Preliminary Proceedings, Reykjavik, Iceland, 2008, pp. 48-62.