Handbook of theoretical computer science (vol. B)
On the power of bounded concurrency I: finite automata
Journal of the ACM (JACM)
Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
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
Hi-index | 0.00 |
The paper pursues the investigation of Timed Cooperating Automata (TCAs) by studying transformations which are suggested as means for stepwise TCA construction.