Bisimulations for a calculus of broadcasting systems
From MaRDI portal
Publication:1276256
DOI10.1016/S0304-3975(97)00261-2zbMath0915.68065MaRDI QIDQ1276256
Matthew C. B. Hennessy, Julian Rathke
Publication date: 22 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
A synchronous \(\pi\)-calculus, The SL synchronous language, revisited, SMT-based generation of symbolic automata, Compositional equivalences based on open pNets, Broadcast Calculus Interpreted in CCS upto Bisimulation, Tree Process Calculus, A coordination protocol language for power grid operation control, Characterising Testing Preorders for Broadcasting Distributed Systems, An observational theory for mobile ad hoc networks (full version), A Theory for the Composition of Concurrent Processes, Bisimulations for a calculus of broadcasting systems, An Observational Theory for Mobile Ad Hoc Networks, A Prospectus for Mobile Broadcasting Systems
Cites Work
- Unnamed Item
- Unnamed Item
- Symbolic bisimulations
- Communicating processes with value-passing and assignments
- A proof system for communicating processes with value-passing
- Bisimulations for a calculus of broadcasting systems
- Asynchronous process calculi: The first- and higher-order paradigms
- Proof systems for message-passing process algebras
- CONCUR '95: Concurrency theory. 6th international conference, Philadelphia, PA, USA, August 21--24, 1995. Proceedings
- Broadcast Calculus Interpreted in CCS upto Bisimulation
- Barbed bisimulation
- On bisimulations for the asynchronous π-calculus