Automatic verification of distributed systems: the process algebra approach.
From MaRDI portal
Publication:960505
DOI10.1007/BF00121261zbMath1425.68294MaRDI QIDQ960505
Paola Inverardi, Corrado Priami
Publication date: 21 December 2008
Published in: Formal Methods in System Design (Search for Journal in Brave)
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 (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LOTOS
- Universal axioms for bisimulations
- Algèbre de processus et synchronisation
- Results on the propositional \(\mu\)-calculus
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Calculi for synchrony and asynchrony
- Characterizing finite Kripke structures in propositional temporal logic
- Bisimulation through probabilistic testing
- Linear time, branching time and partial order in logics and models for concurrency. School/workshop, Noordwijkerhout, The Netherlands, May 30- June 3, 1988. Proceedings
- Symbolic model checking: \(10^{20}\) states and beyond
- Submodule construction as equation solving in CCS
- Automatizing parametric reasoning on distributed concurrent systems
- Testing equivalences for processes
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Generating BDDs for symbolic model checking in CCS
- Testing equivalence as a bisimulation equivalence
- CIRCAL and the representation of communication, concurrency, and time
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Graph-Based Algorithms for Boolean Function Manipulation
- Process algebra for synchronous communication
- “Sometimes” and “not never” revisited
- Algebraic laws for nondeterminism and concurrency
- Three Partition Refinement Algorithms
- A Unified Approach to Path Problems
- Fast Algorithms for Solving Path Problems
- Formal verification of parallel programs
- Three logics for branching bisimulation
- Branching time and abstraction in bisimulation semantics
- An action-based framework for veryfying logical and behavioural properties of concurrent systems
This page was built for publication: Automatic verification of distributed systems: the process algebra approach.
