147 search results - page 3 / 30 » Unfolding semantics of graph transformation |
PPDP
2007
Springer
14 years 3 months ago
2007
Springer
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
ATVA
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets ex...
ISCAPDCS
2003
13 years 11 months ago
2003
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
APN
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
CONCUR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...