OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, login, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Bornot, S.; Sifakis, J.; Tripakis, S. (1998)
Languages: English
Types: 0038
Subjects: automata theory, formal specification, Petri nets
We define timed automata with deadlines (TAD) which are a class of timed automata where time progress conditions depend on deadlines associated with transitions. We show that using TAD makes urgency specification easier. We present the model of Petri nets with deadlines (PND), which are (1-safe) Petri nets extended with clocks exactly as TAD are extensions of automata. We compare PND with different classes of timed Petri nets (TPNs) and show that safe TPNs can be modeled as PND. Some applications to modeling systems and in particular to modeling multimedia documents are presented
  • No references.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article

Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok