109 search results - page 1 / 22 » Verification of Graph Transformation Systems with Context-Fr... |
92
Voted
GG
2010
Springer
14 years 10 months ago
2010
Springer
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
87
Voted
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
92
Voted
FASE
1998
Springer
15 years 2 months ago
1998
Springer
A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications. The main conceptual t...
RTS
2006
14 years 10 months ago
2006
Component middleware provides dependable and efficient platforms that support key functional, and quality of service (QoS) needs of distributed real-time embedded (DRE) systems. C...
83
Voted
CAV
2008
Springer
15 years 6 days ago
2008
Springer
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...