Sciweavers

278 search results - page 8 / 56
» Semantical Correctness and Completeness of Model Transformat...
Sort
View
BIRTHDAY
2005
Springer
14 years 1 months ago
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl
LOPSTR
2001
Springer
14 years 1 days ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle
ECEASST
2008
69views more  ECEASST 2008»
13 years 7 months ago
Verifying Model Transformations by Structural Correspondence
: Model transformations play a significant role in model based software development, and the correctness of the transformation is crucial to the success of the development effort. ...
Anantha Narayanan, Gabor Karsai
ERSHOV
2006
Springer
13 years 9 months ago
On the Usage of Concrete Syntax in Model Transformation Rules
Graph transformations are one of the best known approaches for defining transformations in model-based software development. They are defined over the abstract syntax of source and...
Thomas Baar, Jon Whittle
GG
2008
Springer
13 years 8 months ago
Graph Transformation for Topology Modelling
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
Mathieu Poudret, Agnès Arnould, Jean-Paul C...