The weakest deadlock-preserving congruence
From MaRDI portal
Publication:673911
DOI10.1016/0020-0190(94)00214-JzbMath0875.68620MaRDI QIDQ673911
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q55: Semantics in the theory of computing
Related Items
Compositionality in state space verification methods, Multi-parameterised compositional verification of safety properties, Stepwise development of process-algebraic specifications in decorated trace semantics, Compositional failure-based semantic models for basic LOTOS, All congruences below stability-preserving fair testing or CFFD, On constructibility and unconstructibility of LTS operators from other LTS operators, Compositional State Space Reduction Using Untangled Actions, Of wlp and CSP
Cites Work