Sciweavers

2632 search results - page 9 / 527
» Alternating Timed Automata
Sort
View
COLT
1995
Springer
15 years 8 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
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 12 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
RTSS
2003
IEEE
15 years 10 months ago
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems
We describe the Timed Input/Output Automata (TIOA) framework, a general mathematical framework for modeling and analyzing real-time systems. It is based on timed I/O automata, whi...
Dilsun Kirli Kaynar, Nancy A. Lynch, Roberto Segal...
CONCUR
2009
Springer
15 years 11 months ago
Strict Divergence for Probabilistic Timed Automata
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. In previous work, a probabilistic notion of time divergence for p...
Jeremy Sproston