From Many Places to Few: Automatic Abstraction Refinement for Petri Nets

Ganty, Pierre; Raskin, Jean-François; Begin, Laurent Van

doi:10.1007/978-3-540-73094-1_10

Cited by 15 publications

(18 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of these algorithms suffer, however, from an intractable number of vector elements after the translation from (Boolean) programs: one per local program state. Recent work by Raskin et al has attempted to address the dimensionality problem using an abstraction refinement loop [14], where abstract models of the Petri net under investigation are of lower dimension than the original.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Cutoff Detection in Parameterized Concurrent Programs

Kaiser

Kroening

Wahl

2010

Lecture Notes in Computer Science

100

View full text Add to dashboard Cite

Abstract. The verification problem for parameterized concurrent programs is a grand challenge in computing. We consider the class of finitestate programs executed by an unbounded number of replicated threads, which is essential in concurrent software verification using predicate abstraction. While the reachability problem for this class is decidable, existing algorithms are of limited use in practice, due to an exponential-space lower bound. In this paper, we present an alternative method based on a reachability cutoff : a number n of threads that suffice to generate all reachable program locations. We give a sufficient condition, verifiable dynamically during the reachability analysis, that allows us to conclude that n is a cutoff. We then make the method complete, using a lean backward coverability analysis. We demonstrate the efficiency of the approach on Petri net encodings of communication protocols, as well as on non-recursive Boolean programs run by arbitrarily many parallel threads.

show abstract

Section: Related Workmentioning

confidence: 99%

Dynamic Cutoff Detection in Parameterized Concurrent Programs

Kaiser

Kroening

Wahl

2010

Lecture Notes in Computer Science

100

View full text Add to dashboard Cite

show abstract

“…It reduces the provenance verification problem to Petri net coverability using the algorithm from Section 4. We first used state-of-the-art tools for Petri net coverability [9,21]. Unfortunately, the times taken to verify the provenance properties were high.…”

Section: Expspace Upper Boundsmentioning

confidence: 99%

“…All experiments were performed on a 2 core Intel Xeon X5650 CPU machine with 64GB memory and 64bit Linux (Debian/Lenny). We compare state-of-the-art Petri net coverability tools (Mist2 [9] and Petruchio [21]) with our Spin-based coverability checker. We run Petruchio and three different options of Mist2 and report the best times.…”

Section: Case Studies: Message Passing Benchmarksmentioning

confidence: 99%

Static Provenance Verification for Message Passing Programs

2013

View full text Add to dashboard Cite

Abstract. Provenance information records the source and ownership history of an object. We study the problem of provenance tracking in concurrent programs, in which several principals execute concurrent processes and exchange messages over unbounded but unordered channels. The provenance of a message, roughly, is a function of the sequence of principals that have transmitted the message in the past. The provenance verification problem is to statically decide, given a message passing program and a set of allowed provenances, whether the provenance of all messages in all possible program executions, belongs to the allowed set. We formalize the provenance verification problem abstractly in terms of well-structured provenance domains, and show a general decidability result for it. In particular, we show that if the provenance of a message is a sequence of principals who have sent the message, and a provenance query asks if the provenance lies in a regular set, the problem is decidable and EXPSPACE-complete. While the theoretical complexity is high, we show an implementation of our technique that performs efficiently on a set of Javascript examples tracking provenances in Firefox extensions. Our experiments show that many browser extensions store and transmit user information although the user sets the browser to the private mode.

show abstract

“…Binary decision diagrams, or generalisations of them, can be fruitfully combined with static analysis (e.g, [93]) to simplify the reachability analysis. Abstract interpretation may be used to reduce the size of the net (see, e.g., [49]) and partial order semantics to check reachability, coverability and absence of deadlocks and to model check behavioural logics for PNs [46].…”

Section: Behavioural Properties Of Petri Netsmentioning

confidence: 99%

Petri nets for modelling metabolic pathways: a survey

et al. 2010

View full text Add to dashboard Cite

Abstract. In the last fifteen years, several research efforts have been directed towards the representation and the analysis of metabolic pathways by using Petri nets. The goal of this paper is twofold. First, we discuss how the knowledge about metabolic pathways can be represented with Petri nets. We point out the main problems that arise in the construction of a Petri net model of a metabolic pathway and we outline some solutions proposed in the literature. Second, we present a comprehensive review of recent research on this topic, in order to assess the maturity of the field and the availability of a methodology for modelling a metabolic pathway by a corresponding Petri net.

show abstract

From Many Places to Few: Automatic Abstraction Refinement for Petri Nets

Cited by 15 publications

References 21 publications

Dynamic Cutoff Detection in Parameterized Concurrent Programs

Dynamic Cutoff Detection in Parameterized Concurrent Programs

Static Provenance Verification for Message Passing Programs

Petri nets for modelling metabolic pathways: a survey

Contact Info

Product

Resources

About