Timed Cooperating Automata

Authors:
Ruggero Lanotte;Andrea Maggiolo-Schettini;Adriano Peron
Affiliations:
Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy. E_mail: lanotte@di.unipi.it E_mail: maggiolo@di.unipi.it;(Correspd.) Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy. E_mail: lanotte@di.unipi.it E_mail: maggiolo@di.unipi.it;(Correspd.) Dipartimento di Matematica e Informatica, Università, di Udine, Via delle Scienze 206, 33100 Udine, Italy. E_mail: peron@dimi.uniud.it
Venue:
Fundamenta Informaticae
Year:
2000

Citing 11
Cited 3

Statecharts: A visual formalism for complex systems

Science of Computer Programming
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
The ESTEREL synchronous programming language: design, semantics, implementation

Science of Computer Programming
On the power of bounded concurrency I: finite automata

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

Theoretical Computer Science
Event-clock automata: a determinizable class of timed automata

Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata

Fundamenta Informaticae
Transitions as Interrupts: A New Semantics for Timed Statecharts

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Hierarchical Automata as Model for Statecharts

ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
Retiming Techniques for Statecharts

FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Product Interval Automata: A Subclass of Timed Automata

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science

Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae
Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae
Transformations of Timed Cooperating Automata

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose Timed Cooperating Automata (TCAs), an extension of the model Cooperating Automata of Harel and Drusinsky, and we investigate some basic properties. In particular we consider variants of TCAs based on the presence or absence of internal activity, urgency and reactivity, and we compare the expressiveness of these variants with that of the classical model of Timed Automata (TAs) and its extensions with periodic clock constraints and with silent moves. We consider also closure and decidability properties of TCAs and start a study on succinctness of their variants with respect to that of TAs.