Regular Processes and Timed Automata


Share/Save/Bookmark

D'Argenio, P.R. (1997) Regular Processes and Timed Automata. In: Proceedings of the 4th AMAST Workshop on Real-TimeSystems, Concurrent, and Distributed Software, ARTS'97, Mallorca, Spain.

[img]PDF
Restricted to UT campus only
: Request a copy
254Kb
Abstract:In [10], an algebra for timed automata has been introduced. In this article,
we introduce a syntactic characterisation of nite timed automata in terms of
that process algebra. We show that regular processes, i.e., processes dened
using nitely many guarded recursive equations, are as expressive as nite timed
automata. The proof uses only the axiom system and unfolding of recursive
equations. Since the proofs are basically algorithms, we also provide an eective
method to translate from one model into the other. A remarkable corollary of
these proofs is that regular recursive specications may need one clock less than
timed automata in order to represent the same process.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/63288
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page