198 search results - page 25 / 40 » Reachability on prefix-recognizable graphs |
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...
ATVA
2009
Springer
14 years 4 months ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
ATVA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
CONEXT
2007
ACM
14 years 1 months ago
2007
ACM
Internet interdomain routing is policy-driven, and thus physical connectivity does not imply reachability. On average, routing on today's Internet works quite well, ensuring ...
TSMC
2010
13 years 4 months ago
2010
Business Process Execution Language for Web Services (BPEL) is becoming the industrial standard for modeling web service-based business processes. Behavioral compatibility for web ...