Abstract
The intention of the paper is first to show the applicability of the general categorical framework of open maps to the setting of true concurrent models with dense time. In particular, we define a category of timed event structures and an accompanying path (sub)category of timed words. Then we use the framework of open maps to obtain an abstract notion of bisimulation which is established to be equivalent to the standard notion of timed bisimulation. Using the fact, we finally show decidability of timed bisimulation in the setting of finite timed structures.
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.
