Notions of bisimulation and congruence formats for SOS with data
From MaRDI portal
Publication:2486401
DOI10.1016/j.ic.2005.03.002zbMath1082.68075OpenAlexW2044965190WikidataQ57745774 ScholiaQ57745774MaRDI QIDQ2486401
Publication date: 5 August 2005
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2005.03.002
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Modelling and analysing neural networks using a hybrid process algebra ⋮ Views on Behaviour Protocols and Their Semantic Foundation ⋮ Linearization of hybrid processes ⋮ Syntax and consistent equation semantics of hybrid Chi ⋮ SOS formats and meta-theory: 20 years after ⋮ Revisiting sequential composition in process calculi ⋮ DyNetKAT: an algebra of dynamic networks ⋮ Structural operational semantics through context-dependent behaviour ⋮ Repairing time-determinism in the process algebra for hybrid systems ⋮ Unnamed Item ⋮ HYPE: hybrid modelling by composition of flows ⋮ A Rule Format for Associativity ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Thread algebra for strategic interleaving ⋮ Synchronous cooperation for explicit multi-threading ⋮ Dynamic structural operational semantics ⋮ Relating Hybrid Chi to Other Formalisms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transition system specifications with negative premises
- Redesign of a systems engineering language: formalisation of \(\chi\)
- Higher-level synchronising devices in Meije-SCCS
- A calculus of communicating systems
- Structured operational semantics and bisimulation as a congruence
- A behavioural theory of first-order CML
- Plain CHOCS. A second generation calculus for higher order processes
- Turning SOS rules into equations
- Process algebra with guards: Combining hoare logic with process algebra
- Universal coalgebra: A theory of systems
- Hybrid process algebra
- Process algebra for hybrid systems
- Process algebra with timing
- Bisimilarity of open terms.
- The origins of structural operational semantics
- The meaning of negative premises in transition system specifications. II
- Axiomatizing GSOS with termination
- A structural approach to operational semantics
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- Bisimulation can't be traced
- Topological Aspects of Hybrid Processes
- Variable binding operators in transition system specifications
