Forgetting the Time in Timed Process Algebra - Timeless Behaviour in a Timestamped World

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

    1 Citation (Scopus)

    Abstract

    In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility to abstract away parts of the timing of system behaviour. Adding this notion leads to so-called partially timed process algebras and partially timed labelled transition systems. We describe these notions, and generalise timed branching bisimilarity to partially timed branching bisimilarity, allowing the comparison of systems with partial timing. Finally, with several examples and a case study, we demonstrate how partial time abstraction can be a useful modelling technique for timed models, which can lead to rigorous minimisations of state spaces.
    Original languageEnglish
    Title of host publicationProceedings of the 30th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'10), 7-9 June 2010, Amsterdam, The Netherlands
    Place of PublicationNetherlands, Amsterdam
    Pages110-124
    DOIs
    Publication statusPublished - 2010

    Fingerprint

    Dive into the research topics of 'Forgetting the Time in Timed Process Algebra - Timeless Behaviour in a Timestamped World'. Together they form a unique fingerprint.

    Cite this