16 search results - page 4 / 4 » A Labeled Natural Deduction System for a Fragment of CTL* |
LATA
2010
Springer
13 years 11 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...