Sciweavers

1246 search results - page 17 / 250
» Recursive Timed Automata
Sort
View
UMC
2000
15 years 4 months ago
Upper and Lower Bounds on Continuous-Time Computation
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
Manuel Lameiras Campagnolo, Cristopher Moore
93
Voted
CORR
2006
Springer
99views Education» more  CORR 2006»
15 years 21 days ago
Rational stochastic languages
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
François Denis, Yann Esposito
112
Voted
IANDC
2008
87views more  IANDC 2008»
15 years 22 days ago
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
IPL
2007
125views more  IPL 2007»
15 years 17 days ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
FUIN
2008
108views more  FUIN 2008»
15 years 22 days ago
Radial View of Continuous Cellular Automata
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function...
Paola Flocchini, Vladimir Cezar