Abstract
A mu-calculus over dependence graph representation of traces<br />is considered. It is shown that the mu-calculus cannot express all<br />monadic second order (MSO) properties of dependence graphs.<br />Several extensions of the mu-calculus are presented and it is proved<br />that these extensions are equivalent in expressive power to MSO<br />logic. The satisfiability problem for these extensions is PSPACE<br />complete.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
