516 search results - page 11 / 104 » Generalizing the Discrete Timed Automaton |
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
RTAS
1999
IEEE
14 years 2 months ago
1999
IEEE
In this paper we propose a dynamic constraint transformation technique for ensuring timing requirements in a distributed real-time system possessing periodically synchronized dist...
IJAR
2002
13 years 9 months ago
2002
The usual methods of applying Bayesian networks to the modeling of temporal processes, such as Dean and Kanazawa's dynamic Bayesian networks (DBNs), consist in discretizing t...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
IANDC
2010
13 years 7 months ago
2010
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...