The weakest deadlock-preserving congruence

DOI10.1016/0020-0190(94)00214-JzbMath0875.68620WikidataQ127554564 ScholiaQ127554564MaRDI QIDQ673911

Antti Valmari

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

ConcurrencySpecification languagesFormal semantics

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (8)

Compositional failure-based semantic models for basic LOTOS ⋮ All congruences below stability-preserving fair testing or CFFD ⋮ Of wlp and CSP ⋮ Compositionality in state space verification methods ⋮ Multi-parameterised compositional verification of safety properties ⋮ On constructibility and unconstructibility of LTS operators from other LTS operators ⋮ Compositional State Space Reduction Using Untangled Actions ⋮ Stepwise development of process-algebraic specifications in decorated trace semantics

Cites Work

• Compositional failure-based semantic models for basic LOTOS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The weakest deadlock-preserving congruence