665 search results - page 53 / 133 » The Theory of Hybrid Automata |
TCS
2002
13 years 7 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
DLT
2009
13 years 5 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
JCSC
1998
13 years 7 months ago
1998
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
SEFM
2006
IEEE
14 years 1 months ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
FUIN
2008
13 years 7 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...