The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A symbolic reachability graph for coloured Petri nets
Theoretical Computer Science
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking
Model-Checking Multi-threaded Distributed Java Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Parameterized Verification of Multithreaded Software Libraries
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Modular verification of multithreaded programs
Theoretical Computer Science
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
Formal specification and verification of the C# thread model
Theoretical Computer Science - Formal methods for components and objects
Constraint-based automatic verification of abstract models of multithreaded programs
Theory and Practice of Logic Programming
Versatile boxes: a multi-purpose algebra of high-level Petri nets
Proceedings of the 2007 Summer Computer Simulation Conference
Quickly prototyping petri nets tools with SNAKES
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Automatic symmetry detection in well-formed nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Name creation vs. replication in Petri net systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
High level petri nets analysis with helena
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Hi-index | 0.00 |
Modelling and analysis of dynamic multi-threaded state systems often encounters obstacles when one wants to use automated verification methods, such as model checking. Our aim in this paper is to develop a technical device for coping with one such obstacle, namely that caused by dynamic process creation.We first introduce a general class of coloured Petri nets--not tied to any particular syntax or approach--allowing one to capture systems with dynamic (and concurrent) process creation as well as capable of manipulating data. Following this, we introduce the central notion of our method which is a marking equivalence that can be efficiently computed and then used, for instance, to aggregate markings in a reachability graph. In some situations, such an aggregation may produce a finite representation of an infinite state system which still allows one to establish the relevant behavioural properties. We show feasibility of the method on an example and provide initial experimental results.