A Rule Format for Associativity
From MaRDI portal
Publication:3541037
DOI10.1007/978-3-540-85361-9_35zbMath1160.68461DBLPconf/concur/CranenMR08OpenAlexW1588042940WikidataQ57745691 ScholiaQ57745691MaRDI QIDQ3541037
No author found.
Publication date: 25 November 2008
Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_35
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (9)
Proving the validity of equations in GSOS languages using rule-matching bisimilarity ⋮ On Rule Formats for Zero and Unit Elements ⋮ Event algebra for transition systems composition application to timed automata ⋮ Rule formats for determinism and idempotence ⋮ SOS rule formats for idempotent terms and idempotent unary operators ⋮ Repairing time-determinism in the process algebra for hybrid systems ⋮ Rule formats for distributivity ⋮ SOS rule formats for zero and unit elements ⋮ A Timed Process Algebra for Wireless Networks with an Application in Routing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A syntactic commutativity format for SOS
- SOS formats and meta-theory: 20 years after
- Higher-level synchronising devices in Meije-SCCS
- A calculus of communicating systems
- A structural approach to operational semantics
- Notions of bisimulation and congruence formats for SOS with data
- Process Algebra
- The meaning of negative premises in transition system specifications
- The Microcosm Principle and Concurrency in Coalgebra
This page was built for publication: A Rule Format for Associativity
