Sciweavers

139 search results - page 2 / 28
» Model Checking Graph Transformations: A Comparison of Two Ap...
Sort
View
CONCUR
2004
Springer
13 years 10 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
ENTCS
2006
172views more  ENTCS 2006»
13 years 5 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
CIIA
2009
13 years 6 months ago
LCF-style for Secure Verification Platform based on Multiway Decision Graphs
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
Sa'ed Abed, Otmane Aït Mohamed
SMI
2010
IEEE
165views Image Analysis» more  SMI 2010»
13 years 3 months ago
Designing a Topological Modeler Kernel: A Rule-Based Approach
In this article, we present a rule-based language dedicated to topological operations, based on graph transformations. Generalized maps are described as a particular class of graph...
Thomas Bellet, Mathieu Poudret, Agnès Arnou...
MODELS
2010
Springer
13 years 3 months ago
Transforming Process Models: Executable Rewrite Rules versus a Formalized Java Program
Abstract. In the business process management community, transformations for process models are usually programmed using imperative languages (such as Java). The underlying mapping ...
Pieter Van Gorp, Rik Eshuis