Distributed Unfolding of Petri Nets

Baldan, Paolo; Haar, Stefan; König, Barbara

doi:10.1007/11690634_9

Cited by 14 publications

(21 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…15.7. Another lead was followed in [6] where the composition was required to form a pullback in a suitable Petri net category (see also [18]), which allows to use powerful algebraic tools to characterize the data exchange between two components. While the details of this research are beyond the scope of this presentation, one should note that all results point to the fact that best theoretical (and practical ?)…”

Section: Taking the Methodology Furthermentioning

confidence: 99%

“…The advantage is that results such as 15.2 can be derived from much stronger results which imply that the unfolding of the pullback of two safe nets is isomorphic to the pullback of the two unfoldings. The theory necessary to detail these algebraic tools is beyond the scope of this chapter; see [6,7,18] . In the asynchronous diagnosis setting, observations are partially ordered.…”

Section: Asynchronous Diagnosismentioning

confidence: 99%

See 1 more Smart Citation

Diagnosis with Petri Net Unfoldings

Haar¹,

Fabre²

2013

Lecture Notes in Control and Information Sciences

Self Cite

View full text Add to dashboard Cite

Section: Taking the Methodology Furthermentioning

confidence: 99%

Section: Asynchronous Diagnosismentioning

confidence: 99%

Diagnosis with Petri Net Unfoldings

Haar¹,

Fabre²

2013

Lecture Notes in Control and Information Sciences

Self Cite

View full text Add to dashboard Cite

“…Both problems were overcome in the next years. Improved algorithms for constructing complete prefixes were described in [49,22,23,31,32,35,36,38,24], and extensions to (almost) arbitrary properties expressible in Linear Temporal Logic (LTL) were presented in [16,19,20].Since 2000 the algorithms for constructing complete prefixes have been parallelized [33,55] and distributed [5]. Initially developed for systems modeled as "plain" Petri nets, the unfolding approach has been extended to high-level Petri nets [37,55] [3,2].…”

mentioning

confidence: 99%

mentioning

confidence: 99%

“…Since 2000 the algorithms for constructing complete prefixes have been parallelized [33,55] and distributed [5]. Initially developed for systems modeled as "plain" Petri nets, the unfolding approach has been extended to high-level Petri nets [37,55], symmetrical Petri nets [17], unbounded Petri nets [1], nets with read arcs [59,4], time Petri nets [25,14,15,58],products of transition systems [22] automata communicating through queues [44], networks of timed automata [10,12], process algebras [43], and graph transformation systems [3,2].…”

mentioning

confidence: 99%

See 1 more Smart Citation

A False History of True Concurrency: From Petri to Tools

Esparza

2010

Model Checking Software

View full text Add to dashboard Cite

Abstract. I briefly review the history of the unfolding approach to model checking.Carl Adam Petri passed away on July 2, 2010. I learnt about his death three days later, a few hours after finishing this text. He was a very profound and highly original thinker, and will be sadly missed. This note is dedicated to his memory.In some papers and talks, Moshe Vardi has described the history of the automatatheoretic approach to model checking, the verification technique that inspired the SPIN model checker and other tools. He traces it back to the work of theoreticians like Büchi, Prior, Trakhtenbrot and others, whose motivations were surprisingly far away from the applications that their ideas found down the line. Inspired by this work, in this note I briefly present the origins of the unfolding approach to model checking [21], a branch of the automata-theoretic approach that alleviates the state-explosion problem caused by concurrency.Since the unfolding approach is based on the theory of true concurrency, describing its origins requires to speak about the origin of true concurrency itself. However, here I only touch upon those aspects of the theory that directly inspired the unfolding approach. This leaves many important works out, and so this is a very partial and "false" history of true concurrency.The theory of true concurrency starts with two fundamental contributions by Carl Adam Petri, described in detail by Brauer and Reisig in an excellent article [11]. Both were a result of Petri's interest in analyzing the connection between mathematical, abstract computing machines, and their physical realizations. In his dissertation "Kommunikation mit Automaten", defended in 1962, Petri observes that the performance of a physically implemented Turing machine will degrade over time if the machine uses more and more storage space, because in this case signals have to travel longer and longer distances over longer and longer wires. To solve this problem he proposes an asynchronous architecture in which the storage space can be extended while the machine continues to operate. In the dissertation this abstract machine is described with the help of several semi-formal representations, but three years later Petri has already distilled the first mathematical formalism for asynchronous computation, and, arguably, the beginning of concurrency theory: Petri nets.Petri's second contribution is an analysis of the notion of execution of a machine as a sequence of global states, or as a sequence of events ordered by their occurrence times with respect to some global clock. He observes that global states or global clocks are again a mathematical construct that cannot be "implemented": since information can only travel at finite speed, no part of a system can know the state of all its components at a certain moment in time. 1 He proposes to replace executions by nonsequential processes, sets of events ordered not by the time at which they occur, but by the causality relation, which is independent of the observer. The theory of nonseque...

show abstract

Distributed Unfolding of Petri Nets

Baldan

Haar

König

2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Some recent Petri net-based approaches to fault diagnosis of distributed systems suggest to factor the problem into local diagnoses based on the unfoldings of local views of the system, which are then correlated with diagnoses from neighbouring supervisors. In this paper we propose a notion of system factorisation expressed in terms of pullback decomposition. To ensure coherence of the local views and completeness of the diagnosis, data exchange among the unfolders needs to be specified with care. We introduce interleaving structures as a format for data exchange between unfolders and we propose a distributed algorithm for computing local views of the unfolding for each system component. The theory of interleaving structures is developed to prove correctness of the distributed unfolding algorithm.

show abstract

Distributed Unfolding of Petri Nets

Cited by 14 publications

References 16 publications

Diagnosis with Petri Net Unfoldings

Diagnosis with Petri Net Unfoldings

A False History of True Concurrency: From Petri to Tools

Distributed Unfolding of Petri Nets

Contact Info

Product

Resources

About