Symbolic guided search for CTL model checking
Proceedings of the 37th Annual Design Automation Conference
Lazy group sifting for efficient symbolic state traversal of FSMs
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Hints to accelerate Symbolic Traversal
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Verifying Intuition - ILF Checks DAWN Proofs
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
ILF and DAWN for Verifying Distributed Algorithms - An Idea for a Tool
Fundamenta Informaticae
Integrating Distributed Algorithms into Distributed Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
We argue that high-level Petri nets are well suited for the representation of distributed algorithms as well as for correctness proofs. To this end, we provide a simple definition of high-level Petri nets, a way to formulate message-passing algorithms in this notion, a temporal-logic style language for the formulation of properties, and a proof technique which combines techniques from Petri net theory and from temporal logics. As a nontrivial case study, we present a variant of Raymond's message-passing mutual exclusion algorithm that works on arbitrary connected networks.