Some succinctness properties of Ω-DTAFA

Authors:
A. Fellah;S. Noureddine
Affiliations:
University of Sharjah, Department of Computer Science, Sharjah, United Arab Emirates;University of Lethbridge, Dept. of Math. & Computer Science, Lethbridge, AB, Canada
Venue:
SEPADS'06 Proceedings of the 5th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Year:
2006

Citing 11
Cited 0

A theory of timed automata

Theoretical Computer Science
The tool KRONOS

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Regular languages

Handbook of formal languages, vol. 1
Event-clock automata: a determinizable class of timed automata

Theoretical Computer Science
Alternation

Journal of the ACM (JACM)
Efficient implementation of regular languages using reversed alternating finite automata

Theoretical Computer Science - Special issue on implementing automata
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Weak alternating automata are not that weak

ACM Transactions on Computational Logic (TOCL)
Timed Automata with Asynchronous Processes: Schedulability and Decidability

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Giotto: A Time-Triggered Language for Embedded Programming

EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
A Kleene theorem for timed automata

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The selection of a cost-minimizing combination of hardware and network components that satisfy requirements is a complex design problem with multiple degrees of freedom. Decisions must be made on how to distribute the computing load onto multiple computers ...