Process Algebra and Model Checking
From MaRDI portal
Publication:3176390
DOI10.1007/978-3-319-10575-8_32zbMath1392.68243OpenAlexW2804506387MaRDI QIDQ3176390
Scott A. Smolka, Rance Cleaveland, A. W. Roscoe
Publication date: 20 July 2018
Published in: Handbook of Model Checking (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-10575-8_32
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
- Unnamed Item
- SAT-solving in CSP trace refinement
- Probabilistic and prioritized models of timed CSP
- Results on the propositional \(\mu\)-calculus
- CCS expressions, finite state processes, and three problems of equivalence
- Algebra of communicating processes with abstraction
- A timed model for communicating sequential processes
- A calculus of communicating systems
- A calculus of mobile processes. I
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Checking noninterference in timed CSP
- Understanding concurrent systems
- Testing equivalence as a bisimulation equivalence
- Real time process algebra
- Slow Abstraction via Priority
- Static Livelock Analysis in CSP
- CSP is Expressive Enough for π
- Abstraction and Abstraction Refinement
- A Theory of Communicating Sequential Processes
- Algebraic laws for nondeterminism and concurrency
- Three Partition Refinement Algorithms
- Process Algebra
- Communicating sequential processes
- Unbounded Non-determinism in CSP
- Branching time and abstraction in bisimulation semantics
- What good are digital clocks?
- FDR3 — A Modern Refinement Checker for CSP
- Communicating Sequential Processes. The First 25 Years
- Communicating Sequential Processes. The First 25 Years
- Communicating Sequential Processes. The First 25 Years
- Generic tools for verifying concurrent systems
- Partial-order reduction in the weak modal mu-calculus
This page was built for publication: Process Algebra and Model Checking
