Sciweavers

147 search results - page 1 / 30
» Unfolding semantics of graph transformation
Sort
View
IANDC
2007
62views more  IANDC 2007»
13 years 9 months ago
Unfolding semantics of graph transformation
Paolo Baldan, Andrea Corradini, Ugo Montanari, Lei...
BIRTHDAY
2008
Springer
13 years 11 months ago
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 ...
Paolo Baldan, Andrea Corradini, Barbara König
CONCUR
2004
Springer
14 years 2 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
GG
2010
Springer
13 years 10 months ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
LOPSTR
1994
Springer
14 years 1 months ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle