Sciweavers

1246 search results - page 12 / 250
» Recursive Timed Automata
Sort
View
89
Voted
ACTA
2004
87views more  ACTA 2004»
15 years 17 days ago
P systems with symport/antiport simulating counter automata
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...
Pierluigi Frisco, Hendrik Jan Hoogeboom
96
Voted
JACM
2002
142views more  JACM 2002»
15 years 11 days ago
Timed regular expressions
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
Eugene Asarin, Paul Caspi, Oded Maler
100
Voted
FSMNLP
2005
Springer
15 years 6 months ago
Parsing with Lexicalized Probabilistic Recursive Transition Networks
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
Alexis Nasr, Owen Rambow
126
Voted
TAMC
2009
Springer
15 years 7 months ago
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
Jasper Berendsen, Taolue Chen, David N. Jansen
71
Voted
FORMATS
2007
Springer
15 years 6 months ago
Counter-Free Input-Determined Timed Automata
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
Fabrice Chevalier, Deepak D'Souza, Pavithra Prabha...