Rule formats for distributivity

Authors:
Luca Aceto;Matteo Cimini;Anna Ingolfsdottir;Mohammadreza Mousavi;Michel A. Reniers
Affiliations:
ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland;ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland;ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland;Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands;Department of Mechanical Engineering, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands
Venue:
Theoretical Computer Science
Year:
2012

Citing 23
Cited 0

Communicating sequential processes

Communicating sequential processes
Well-founded semantics coincides with three-valued stable semantics

Fundamenta Informaticae
Turning SOS rules into equations

Information and Computation
The algebra of timed processes, ATP: theory and application

Information and Computation
Bisimulation can't be traced

Journal of the ACM (JACM)
Communicating sequential processes

Communications of the ACM
Communication and Concurrency

Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
A tutorial on LOTOS

Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
Delayed choice: an operator for joining Message Sequence Charts

Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
The Importance of the Left Merge Operator in Process Algebras

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
CCS with Hennessy's merge has no finite-equational axiomatization

Theoretical Computer Science - Expressiveness in concurrency
Bisimilarity is not finitely based over BPA with interrupt

Theoretical Computer Science - Algebra and coalgebra in 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 finite equational base for CCS with left merge and communication merge

ACM Transactions on Computational Logic (TOCL)
Semantics and expressiveness of ordered SOS

Information and Computation
A Rule Format for Unit Elements

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A syntactic commutativity format for SOS

Information Processing Letters
On Rule Formats for Zero and Unit Elements

Electronic Notes in Theoretical Computer Science (ENTCS)
Rule formats for determinism and idempotence

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Finite equational bases in process algebra: results and open questions

Processes, Terms and Cycles

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. Some conditions ensuring the invalidity of the left-distributivity law are also offered.