Saving Space by Fully Exploiting Invisible Transitions
Formal Methods in System Design
Algebraic nets with flexible arcs
Theoretical Computer Science
IEEE Standard for Information Technology - Portable Operating Interface System, 1387.2-1995: Administration
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Maria: Modular Reachability Analyser for Algebraic System Nets
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Parallelizing the Murphi Verifier
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Exploiting Stabilizers and Parallelism in State Space Generation with the Symmetry Method
ACSD '01 Proceedings of the Second International Conference on Application of Concurrency to System Design
Efficient symbolic state-space construction for asynchronous systems
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Model checking safety properties in modular high-level nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
| Hi-index | 0.00 |
Assuring the quality of safety-critical software systems requires more rigorous methods than testing. Model checking by exhaustive state space enumeration, "testing al executions," is an alternative, but the use of state and memory reduction techniques makes runtime a major limiting factor. We describe a simple parallel version of a state space enumeration algorithm that utilises the unused computing power of office workstations while not congesting their memories. In an experiment with a complex data link protocol, our implementation of the algorithm achieves close to linear speedups on a heterogeneous network of workstations.