Structural Operational Semantics with First-Order Logic

Authors:
Muck van Weerdenburg;Michel A. Reniers
Affiliations:
Computer Science, Eindhoven University of Technology (TU/e), Eindhoven, The Netherlands;Computer Science, Eindhoven University of Technology (TU/e), Eindhoven, The Netherlands
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 14
Cited 1

Process algebra

Process algebra
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
Ntyft/ntyxt rules reduce to ntree rules

Information and Computation
The meaning of negative premises in transition system specifications

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

Theoretical Computer Science
Partiality, Truth and Persistence

Partiality, Truth and Persistence
A Calculus of Communicating Systems

A Calculus of Communicating Systems
A Congruence Theorem for Structured Operational Semantics with Predicates

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
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
A Congruence Rule Format with Universal Quantification

Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Semantics and Analysis of Component Connectors in Reo

Electronic Notes in Theoretical Computer Science (ENTCS)

Rule formats for determinism and idempotence

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a formalism for Structural Operational Semantics (SOS) with first-order-logic formulas as premises. It is shown that in most uses (including all practical uses) this formalism has the same expressivity as SOS without first-order logic. Furthermore, we give a congruence format for (strong) bisimilarity. The latter is shown to be strongly related to the ntyft/ntyxt format.