Abstract
In this paper we present durational actions timed automata, DATA*, as a sub class of timed automata. In the contrast of T.A, the underling semantic of DATA* is the maximality semantics which claim that actions have durations and true concurrency is captured differently from choice. DATA* model is in one hand useful for modeling and validating reel aspects of systems. In the other hand, it is determinizable and closed under all Boolean operations. As result, the language inclusion problem is decidable. Then, we compare a durational actions timed automata to event recording automata, which is a determinizable sub class of the classical timed automata. Next, we propose a simple framework to aggregate region of DATA* for reducing its space state. This study is based on an aggregation region automata procedure to reduce the combinatorial explosion of regions. Finally, we discuss equivalence and validation of systems. General Terms Real time systems, Formal models, Characterization of models.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied Information Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
