On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
From MaRDI portal
Publication:3599070
DOI10.1007/978-3-540-95891-8_18zbMath1206.68212OpenAlexW1567813390MaRDI QIDQ3599070
Taolue Chen, W. J. Fokkink, Robert J. van Glabbeek
Publication date: 3 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_18
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Modular construction and partial order semantics of Petri nets
- Nested semantics over finite trees are equationally hard
- Ready to preorder: an algebraic and general proof
- Fair testing
- On finite alphabets and infinite bases
- Ready to preorder: the case of weak process semantics
- A complete axiomatisation for observational congruence of finite-state behaviours
- Testing equivalences for processes
- Notes on the methodology of CCS and CSP
- Impossible futures and determinism
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
- Ready to Preorder: Get Your BCCSP Axiomatization for Free!
- A Theory of Communicating Sequential Processes
- Automata, Languages and Programming
- Liveness, Fairness and Impossible Futures
This page was built for publication: On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
