1246 search results - page 2 / 250 » Recursive Timed Automata |
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
FUIN
2008
13 years 4 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
CIE
2007
Springer
13 years 8 months ago
2007
Springer
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
IDEAS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...