524 search results - page 16 / 105 » Temporal reachability graphs |
AC
2003
Springer
14 years 3 months ago
2003
Springer
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
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...
COMCOM
1998
13 years 9 months ago
1998
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
ENTCS
2006
13 years 9 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...