A Congruence Rule Format with Universal Quantification

Electronic Notes in Theoretical Computer Science

Volumn 192, Issue 1 SPEC. ISS., 2007, Pages 109-124

  Mousavi, Mohammad Reza ^a,b   Reniers, Michel ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b REYKJAVIK UNIVERSITY   (Iceland)

Author keywords

Bisimulation; Congruence; SOS Rule Formats; Structural Operational Semantics (SOS); Universal Quantification

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; LOGIC PROGRAMMING; METADATA; SYNTACTICS;

BISIMULATION; CONGRUENCE; SOS RULE FORMATS; STRUCTURAL OPERATIONAL SEMANTICS (SOS); UNIVERSAL QUANTIFICATION;

SEMANTICS;

EID: 35348954194     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.08.019     Document Type: Article

References (17)

1. Aceto, L., W.J. Fokkink and C. Verhoef, Structural operational semantics, in: J.A. Bergstra, A. Ponse and S.A. Smolka, editors, Handbook of Process Algebra, Chapter 3, pp. 197-292
2. Aceto L., and Hennessy M. Termination, deadlock, and divergence. Journal of the ACM (JACM) 39 (1992) 147-187
3. Baeten J.C.M., and Bergstra J.A. Processen en procesexpressies. Informatie 30 (1988) 177-248 (In Dutch)
4. Bol R., and Groote J.F. The meaning of negative premises in transition system specifications. Journal of the ACM (JACM) 43 (1996) 863-914
5. van Glabbeek R.J. The meaning of negative premises in transition system specifications II. Journal of Logic and Algebraic Programming (JLAP) 60-61 (2004) 229-258
6. Groote J.F. Transition system specifications with negative premises. Theoretical Computer Science (TCS) 118 (1993) 263-299
7. Groote J.F., and Vaandrager F.W. Structured operational semantics and bisimulation as a congruence. Information and Computation (I&C) 100 (1992) 202-260
8. Mousavi M., Phillips I.C.C., Reniers M.A., and Ulidowski I. The meaning of ordered SOS. Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science. (FSTTCS'06). Lecture Notes in Computer Science 4337 (2006) 334-345
9. Mousavi, M., I.C.C. Phillips, M.A. Reniers and I. Ulidowski, Semantics and expressiveness of ordered SOS, Technical Report CSR-07-07, Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands (2007)
10. Mousavi M., Reniers M.A., and Groote J.F. SOS formats and meta-theory: 20 years after. Theoretical Computer Science (TCS) 373 (2007) 238-272
11. Mousavi M., Sirjani M., and Arbab F. Formal semantics and analysis of component connectors in Reo. Proceedings of the 4th International Workshop on the Foundations of Coordination Languages and Software Architectures. (FOCLASA'05). Electronic Notes in Theoretical Computer Science 154 (2006) 83-99
12. Park, D.M., Concurrency and automata on infinite sequences, in: Proceedings of the 5th GI Conference, Lecture Notes in Computer Science 104, pp. 167-183
13. Phillips I.C.C., and Ulidowski I. Ordered SOS rules and process languages for branching and eager bisimulations. Information and Computation (I&C) 178 (2002) 180-213
14. Plotkin G.D. The origins of structural operational semantics. Journal of Logic and Algebraic Programming (JLAP) 60 (2004) 3-15
15. van de Pol J. Operational semantics of rewriting with priorities. Theoretical Computer Science (TCS) 200 (1998) 289-312
16. Przymusinski T.C. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae 13 (1990) 445-463
17. Verhoef C. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing 2 (1995) 274-302