On checking timed automata for linear duration invariants

Mostrar todas las versiones(2)

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Braberman, Victor Adrian, Van Hung, Dang
Formato: CONF
Materias:
Algebra
Linear programming
Real time systems
Duration calculus
Linear duration invariants
Timed automata
Automata theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_NIS02738_v_n_p264_Braberman
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares