Rule formats for determinism and idempotence

Authors:
Luca Aceto;Arnar Birgisson;Anna Ingolfsdottir;MohammadReza Mousavi;Michel A. Reniers
Affiliations:
School of Computer Science, Reykjavik University, Reykjavik, Iceland;School of Computer Science, Reykjavik University, Reykjavik, Iceland;School of Computer Science, Reykjavik University, Reykjavik, Iceland;Department of Computer Science, Eindhoven University of Technology, Eindhoven, MB, The Netherlands;Department of Computer Science, Eindhoven University of Technology, Eindhoven, MB, The Netherlands
Venue:
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Year:
2009

Citing 14
Cited 5

Communicating sequential processes

Communicating sequential processes
Finite conjunctive nondeterminism

Concurrency and nets: advances in Petri nets
Process algebra

Process algebra
Transition system specifications with negative premises

Theoretical Computer Science
The algebra of timed processes, ATP: theory and application

Information and Computation
Process Algebra with Timing

Process Algebra with Timing
A congruence theorem for structured operational semantics with predicates and negative premises

Nordic Journal of Computing
Delayed choice: an operator for joining Message Sequence Charts

Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
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
Semantics and expressiveness of ordered SOS

Information and Computation
A syntactic commutativity format for SOS

Information Processing Letters
Orthogonal extensions in structural operational semantics

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Probabilistic congruence for semistochastic generative processes

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

A Rule Format for Unit Elements

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
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

Science of Computer Programming
Rule formats for distributivity

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Determinism is a semantic property of (a fragment of) a language that specifies that a program cannot evolve operationally in several different ways. Idempotence is a property of binary composition operators requiring that the composition of two identical specifications or programs will result in a piece of specification or program that is equivalent to the original components. In this paper, we propose two (related) meta-theorems for guaranteeing determinism and idempotence of binary operators. These meta-theorems are formulated in terms of syntactic templates for operational semantics, called rule formats. We show the applicability of our formats by applying them to various operational semantics from the literature.