Symbolic Model Checking Commitment Protocols Using Reduction
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1487478
- Counterexample-preserving reduction for symbolic model checking
- Counterexample-preserving reduction for symbolic model checking
- Employing symmetry reductions in model checking
- Correct Hardware Design and Verification Methods
- scientific article; zbMATH DE number 1953019
- scientific article; zbMATH DE number 1903347
Cited in
(10)- A verification method for a commitment strategy of the BDI architecture
- \textsc{ProMoca}: probabilistic modeling and analysis of agents in commitment protocols
- Symbolic model checking the knowledge in Herbivore protocol
- scientific article; zbMATH DE number 2088755 (Why is no real title available?)
- Model checking agent communication
- Formal verification of complex coherence protocols using symbolic state models
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories
- On the SMT-based verification of communicative commitments
- Symbolic model checking of public announcement protocols
- Model checking fuzzy computation tree logic of multi-agent systems based on fuzzy interpreted systems
This page was built for publication: Symbolic Model Checking Commitment Protocols Using Reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999248)