Sciweavers

384 search results - page 14 / 77
» On the Semantics of Markov Automata
Sort
View
143
Voted
CONCUR
1999
Springer
15 years 6 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
132
Voted
SCP
2010
172views more  SCP 2010»
15 years 7 days ago
Alternating-time stream logic for multi-agent systems
Constraint automata have been introduced to provide a compositional, operational semantics for the exogenous coordination language Reo, but they can also serve interface specifica...
Sascha Klüppelholz, Christel Baier
NAACL
2003
15 years 3 months ago
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...
Bo Pang, Kevin Knight, Daniel Marcu
ECML
2006
Springer
15 years 5 months ago
PAC-Learning of Markov Models with Hidden State
The standard approach for learning Markov Models with Hidden State uses the Expectation-Maximization framework. While this approach had a significant impact on several practical ap...
Ricard Gavaldà, Philipp W. Keller, Joelle P...
144
Voted
ARTS
1997
Springer
15 years 6 months ago
PLC-Automata: A New Class of Implementable Real-Time Automata
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
Henning Dierks