Unfolding Graph Transformation Systems: Theory and Applications to Verification

Authors:
Paolo Baldan;Andrea Corradini;Barbara König
Affiliations:
Dipartimento di Matematica Pura e Applicata, Università di Padova, Italy;Dipartimento di Informatica, Università di Pisa, Italy;Abt. für Informatik und Ang. Kognitionswissenschaft, Universität Duisburg-Essen, Germany
Venue:
Concurrency, Graphs and Models
Year:
2008

Citing 23
Cited 0

Petri nets: an introduction

Petri nets: an introduction
Event structures

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
A taxonomy of fairness and temporal logic problems for Petri nets

Theoretical Computer Science
On the nature of events: another perspective in concurrency

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Model checking using net unfoldings

TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Property preserving abstractions for the verification of concurrent systems

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Graph processes

Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Algebraic approaches to graph transformation. Part II: single pushout approach and comparison with double pushout approach

Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution

Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Contextual Petri nets, asymmetric event structures, and processes

Information and Computation
Symbolic Model Checking

Symbolic Model Checking
An Improvement of McMillan's Unfolding Algorithm

Formal Methods in System Design
Unfolding and Finite Prefix for Nets with Read Arcs

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
A Static Analysis Technique for Graph Transformation Systems

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
On the Semantics of Petri Nets

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Unfolding and Event Structure Semantics for Graph Grammars

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Approximating the Behaviour of Graph Transformation Systems

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Unfolding semantics of graph transformation

Information and Computation
Augur 2 --- A New Version of a Tool for the Analysis of Graph Transformation Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
A logic for analyzing abstractions of graph transformation systems

SAS'03 Proceedings of the 10th international conference on Static analysis
Processes for adhesive rewriting systems

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Event structure semantics for nominal calculi

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

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.