We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
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 ...
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
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 ...