Bouajjani, Ahmed and Dragoi, Cezara and Enea, Constantin and Jurski, Yan and Sighireanu, Mihaela - A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes

lmcs:991 - Logical Methods in Computer Science, April 22, 2009, Volume 5, Issue 2
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes

Authors: Bouajjani, Ahmed and Dragoi, Cezara and Enea, Constantin and Jurski, Yan and Sighireanu, Mihaela

We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks. They can be seen as Petri nets where tokens (representing occurrences of processes) are colored by values over some potentially infinite data domain such as integers, reals, etc. Furthermore, we define a logic, called CML (colored markings logic), for the description of CPN configurations. CML is a first-order logic over tokens allowing to reason about their locations and their colors. Both CPNs and CML are parametrized by a color logic allowing to express constraints on the colors (data) associated with tokens. We investigate the decidability of the satisfiability problem of CML and its applications in the verification of CPNs. We identify a fragment of CML for which the satisfiability problem is decidable (whenever it is the case for the underlying color logic), and which is closed under the computations of post and pre images for CPNs. These results can be used for several kinds of analysis such as invariance checking, pre-post condition reasoning, and bounded reachability analysis.


Source : oai:arXiv.org:0903.3126
DOI : 10.2168/LMCS-5(2:3)2009
Volume: Volume 5, Issue 2
Published on: April 22, 2009
Submitted on: March 8, 2008
Keywords: Computer Science - Logic in Computer Science,E.1,F.3.1,F.4.1,F.4.3,I.2.2


Share

Consultation statistics

This page has been seen 41 times.
This article's PDF has been downloaded 13 times.