Regular Processes and Timed Automata

Pedro R. d' Argenio

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

    4 Downloads (Pure)

    Abstract

    In [7], an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of finite timed automata in terms of that process algebra. We show that regular processes, i.e., processes defined using finitely many guarded recursive equations, are as expressive as finite timed automata. The proof uses only the axiom system and unfolding of recursive equations. Since the proofs are basically algorithms, we also provide an effective method to translate from one model into the other.
    Original languageEnglish
    Title of host publicationTransformation-Based Reactive Systems Development
    Subtitle of host publication4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software, ARTS'97 Palma, Mallorca, Spain, May 21–23, 1997: Proceedings
    EditorsMiquel Bertran, Teodor Rus
    PublisherSpringer
    Pages141-155
    Number of pages15
    ISBN (Electronic)978-3-540-69058-0
    ISBN (Print)978-3-540-63010-4
    DOIs
    Publication statusPublished - 1997
    Event4th AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Software, ARTS 1997 - Palma de Mallorca, Spain
    Duration: 21 May 199723 May 1997
    Conference number: 4

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume1231
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Workshop

    Workshop4th AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Software, ARTS 1997
    Abbreviated titleARTS
    CountrySpain
    CityPalma de Mallorca
    Period21/05/9723/05/97

    Keywords

    • FMT-PA: PROCESS ALGEBRAS
    • FMT-RT: VERIFICATION OF REAL-TIME SYSTEMS
    • Process variable
    • Axiom system
    • Recursive equation
    • Label transition system
    • Process algebra

    Fingerprint Dive into the research topics of 'Regular Processes and Timed Automata'. Together they form a unique fingerprint.

  • Cite this

    d' Argenio, P. R. (1997). Regular Processes and Timed Automata. In M. Bertran, & T. Rus (Eds.), Transformation-Based Reactive Systems Development: 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software, ARTS'97 Palma, Mallorca, Spain, May 21–23, 1997: Proceedings (pp. 141-155). (Lecture Notes in Computer Science; Vol. 1231). Springer. https://doi.org/10.1007/3-540-63010-4_10