Process algebra
Selected papers of the Second Workshop on Concurrency and compositionality
Structured operational semantics and bisimulation as a congruence
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Communication and Concurrency
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Gamma and the Chemical Reaction Model: Fifteen Years After
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Deriving bisimulation congruences: 2-categories vs precategories
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Bialgebraic Methods in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Reversing algebraic process calculi
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
Structural congruences have been used to define the semantics and to capture inherent properties of language constructs. They have been used as an addendum to transition system specifications in Plotkin's style of Structural Operational Semantics (SOS). However, there has been little theoretical work on establishing a formal link between these two semantic specification frameworks. In this paper, we give an interpretation of structural congruences inside the transition system specification framework. This way, we extend a number of well-behavedness meta-theorems for SOS (such as well-definedness of the semantics and congruence of bisimilarity) to the extended setting with structural congruences.