Using automata to characterise fixed point temporal logics
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 definability in mu-calculi and their fragments, to provide normal forms for formu...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Edinburgh
1996
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.561688 |