The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation

P.R. d' Argenio, B. Gebremichael

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)

    Abstract

    Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon makes bisimulation fail to be a congruence for the parallel composition of timed automata with deadlines, a variant of timed automata where time progress is controlled by deadlines imposed on each transition. This problem has been known and unsolved for several years. In this paper we give a characterization of the coarsest congruence that is included in the bisimulation relation. In addition, a symbolic characterization of such relation is provided and shown to be decidable. We also discuss the pitfalls of existing parallel compositions in this setting and argue that our definition is both reasonable and sufficiently expressive as to consider the modeling of both soft and hard real-time constraints.
    Original languageUndefined
    Title of host publicationProceedings of CONCUR 2005
    EditorsM. Abadi, L. de Alfaro
    Place of PublicationBerlin
    PublisherSpringer
    Pages125-140
    Number of pages16
    ISBN (Print)3-540-28309-9
    DOIs
    Publication statusPublished - 2005
    Event16th International Conference on Concurrency Theory, CONCUR 2005 - San Francisco, United States
    Duration: 23 Aug 200526 Aug 2005
    Conference number: 16

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    Volume3653

    Conference

    Conference16th International Conference on Concurrency Theory, CONCUR 2005
    Abbreviated titleCONCUR
    CountryUnited States
    CitySan Francisco
    Period23/08/0526/08/05

    Keywords

    • EWI-7003
    • IR-63450
    • METIS-248128

    Cite this

    d' Argenio, P. R., & Gebremichael, B. (2005). The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation. In M. Abadi, & L. de Alfaro (Eds.), Proceedings of CONCUR 2005 (pp. 125-140). [10.1007/11539452_13] (Lecture Notes in Computer Science; Vol. 3653). Berlin: Springer. https://doi.org/10.1007/11539452_13