A Calculus for Timed Automata (Extended Abstract)

A language for representing timed automata is introduced. Its semantics i defined in terms of timed automata. This language is complete in the sense that any timed automaton can be represented by a term in the language. We also define a direct operational semantics for the language in terms of (timed) transition systems. This is proven to be equivalent (or, more precisely, timed bisimilar) to the interpretation in terms of timed automata. In addition, a set of axioms is given that is shown to be sound for timed bisimulation. Finally, we introduce several features including the parallel composition and derived time operations like wait, time-out and urgency. We conclude with an example and show that we can eliminate non-reachable states using algebraic techniques

Decibilidad de problemas sobre redes de Petri temporizadas

La tesis investiga cuestiones de decibilidad sobre distintos variantes de redes de Petri temporizados. Se detiene diversas extensiones de las propiedades clásicas de redes de Petri, a los modelos temporizados, se consideran, asimismo distintas hipótesis sobre el tipo de modelo temporal: discreto, racional, real etc.. El trabajo se encuadra en una línea de investigación de acrualidad y los resutados obtenidos son interesantes, numerosos y originale