423 search results - page 43 / 85 » The Generalization of Generalized Automata: Expression Autom... |
144
click to vote
ACSD
2007
IEEE
15 years 6 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
176
click to vote
KBSE
2003
IEEE
15 years 9 months ago
2003
IEEE
Physics-based animation programs can often be modeled in terms of hybrid automata. A hybrid automaton includes both discrete and continuous dynamical variables. The discrete varia...
130
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents ...
154
click to vote
IEEESCC
2005
IEEE
15 years 9 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
141
click to vote
MCU
2004
15 years 5 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...