391 search results - page 36 / 79 » Compositionality for Probabilistic Automata |
148
Voted
CBSE
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...
123
Voted
ATVA
2006
Springer
15 years 6 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
115
click to vote
FSMNLP
2005
Springer
15 years 8 months ago
2005
Springer
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...
ENTCS
2008
15 years 2 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
108
Voted
FOSSACS
2003
Springer
15 years 7 months ago
2003
Springer
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...