Towards Efficient Verification of Systems with Dynamic Process Creation

Abstract : 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 be-havioural properties. We show feasibility of the method on an example and provide initial experimental results.
Document type :
Book sections
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02310882
Contributor : Franck Pommereau <>
Submitted on : Thursday, October 10, 2019 - 3:03:15 PM
Last modification on : Saturday, October 12, 2019 - 1:08:50 AM

File

KKPP-ICTAC-2008.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Hanna Klaudel, Maciej Koutny, Elisabeth Pelz, Franck Pommereau. Towards Efficient Verification of Systems with Dynamic Process Creation. Theoretical Aspects of Computing - ICTAC 2008, 5160, Springer Berlin Heidelberg, pp.186-200, 2008, Lecture Notes in Computer Science, ⟨10.1007/978-3-540-85762-4_13⟩. ⟨hal-02310882⟩

Share

Metrics

Record views

10

Files downloads

12