Sciweavers

503 search results - page 9 / 101
» Probabilistic Weighted Automata
Sort
View
IPL
2006
91views more  IPL 2006»
13 years 8 months ago
Improved undecidability results on weighted timed automata
In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we prop...
Patricia Bouyer, Thomas Brihaye, Nicolas Markey
FORMATS
2004
Springer
14 years 2 months ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
IFM
2007
Springer
104views Formal Methods» more  IFM 2007»
14 years 2 months ago
Probabilistic Timed Behavior Trees
The Behavior Tree notation has been developed as a method for systematically and traceably capturing user requirements. In this paper we extend the notation with probabilistic beha...
Robert Colvin, Lars Grunske, Kirsten Winter
FSMNLP
2008
Springer
13 years 10 months ago
Learning with Weighted Transducers
Weighted finite-state transducers have been used successfully in a variety of natural language processing applications, including speech recognition, speech synthesis, and machine ...
Corinna Cortes, Mehryar Mohri
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 8 months ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...