Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards reachability trees for high-level Petri nets
Advances in Petri Nets 1984
Reachability analysis of Petri nets using symmetries
Systems Analysis Modelling Simulation
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Parallelizing the Murphi Verifier
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Functional verification of task partitioning for multiprocessor embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Designing Case Handling Systems
Transactions on Petri Nets and Other Models of Concurrency I
| Hi-index | 0.00 |
We report work in progress on a distributed version of explicit state space generation in the Petri net verification tool LoLA. We propose a data structure where all available memory of all involved workstations can be fully exploited, and load balancing actions are possible at any time while the verification is running. It is even possible to extend the set of involved workstations while a verification is running.