Process algebra
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Congruence Theorem for Structured Operational Semantics with Predicates
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
A syntactic commutativity format for SOS
Information Processing Letters
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
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
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Rule formats for determinism and idempotence
Science of Computer Programming
A process algebra for wireless mesh networks
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Repairing time-determinism in the process algebra for hybrid systems ACPhssrt
Theoretical Computer Science
Rule formats for distributivity
Theoretical Computer Science
| Hi-index | 0.00 |
We propose a rule format that guarantees associativity of binary operators with respect to all notions of behavioral equivalence that are defined in terms of (im)possibility of transitions, e.g., the notions below strong bisimilarity in van Glabbeek's spectrum. The initial format is a subset of the De Simone format. We show that all trivial generalizations of our format are bound for failure. We further extend the format in a few directions and illustrate its application to several formalisms in the literature. A subset of the format is studied to obtain associativity with respect to graph isomorphism.