Book ChapterDOI
Reachability Analysis of Pushdown Automata: Application to Model-Checking
Ahmed Bouajjani,Javier Esparza,Oded Maler +2 more
- pp 135-150
Reads0
Chats0
TLDR
This work considers the more general class of alternating pushdown systems and uses alternating finite-state automata as a representation structure for sets of their configurations and gives a simple and natural procedure to compute sets of predecessors using this representation structure.Abstract:
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finite-state automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (such as model-checking for branching-time logics), we consider the more general class of alternating pushdown systems and use alternating finite-state automata as a representation structure for sets of their configurations. We give a simple and natural procedure to compute sets of predecessors using this representation structure. We incorporate this procedure into the automata-theoretic approach to model-checking to define new model-checking algorithms for pushdown systems against both linear and branching-time properties. From these results we derive upper bounds for several model-checking problems as well as matching lower bounds.read more
Citations
More filters
Posted Content
On The Reachability Problem for Recursive Hybrid Automata with One and Two Players.
TL;DR: This study shows that time-bounded reachability problem stays undecidable for recursive timed automata with five or more clocks, and recovers decidability by considering recursive hybrid Automata with bounded context using a pass-by-reference mechanism, or by restricting the number of variables to two with rates in $\{0,1\}$.
Posted Content
Queue-Dispatch Asynchronous Systems
TL;DR: This paper proposes Queue-Dispatch Asynchronous Systems as a mathematical model that faithfully formalizes the synchronization mechanisms and the behavior of the scheduler in those systems and studies in detail their relationships to classical formalisms such as pushdown systems, Petri nets, fifo systems, and counter systems.
Book ChapterDOI
Reachability Problems on Partially Lossy Queue Automata
TL;DR: This work proves the preservation of regularity if the queue automaton loops through some special sets of transformations, which is a generalization of the results by Boigelot et al. regarding queue automata looping through a single sequence of transformations.
Proceedings ArticleDOI
An extensible dialogue script for robot based on unification of state transition models
TL;DR: An extension-by-unification method to improve reusability and flexibility in the incremental development of state-transition models and it is confirmed that the application of SEAT to the development of three robots has significantly improved development efficiency.
Posted Content
On the complexity of cache analysis for different replacement policies
David Monniaux,Valentin Touzeau +1 more
TL;DR: In this article, the authors show that among the common replacement policies, LRU (Least Recently Used) is the only one whose analysis is NP-complete whereas the analysis problems for the other policies are PSPACE-complete.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal ArticleDOI
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Proceedings ArticleDOI
The temporal logic of programs
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
Journal Article
WHO Technical Report.
TL;DR: The Feather River Coordinated Resource Management Group (FR-CRM) has been restoring channel/ meadow/ floodplain systems in the Feather River watershed since 1985 and recognized the possibility of a significant change in carbon stocks in these restored meadows and valleys.
Journal ArticleDOI
Symbolic Boolean manipulation with ordered binary-decision diagrams
TL;DR: The OBDD data structure is described and a number of applications that have been solved by OBDd-based symbolic analysis are surveyed.