6 search results - page 1 / 2 » Parityizing Rabin and Streett |
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
103
click to vote
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
BIRTHDAY
2003
Springer
15 years 4 months ago
2003
Springer
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...