1940 search results - page 55 / 388 » Graph Transformation with Variables |
119
Voted
ECEASST
2010
14 years 12 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
76
Voted
ECEASST
2010
14 years 12 months ago
2010
115
Voted
ECEASST
2010
14 years 12 months ago
2010
135
Voted
INFORMATICALT
2000
15 years 2 months ago
2000
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
117
click to vote
CONCUR
2004
Springer
15 years 8 months ago
2004
Springer
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 ...