On checking timed automata for linear duration invariants
In this work, we address the problem of verifying a Timed Automaton for a real-time property written in Duration Calculus in the form of Linear Duration Invariants. We present a conservative method for solving the problem using the linear programming techniques. First, we provide a procedure to tran...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Acta de conferencia Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
IEEE
1998
|
| Materias: | |
| Acceso en línea: | Registro en Scopus Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 02465caa a22003857a 4500 | ||
|---|---|---|---|
| 001 | PAPER-2738 | ||
| 003 | AR-BaUEN | ||
| 005 | 20230518203212.0 | ||
| 008 | 190411s1998 xx ||||fo|||| 10| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-0032299325 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 030 | |a PRSYE | ||
| 100 | 1 | |a Braberman, Victor Adrian | |
| 245 | 1 | 3 | |a On checking timed automata for linear duration invariants |
| 260 | |b IEEE |c 1998 | ||
| 270 | 1 | 0 | |m Braberman, Victor Adrian; FCEyN-UBAArgentinaA4 - IEEE |
| 506 | |2 openaire |e Política editorial | ||
| 520 | 3 | |a In this work, we address the problem of verifying a Timed Automaton for a real-time property written in Duration Calculus in the form of Linear Duration Invariants. We present a conservative method for solving the problem using the linear programming techniques. First, we provide a procedure to translate Timed Automata into a sort of regular expressions for timed languages. Then, we extend the linear programming-based approaches in [10] to this algebraic notation for the timed automata. Our results in this paper are more general than the ones presented in [10]. Namely, Timed Automata are our starting point, and we can provide an accurate answer to the problem for a larger class of them. |l eng | |
| 593 | |a FCEyN-UBA, Argentina | ||
| 650 | 1 | 7 | |2 spines |a ALGEBRA |
| 690 | 1 | 0 | |a LINEAR PROGRAMMING |
| 690 | 1 | 0 | |a REAL TIME SYSTEMS |
| 690 | 1 | 0 | |a DURATION CALCULUS |
| 690 | 1 | 0 | |a LINEAR DURATION INVARIANTS |
| 690 | 1 | 0 | |a TIMED AUTOMATA |
| 690 | 1 | 0 | |a AUTOMATA THEORY |
| 700 | 1 | |a Van Hung, Dang | |
| 711 | 2 | |c Piscataway, NJ, United States |d 2 December 1998 through 4 December 1998 |g Código de la conferencia: 49497 | |
| 773 | 0 | |d IEEE, 1998 |h pp. 264-273 |p Proc Real Time Syst Symp |n Proceedings - Real-Time Systems Symposium |t Proceedings of the 1998 19th IEEE Real-Time Systems Symposium | |
| 856 | 4 | 1 | |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-0032299325&partnerID=40&md5=010808a7ee179f8a99d5efa17d20e238 |y Registro en Scopus |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_NIS02738_v_n_p264_Braberman |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_NIS02738_v_n_p264_Braberman |y Registro en la Biblioteca Digital |
| 961 | |a paper_NIS02738_v_n_p264_Braberman |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/conferenceObject |a info:ar-repo/semantics/documento de conferencia |b info:eu-repo/semantics/publishedVersion | ||
| 999 | |c 63691 | ||