Compositional failure-based semantic models for basic LOTOS

DOI10.1007/BF01211218zbMath0838.68076OpenAlexW1994013545MaRDI QIDQ1903079

Martti Tienari, Antti Valmari

Publication date: 1 February 1996

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01211218

zbMATH Keywords

verificationsemantic modelsfailures equivalence

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (12)

Fair testing ⋮ All congruences below stability-preserving fair testing or CFFD ⋮ Compositionality in state space verification methods ⋮ The weakest deadlock-preserving congruence ⋮ General Refinement, Part One: Interfaces, Determinism and Special Refinement ⋮ Contexts, refinement and determinism ⋮ Failure-based equivalence of constraint automata ⋮ Compositional Failure-based Equivalence of Constraint Automata ⋮ Relational concurrent refinement. II: Internal operations and outputs ⋮ A Logical Process Calculus ⋮ On constructibility and unconstructibility of LTS operators from other LTS operators ⋮ Stepwise development of process-algebraic specifications in decorated trace semantics

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weakest deadlock-preserving congruence
• CCS expressions, finite state processes, and three problems of equivalence
• Specification-oriented semantics for communicating processes
• Minimizing the number of transitions with respect to observation equivalence
• Testing equivalences for processes
• A Theory of Communicating Sequential Processes

This page was built for publication: Compositional failure-based semantic models for basic LOTOS