Algorithms for mutual exclusion
Algorithms for mutual exclusion
Implementing LTL model checking with net unfoldings
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
LP Deadlock Checking Using Partial Order Dependencies
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
From local to global temporal logics over Mazurkiewicz traces
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Verification of bounded Petri nets using integer programming
Formal Methods in System Design
Unfoldings: A Partial-Order Approach to Model Checking (Monographs in Theoretical Computer Science. An EATCS Series)
McMillan's Complete Prefix for Contextual Nets
Transactions on Petri Nets and Other Models of Concurrency I
A declarative encoding of telecommunications feature subscription in SAT
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
On the computation of McMillan's prefix for contextual nets and graph grammars
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Construction and SAT-based verification of contextual unfoldings
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Efficient contextual unfolding
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Unfolding Based Algorithms for the Reachability Problem
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
Recent work studied the unfolding construction for contextual nets, i.e. nets with read arcs. Such unfoldings are more concise and can usually be constructed more efficiently than for Petri nets. However, concrete verification algorithms exploiting these advantages were lacking so far. We address this question and propose SAT-based verification algorithms for deadlock and reachability of contextual nets. Moreover, we study optimizations of the SAT encoding and report on experiments.