Augur 2 — A New Version of a Tool for the Analysis of Graph Transformation Systems

König, Barbara; Kozioura, Vitali

doi:10.1016/j.entcs.2008.04.042

Cited by 53 publications

(38 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The method described in the paper has been partially implemented in the tool Augur 2 [16]. Especially, we have implemented the computation of the over-approximating Petri graph and the computation of the semi-linear set from a context-free grammar.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Verification of Graph Transformation Systems with Context-Free Specifications

König

Esparza

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract.We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are specified by a contextfree graph grammar. The technique is based on the approximation of graph transformation systems by Petri nets and on semilinear sets of markings. Especially we exploit Parikh's theorem which says that the Parikh image of a context-free grammar is semilinear. An important application is deadlock analysis for interaction nets and we specifically show how to apply the technique to an infinite-state dining philosopher's system.

show abstract

Section: Resultsmentioning

confidence: 99%

“…With the approximated unfolding technique sketched above we obtain the Petri graph in Figure 3. It has been computed automatically using the tool Augur 2 [16]. Note that edges of the graph and places of the net coincide and that arcs between places and transitions are drawn with dashed lines.…”

Section: Then There Exists a Marking M Obtained From M By Firing A mentioning

confidence: 99%

Verification of Graph Transformation Systems with Context-Free Specifications

König

Esparza

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, a prototype tool called Augur [21] has been implemented for computing the kcovering of a given graph transformation system. The current implementation is restricted to rules with discrete contexts.…”

Section: Discussionmentioning

confidence: 99%

Unfolding Graph Transformation Systems: Theory and Applications to Verification

Baldan

Corradini

König

2008

Concurrency, Graphs and Models

Self Cite

View full text Add to dashboard Cite

Abstract. The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial order verification techniques. In this paper we survey the contributions we elaborated in the last decade with Ugo Montanari and other colleagues, concerning the unfolding of graph transformation systems, and its use in the definition of a Winskel style functorial semantics and in the development of methodologies for the verification of finite and infinite state systems.

show abstract

“…Initially developed for systems modeled as "plain" Petri nets, the unfolding approach has been extended to high-level Petri nets [37,55] [3,2]. It has been implemented many times [55,56,33,42,50,29,31,20] and applied, among other problems, to conformance checking [48], analysis and synthesis of asynchronous circuits [39,41,40], monitoring and diagnose of discrete event systems [7,6,13,27], and analysis of asynchronous communication protocols [44]. Two unfolders available online are Mole and PUNF, developed and maintained by Stefan Schwoon and Victor Khomenko, respectively [57,34].…”

mentioning

confidence: 99%

“…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]. It has been implemented many times [55,56,33,42,50,29,31,20] and applied, among other problems, to conformance checking [48], analysis and synthesis of asynchronous circuits [39,41,40], monitoring and diagnose of discrete event systems [7,6,13,27], and analysis of asynchronous communication protocols [44]. Two unfolders available online are Mole and PUNF, developed and maintained by Stefan Schwoon and Victor Khomenko, respectively [57,34].…”

mentioning

confidence: 99%

A False History of True Concurrency: From Petri to Tools

Esparza

2010

Lecture Notes in Computer Science

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 nonsequen...

show abstract

Augur 2 — A New Version of a Tool for the Analysis of Graph Transformation Systems

Cited by 53 publications

References 14 publications

Verification of Graph Transformation Systems with Context-Free Specifications

Verification of Graph Transformation Systems with Context-Free Specifications

Unfolding Graph Transformation Systems: Theory and Applications to Verification

A False History of True Concurrency: From Petri to Tools

Contact Info

Product

Resources

About