198 search results - page 13 / 40 » Reachability on prefix-recognizable graphs |
BIRTHDAY
2005
Springer
14 years 3 months ago
2005
Springer
Abstract In this paper, we propose a new loose semantics for place/transition nets based on transition systems and generalizing the reachability graph semantics. The loose semantic...
ISCIS
2004
Springer
14 years 3 months ago
2004
Springer
Partial order methods, such as the stubborn set method and the priority method, reduce verification effort by exploiting irrelevant orders of events. We show how the stubborn set...
CONCUR
2001
Springer
14 years 2 months ago
2001
Springer
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produ...
QEST
2006
IEEE
14 years 3 months ago
2006
IEEE
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
ESEC
1997
Springer
14 years 2 months ago
1997
Springer
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...