Compositionality in state space verification methods

DOI10.1007/3-540-61363-3_3zbMath1418.68155OpenAlexW2098418324MaRDI QIDQ4633153

Antti Valmari

Publication date: 2 May 2019

Published in: Application and Theory of Petri Nets 1996 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61363-3_3

zbMATH Keywords

labeled transition systemparallel compositiontrace semanticserror indicationdivergence trace

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

On the computation of counterexamples in compositional nonblocking verification ⋮ Selective mu-calculus and formula-based equivalence of transition systems ⋮ Unnamed Item

Uses Software

• LOTOS

Cites Work

• The weakest deadlock-preserving congruence
• CCS expressions, finite state processes, and three problems of equivalence
• An implementation of an efficient algorithm for bisimulation equivalence
• Minimizing the number of transitions with respect to observation equivalence
• A partial order approach to branching time logic model checking.
• Compositional failure-based semantic models for basic LOTOS
• Testing equivalence as a bisimulation equivalence
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• A Theory of Communicating Sequential Processes
• Acceptance trees
• Three logics for branching bisimulation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compositionality in state space verification methods