Sciweavers

2 search results - page 1 / 1
» Finding Shortest Witnesses to the Nonemptiness of Automata o...
Sort
View
67
Voted
CONCUR
2006
Springer
15 years 2 months ago
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
Orna Kupferman, Sarai Sheinvald-Faragy
ENTCS
2006
125views more  ENTCS 2006»
14 years 10 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere