17 search results - page 2 / 4 » Binary Reachability Analysis of Discrete Pushdown Timed Auto... |
IJFCS
2008
13 years 5 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
WIA
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...
FSTTCS
2005
Springer
13 years 11 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
FM
2001
Springer
13 years 10 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
COCOON
2001
Springer
13 years 10 months ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...