Sciweavers

61
Voted
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
15 years 2 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri