A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Real-Time Languages, Timed Alternating Automata, and Timed Temporal Logics: Relationships and Specifications
2015
Procedia Computer Science
Time dependent models have become increasingly important in formal modeling and verification of software systems. In this paper, we investigate the expressiveness of real-time iterative arrays and trees in the context of language recognition. Such synchronous parallel models of computation must meet high dependability requirements in performing complex interactions in a real-time environment. Furthermore, we present timed event alternating automata which do not only describe a theoretical model
doi:10.1016/j.procs.2015.08.409
fatcat:j3dkp4nryzg23kjexwn7bdvile