Regular Processes and Timed Automata

Pedro R. d' Argenio

doi:10.1007/3-540-63010-4_10

Regular Processes and Timed Automata

Pedro R. d' Argenio

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

11 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 language	English
Title of host publication	Transformation-Based Reactive Systems Development
Subtitle of host publication	4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software, ARTS'97 Palma, Mallorca, Spain, May 21–23, 1997: Proceedings
Editors	Miquel Bertran, Teodor Rus
Publisher	Springer
Pages	141-155
Number of pages	15
ISBN (Electronic)	978-3-540-69058-0
ISBN (Print)	978-3-540-63010-4
DOIs	https://doi.org/10.1007/3-540-63010-4_10
Publication status	Published - 1997
Event	4th AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Software, ARTS 1997 - Palma de Mallorca, Spain Duration: 21 May 1997 → 23 May 1997 Conference number: 4

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	1231
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Workshop

Workshop	4th AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Software, ARTS 1997
Abbreviated title	ARTS
Country/Territory	Spain
City	Palma de Mallorca
Period	21/05/97 → 23/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

Access to Document

10.1007/3-540-63010-4_10

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

d' Argenio, Pedro R. / Regular Processes and Timed Automata. 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. editor / Miquel Bertran ; Teodor Rus. Springer, 1997. pp. 141-155 (Lecture Notes in Computer Science).

@inproceedings{b54a2276fd684bb4ba679b89c2f2ea0a,

title = "Regular Processes and Timed Automata",

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.",

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

author = "\{d' Argenio\}, \{Pedro R.\}",

year = "1997",

doi = "10.1007/3-540-63010-4\_10",

language = "English",

isbn = "978-3-540-63010-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "141--155",

editor = "Miquel Bertran and Teodor Rus",

booktitle = "Transformation-Based Reactive Systems Development",

address = "Germany",

note = "4th AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Software, ARTS 1997, ARTS ; Conference date: 21-05-1997 Through 23-05-1997",

}

d' Argenio, PR 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. Lecture Notes in Computer Science, vol. 1231, Springer, pp. 141-155, 4th AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Software, ARTS 1997, Palma de Mallorca, Spain, 21/05/97. https://doi.org/10.1007/3-540-63010-4_10

Regular Processes and Timed Automata. / d' Argenio, Pedro R.
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. ed. / Miquel Bertran; Teodor Rus. Springer, 1997. p. 141-155 (Lecture Notes in Computer Science; Vol. 1231).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Regular Processes and Timed Automata

AU - d' Argenio, Pedro R.

N1 - Conference code: 4

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

KW - FMT-PA: PROCESS ALGEBRAS

KW - FMT-RT: VERIFICATION OF REAL-TIME SYSTEMS

KW - Process variable

KW - Axiom system

KW - Recursive equation

KW - Label transition system

KW - Process algebra

U2 - 10.1007/3-540-63010-4_10

DO - 10.1007/3-540-63010-4_10

M3 - Conference contribution

SN - 978-3-540-63010-4

T3 - Lecture Notes in Computer Science

SP - 141

EP - 155

BT - Transformation-Based Reactive Systems Development

A2 - Bertran, Miquel

A2 - Rus, Teodor

PB - Springer

T2 - 4th AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Software, ARTS 1997

Y2 - 21 May 1997 through 23 May 1997

ER -

d' Argenio PR. Regular Processes and Timed Automata. In Bertran M, Rus T, editors, 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. Springer. 1997. p. 141-155. (Lecture Notes in Computer Science). doi: 10.1007/3-540-63010-4_10

Regular Processes and Timed Automata

Abstract

Publication series

Workshop

Keywords

Access to Document

Fingerprint

Cite this