493 search results - page 28 / 99 » Alternating Weighted Automata |
STACS
2004
Springer
15 years 8 months ago
2004
Springer
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...
132
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatizatio...
147
click to vote
VMCAI
2010
Springer
15 years 10 months ago
2010
Springer
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
110
click to vote
FOSSACS
2007
Springer
15 years 9 months ago
2007
Springer
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
102
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...