Sciweavers

30 search results - page 2 / 6
» A Testing Scenario for Probabilistic Automata
Sort
View
COLT
1995
Springer
13 years 9 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
ENTCS
1998
115views more  ENTCS 1998»
13 years 5 months ago
A Testing Equivalence for Reactive Probabilistic Processes
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, extern...
Marta Z. Kwiatkowska, Gethin Norman
ICPR
2010
IEEE
13 years 8 months ago
Recognition and Prediction of Situations in Urban Traffic Scenarios
The recognition and prediction of intersection situations and an accompanying threat assessment are an indispensable skill of future driver assistance systems. This study focuses o...
Eugen Käfer, Christoph Hermes, Christian Wöhler,...
FMCO
2006
Springer
128views Formal Methods» more  FMCO 2006»
13 years 9 months ago
Model-Based Test Selection for Infinite-State Reactive Systems
This paper addresses the problem of off-line selection of test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of re...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu
FSTTCS
2010
Springer
13 years 3 months ago
Average Analysis of Glushkov Automata under a BST-Like Model
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Cyril Nicaud, Carine Pivoteau, Benoît Razet