A Congruence Rule Format with Universal Quantification

Authors:
Mohammad Reza Mousavi;Michel Reniers
Affiliations:
Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands and Department of Computer Science, Reykjavík University, Kringlan 1, I ...;Department of Computer Science, Reykjavík University, Kringlan 1, IS-103 Reykjavík, Iceland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 12
Cited 2

Well-founded semantics coincides with three-valued stable semantics

Fundamenta Informaticae
Termination, deadlock, and divergence

Journal of the ACM (JACM)
Structured operational semantics and bisimulation as a congruence

Information and Computation
Transition system specifications with negative premises

Theoretical Computer Science
The meaning of negative premises in transition system specifications

Journal of the ACM (JACM)
Operational semantics of rewriting with priorities

Theoretical Computer Science
Ordered SOS process languages for branching and Eager bisimulation

Information and Computation
A congruence theorem for structured operational semantics with predicates and negative premises

Nordic Journal of Computing
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
SOS formats and meta-theory: 20 years after

Theoretical Computer Science
Formal Semantics and Analysis of Component Connectors in Reo

Electronic Notes in Theoretical Computer Science (ENTCS)
The meaning of ordered SOS

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science

Semantics and expressiveness of ordered SOS

Information and Computation
Structural Operational Semantics with First-Order Logic

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the addition of universal quantification to the meta-theory of Structural Operational Semantics (SOS). We study the syntax and semantics of SOS rules extended with universal quantification and propose a congruence rule format for strong bisimilarity that supports this new feature.