A New Method for Transforming Timed Automata | Zendy

Ahmed Khoumsi | Zendy; Lucien Ouédraogo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A New Method for Transforming Timed Automata

Author(s) -

Ahmed Khoumsi,

Lucien Ouédraogo

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.03.007

Subject(s) - automaton , computer science , timed automaton , transformation (genetics) , theoretical computer science , conformance testing , finite state machine , state (computer science) , model checking , algorithm , programming language , operating system , biochemistry , chemistry , standardization , gene

Discrete events systems (DES) are defined by the sequences of events they can execute. For example, communication protocols and computer networks can be seen as DES. Finite state automata (FSA) are convenient for studying (i.e., analyzing, designing) DES, and timed automata (TA) are convenient for describing real-time DES. An approach for studying a real-time DES, has been to transform a TA describing the real-time DES into an equivalent FSA, and then to study the latter. We propose here a new transformation method of TA into FSA. The method is well suited for conformance testing and supervisory control of real-time DES

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research