14 search results - page 3 / 3 » On Timed Automata with Input-Determined Guards |
CONCUR
2006
Springer
13 years 7 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
WWW
2007
ACM
14 years 6 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 ...
RTAS
2003
IEEE
13 years 10 months ago
2003
IEEE
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
EMSOFT
2005
Springer
13 years 10 months ago
2005
Springer
Hybrid systems are an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. A simple extension, a network of comm...