Transformations of Timed Cooperating Automata

Authors:
Ruggero Lanotte;Andrea Maggiolo-Schettini;Simone Tini;Adriano Peron
Affiliations:
Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy;Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy;Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy;Dipartimento di Matematica e Informatica, Università di Udine, Viale delle Scienze 206, 33100 Udine, Italy
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Year:
2001

Citing 8
Cited 1

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
On the power of bounded concurrency I: finite automata

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

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

Fundamenta Informaticae
Timed automata with periodic clock constraints

Journal of Automata, Languages and Combinatorics
Retiming Techniques for Statecharts

FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Optimizing synchronous systems

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Timed Cooperating Automata

Fundamenta Informaticae

Concurrency in timed automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper pursues the investigation of Timed Cooperating Automata (TCAs) by studying transformations which are suggested as means for stepwise TCA construction.