Action transducers and timed automata
- 1 September 1996
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 8 (5) , 499-538
- https://doi.org/10.1007/bf01211907
Abstract
The timed automaton model of [LyV92, LyV93] is a general model for timing-based systems. A notion of timed action transducer is here defined as an automata-theoretic way of representing operations on timed automata. It is shown that two timed trace inclusion relations are substitutive with respect to operations that can be described by timed action transducers. Examples are given of operations that can be described in this way, and a preliminary proposal is given for an appropriate language of operators for describing timing-based systems.Keywords
This publication has 36 references indexed in Scilit:
- Compositionality through an operational semantics of contextsPublished by Springer Nature ,2005
- A theory of timed automataPublished by Elsevier ,2002
- How to write a long formulaFormal Aspects of Computing, 1994
- Process Algebra with Iteration and NestingThe Computer Journal, 1994
- From ATP to timed graphs and hybrid systemsActa Informatica, 1993
- Forward and backward simulations for timing-based systemsPublished by Springer Nature ,1992
- Abstraction in real time process algebraPublished by Springer Nature ,1992
- An old-fashioned recipe for real timePublished by Springer Nature ,1992
- Real time process algebraFormal Aspects of Computing, 1991
- CIRCAL and the representation of communication, concurrency, and timeACM Transactions on Programming Languages and Systems, 1985