Unfolding Graph Transformation Systems: Theory and Applications to Verification

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.

[1]  B. König,et al.  Verifying Finite-State Graph Grammars: An Unfolding-Based Approach , 2004, CONCUR.

[2]  Ugo Montanari,et al.  Contextual Petri Nets, Asymmetric Event Structures, and Processes , 2001, Inf. Comput..

[3]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[4]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[5]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[6]  Javier Esparza.  Model Checking Using Net Unfoldings , 1994, Sci. Comput. Program..

[7]  Paolo Baldan,et al.  A Logic for Analyzing Abstractions of Graph Transformation Systems , 2003, SAS.

[8]  G. Michele Pinna,et al.  On the Nature of Events: Another Perspective in Concurrency , 1995, Theor. Comput. Sci..

[9]  Paolo Baldan,et al.  Approximating the Behaviour of Graph Transformation Systems , 2002, ICGT.

[10]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[11]  Andrea Corradini,et al.  Processes for Adhesive Rewriting Systems , 2006, FoSSaCS.

[12]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[13]  Ugo Montanari,et al.  Unfolding and Event Structure Semantics for Graph Grammars , 1999, FoSSaCS.

[14]  José Meseguer,et al.  On the Semantics of Petri Nets , 1992, CONCUR.

[15]  Ugo Montanari,et al.  Unfolding semantics of graph transformation , 2007, Inf. Comput..

[16]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[17]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[18]  Barbara König,et al.  Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems , 2008, GT-VMT@ETAPS.

[19]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[20]  Andrea Corradini,et al.  Verifying Red-Black Trees , 2005 .

[21]  Andrea Corradini,et al.  McMillan's Complete Prefix for Contextual Nets , 2008, Trans. Petri Nets Other Model. Concurr..

[22]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[23]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[24]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach , 1997, Handbook of Graph Grammars.

[25]  Francesca Rossi,et al.  Graph Processes , 1996, Fundam. Informaticae.

[26]  Alexandre Yakovlev,et al.  Unfolding and Finite Prefix for Nets with Read Arcs , 1998, CONCUR.

[27]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[28]  Hsu-Chun Yen,et al.  A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets , 1991, Theor. Comput. Sci..

[29]  Pawel Sobocinski,et al.  Adhesive Categories , 2004, FoSSaCS.

[30]  Christel Baier,et al.  CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings , 2006, CONCUR.

[31]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[32]  Wolfgang Reisig,et al.  The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..

[33]  Leila Ribeiro,et al.  Parallel composition and unfolding semantics of graph grammars , 1996 .

[34]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[35]  Andrea Corradini,et al.  A Static Analysis Technique for Graph Transformation Systems , 2001, CONCUR.

[36]  Roberto Bruni,et al.  Event Structure Semantics for Nominal Calculi , 2006, CONCUR.

[37]  Paolo Baldan,et al.  Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars , 2000 .

[38]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[39]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..