The Coarsest Precongruences Respecting Safety and Liveness Properties

DOI10.1007/978-3-642-15240-5_3zbMath1202.68268arXiv1007.5491OpenAlexW3101591573MaRDI QIDQ3163871

Robert J. van Glabbeek

Publication date: 27 October 2010

Published in: IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.5491

zbMATH Keywords

labelled transition systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Ordered sets (06A99)

Related Items (8)

Weak equivalence of higher-dimensional automata ⋮ All congruences below stability-preserving fair testing or CFFD ⋮ A linear-time branching-time perspective on interface automata ⋮ Unnamed Item ⋮ Just testing ⋮ Analysing AWN-Specifications Using mCRL2 (Extended Abstract) ⋮ Trace- and failure-based semantics for responsiveness ⋮ Ensuring liveness properties of distributed systems: open problems

This page was built for publication: The Coarsest Precongruences Respecting Safety and Liveness Properties