We study the reachability problem for queue automata and lossy queue automata. Concretely, we consider the set of queue contents which are forwards resp. backwards reachable from a given set of queue contents. Here, we prove the preservation of regularity if the queue automaton loops through some special sets of transformation sequences. This is a generalization of the results by Boigelot et al. and Abdulla et al. regarding queue automata looping through a single sequence of transformations. We also prove that our construction is possible in polynomial time
Abstract. We address the reachability problem in acyclic networks of pushdown systems. We consider c...
AbstractOver the last few years there has been an increasing research effort directed towards the au...
AbstractWe consider past pushdown timed automata that are discrete pushdown timed automata with past...
We study the reachability problem for queue automata and lossy queue automata. Concretely, we consid...
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automat...
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automat...
AbstractWe address the verification problem of FIFO-channel systems. We apply the symbolic analysis ...
We show that reachability, repeated reachability, nontermination and unboundedness are NP-complete f...
AbstractWe look at a model of a queue system that consists of the following components: 1.Two discre...
We revisit a fundamental result in real-time verification, namely that the binary reachability relat...
AbstractWe consider a class of infinite-state Markov decision processes generated by stateless pushd...
AbstractWe describe a general automata-theoretic approach for analyzing the verification problems of...
AbstractReversible pushdown automata are deterministic pushdown automata that are also backward dete...
We consider past pushdown timed automata that are discrete pushdown timed automata with past formula...
Problems in formal verification are often stated in terms of finite automata and extensions thereof....
Abstract. We address the reachability problem in acyclic networks of pushdown systems. We consider c...
AbstractOver the last few years there has been an increasing research effort directed towards the au...
AbstractWe consider past pushdown timed automata that are discrete pushdown timed automata with past...
We study the reachability problem for queue automata and lossy queue automata. Concretely, we consid...
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automat...
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automat...
AbstractWe address the verification problem of FIFO-channel systems. We apply the symbolic analysis ...
We show that reachability, repeated reachability, nontermination and unboundedness are NP-complete f...
AbstractWe look at a model of a queue system that consists of the following components: 1.Two discre...
We revisit a fundamental result in real-time verification, namely that the binary reachability relat...
AbstractWe consider a class of infinite-state Markov decision processes generated by stateless pushd...
AbstractWe describe a general automata-theoretic approach for analyzing the verification problems of...
AbstractReversible pushdown automata are deterministic pushdown automata that are also backward dete...
We consider past pushdown timed automata that are discrete pushdown timed automata with past formula...
Problems in formal verification are often stated in terms of finite automata and extensions thereof....
Abstract. We address the reachability problem in acyclic networks of pushdown systems. We consider c...
AbstractOver the last few years there has been an increasing research effort directed towards the au...
AbstractWe consider past pushdown timed automata that are discrete pushdown timed automata with past...