Abstract reduction in directed model checking CCS processes
DOI10.1007/s00236-012-0161-3zbMath1282.68167OpenAlexW2063192183MaRDI QIDQ715051
Gigliola Vaglini, Antonella Santone
Publication date: 15 October 2012
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-012-0161-3
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) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Uses Software
Cites Work
- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes
- Local model checking in the modal mu-calculus
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Selective mu-calculus and formula-based equivalence of transition systems
- Efficient Verification of a Multicast Protocol for Mobile Computing
- Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Graph-Based Algorithms for Boolean Function Manipulation
- Formal Verification of Concurrent Systems via Directed Model Checking
- 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: Abstract reduction in directed model checking CCS processes