Now showing items 1-2 of 2
Using Automata to Characterise Fixed Point Temporal Logics
(University of Edinburgh. College of Science and Engineering. School of Informatics., 1997-07)
This work examines propositional fixed point temporal and modal logics called mu-calculi and their relationship to automata on infinite strings and trees. We use correspondences between formulae and automata to explore ...
Using automata to characterise fixed point temporal logics
(The University of Edinburgh, 1996)