On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

DOI10.1007/978-3-540-95891-8_18MaRDI QIDQ3599070zbMATH OpenOpenAlexFDO

Authors Taolue Chen, Wan Fokkink, Rob 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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automata, Languages and Programming
• On the axiomatizability of impossible futures
• Foundations of Software Science and Computation Structures
• The equational theory of weak complete simulation semantics over BCCSP
• On finite alphabets and infinite bases

Cites work

• A complete axiomatisation for observational congruence of finite-state behaviours
• A Theory of Communicating Sequential Processes
• Automata, Languages and Programming
• Fair testing
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• Impossible futures and determinism
• Liveness, Fairness and Impossible Futures
• Modular construction and partial order semantics of Petri nets
• Nested semantics over finite trees are equationally hard
• Notes on the methodology of CCS and CSP
• On finite alphabets and infinite bases
• On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
• Ready to preorder: an algebraic and general proof
• Ready to Preorder: Get Your BCCSP Axiomatization for Free!
• Ready to preorder: the case of weak process semantics
• Testing equivalences for processes
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.

Cited in

(6)

• On the axiomatizability of impossible futures
• On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
• Foundations of Software Science and Computation Structures
• Automata, Languages and Programming
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Failures semantics based on interval semiwords is a congruence for refinement

This page was built for publication: On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599070)