| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 424149 | Electronic Notes in Theoretical Computer Science | 2009 | 22 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
