Timed Automata with Monotonic Activities

Authors:
Ruggero Lanotte;Andrea Maggiolo-Schettini
Affiliations:
-;-
Venue:
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Year:
2000

Citing 7
Cited 1

On the power of bounded concurrency I: finite automata

Journal of the ACM (JACM)
A theory of timed automata

Theoretical Computer Science
The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
Event-clock automata: a determinizable class of timed automata

Theoretical Computer Science
Timed cooperating automata

Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
What Good Are Digital Clocks?

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Expressive Power of Clocks

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming

Monotonic hybrid systems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper introduces TAMA (Timed Automata with Monotonic Activities) a subclass of hybrid automata including as proper subclass TA (Timed Automata), Multirate Automata and Integrator Automata. A subclass of TAMA, called TAMAo, is studied and shown to be equivalent to Timed Automata under the assumption of discrete time, while in dense time TAMAo contains properly the subclasses of hybrid systems mentioned. We also show that TAMAo allow more succinct descriptions than TA.