Automatic verification of distributed systems: the process algebra approach.
From MaRDI portal
(Redirected from Publication:960505)
Recommendations
Cites work
- scientific article; zbMATH DE number 4157900 (Why is no real title available?)
- scientific article; zbMATH DE number 3986629 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4056971 (Why is no real title available?)
- scientific article; zbMATH DE number 4074504 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- scientific article; zbMATH DE number 125881 (Why is no real title available?)
- scientific article; zbMATH DE number 177261 (Why is no real title available?)
- scientific article; zbMATH DE number 177510 (Why is no real title available?)
- scientific article; zbMATH DE number 177845 (Why is no real title available?)
- scientific article; zbMATH DE number 4119617 (Why is no real title available?)
- A Unified Approach to Path Problems
- Algebraic laws for nondeterminism and concurrency
- Algèbre de processus et synchronisation
- An action-based framework for veryfying logical and behavioural properties of concurrent systems
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Automatizing parametric reasoning on distributed concurrent systems
- Bisimulation through probabilistic testing
- Branching time and abstraction in bisimulation semantics
- CIRCAL and the representation of communication, concurrency, and time
- Calculi for synchrony and asynchrony
- Characterizing finite Kripke structures in propositional temporal logic
- Fast Algorithms for Solving Path Problems
- Formal verification of parallel programs
- Generating BDDs for symbolic model checking in CCS
- Graph-Based Algorithms for Boolean Function Manipulation
- LOTOS
- Linear time, branching time and partial order in logics and models for concurrency. School/workshop, Noordwijkerhout, The Netherlands, May 30- June 3, 1988. Proceedings
- Process algebra for synchronous communication
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Results on the propositional \(\mu\)-calculus
- Submodule construction as equation solving in CCS
- Symbolic model checking: \(10^{20}\) states and beyond
- Testing equivalence as a bisimulation equivalence
- Testing equivalences for processes
- Three Partition Refinement Algorithms
- Three logics for branching bisimulation
- Universal axioms for bisimulations
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- “Sometimes” and “not never” revisited
Cited in
(13)- A verification technique for reversible process algebra
- Process algebra and model checking
- Automatizing parametric reasoning on distributed concurrent systems
- scientific article; zbMATH DE number 177262 (Why is no real title available?)
- Equivalence checking 40 years after: a review of bisimulation tools
- CADP 2010: a toolbox for the construction and analysis of distributed processes
- On the usability of process algebra: An architectural view
- Algebraic process verification.
- scientific article; zbMATH DE number 1701364 (Why is no real title available?)
- scientific article; zbMATH DE number 734956 (Why is no real title available?)
- Automatic verification for a class of distributed systems
- scientific article; zbMATH DE number 58291 (Why is no real title available?)
- Protocol verification with the Aldébaran toolset
This page was built for publication: Automatic verification of distributed systems: the process algebra approach.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960505)
