Focus points and convergent process operators: A proof strategy for protocol verification
From MaRDI portal
Recommendations
Cites work
- A compositional protocol verification using relativized bisimulation
- A computer checked algebraic verification of a distributed summation algorithm
- Algebraic process verification.
- Applications of Process Algebra
- Branching time and abstraction in bisimulation semantics
- Formal verification of a leader election protocol in process algebra
- Forward and backward simulations. I. Untimed Systems
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 3894457 (Why is no real title available?)
- Linearization in parallel pCRL
- Process Algebra
- The cones and foci proof technique for timed transition systems
- The tree identify protocol of IEEE 1394 in \(\mu\)CRL
Cited in
(12)- A compositional protocol verification using relativized bisimulation
- Distributed consensus, revisited
- Algebraic process verification.
- scientific article; zbMATH DE number 3958712 (Why is no real title available?)
- Cones and foci for protocol verification revisited
- scientific article; zbMATH DE number 7269247 (Why is no real title available?)
- Verification of mobile ad hoc networks: an algebraic approach
- Focus points and convergent process operators
- Linearization in parallel pCRL
- A linear process-algebraic format with data for probabilistic automata
- On process equivalence = equation solving in CCS
- Cones and foci: A mechanical framework for protocol verification
This page was built for publication: Focus points and convergent process operators: A proof strategy for protocol verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349249)