A syntactic commutativity format for SOS

Authors:
MohammadReza Mousavi;Michel Reniers;Jan Friso Groote
Affiliations:
Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands;Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands;Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands
Venue:
Information Processing Letters
Year:
2005

Citing 11
Cited 10

Structured operational semantics and bisimulation as a congruence

Information and Computation
Transition system specifications with negative premises

Theoretical Computer Science
Turning SOS rules into equations

Information and Computation
Ntyft/ntyxt rules reduce to ntree rules

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

Journal of the ACM (JACM)
Finite axiom systems for testing preorder and De Simone process languages

Theoretical Computer Science
A congruence theorem for structured operational semantics with predicates and negative premises

Nordic Journal of Computing
Axiomatizing GSOS with Termination

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A Congruence Theorem for Structured Operational Semantics with Predicates

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours

CONCUR '94 Proceedings of the 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 Rule Format for Associativity

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Rule Format for Unit Elements

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A Hierarchy of SOS Rule Formats

Electronic Notes in Theoretical Computer Science (ENTCS)
The microcosm principle and concurrency in coalgebra

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On Rule Formats for Zero and Unit Elements

Electronic Notes in Theoretical Computer Science (ENTCS)
Rule formats for distributivity

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Rule formats for determinism and idempotence

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Rule formats for determinism and idempotence

Science of Computer Programming
Rule formats for distributivity

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

Considering operators defined using Structural Operational Semantics (SOS), commutativity axioms are intuitive properties that hold for many of them. Proving this intuition is usually a laborious task, requiring several pages of boring and standard proof. To save this effort, we propose a syntactic SOS format which guarantees commutativity for a set of composition operators.