Sciweavers

CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 4 months ago
Finitary languages
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
Krishnendu Chatterjee, Nathanaël Fijalkow
CAV
2003
Springer
166views Hardware» more  CAV 2003»
14 years 2 months ago
Bridging the Gap between Fair Simulation and Trace Inclusion
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
Yonit Kesten, Nir Piterman, Amir Pnueli