Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modular Algebraic Nets to Specify Concurrent Systems
IEEE Transactions on Software Engineering
Compositional verification of concurrent systems using Petri-net-based condensation rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Checking safety properties using compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Model Checking Based on Simultaneous Reachability Analysis
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Modular State Space Analysis of Coloured Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
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
Efficiently verifying safety properties with idle office computers
CRPIT '02 Proceedings of the conference on Application and theory of petri nets: formal methods in software engineering and defence systems - Volume 12
Model-based development of dynamically adaptive software
Proceedings of the 28th international conference on Software engineering
A distributed verification approach for modular Petri nets
Proceedings of the 2007 Summer Computer Simulation Conference
Modular state spaces for prioritised Petri Nets
FOCS'10 Proceedings of the 16th Monterey conference on Foundations of computer software: modeling, development, and verification of adaptive systems
Analysis of properties of petri synthesis net
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Local Verification Using a Distributed State Space
Fundamenta Informaticae
| Hi-index | 0.00 |
Model checking by exhaustive state space enumeration is one of the most developed analysis methods for distributed event systems. Its main problem--the size of the state spaces--has been addressed by various reduction methods. Complex systems tend to consist of loosely connected modules, which may perform internal tasks in parallel. The possible interleavings of these parallel tasks easily leads to a large number of reachable global states. In modular state space analysis, the internal actions are explored separately in each module, and the global state space only includes synchronisations. This article introduces nested modular nets, which are hierarchal collections of nets synchronising via shared transitions, and presents a simple algorithm for model checking safety properties in modular systems.