Abstract
We propose meaning-preserving translations between L B , L U and L sb (three modal logics in full agreement with branching bisimulation), thus proving that they all have the same expressivity. The translations can be implemented and have potential applications in the automated analysis of reactive systems. In this work the main difficulty is that L B uses both forward and backward modalities, whereas L U and L sb only have forward modalities. The technique we developed to cope with this, is an adaptation in a branching-time framework of the methods underlying Gabbay's separation theorem for PTL (Gabbay, 1987). This technique is powerful and has been applied successfully to related problems.
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.
