Compositional specification of timed systems

We present timed automata and timed Petri nets and argue that timed automata and their associated parallel composition operator are not well adapted for the compositional description of timed Petri nets. Timed automata with deadlines are presented. We present a compositional translation method from 1-safe timed Petri nets to this model. We also present basic ideas for a general compositional specification framework


Published in:
STACS 96. 13th Annual Symposium on Theoretical Aspects of Computer Science. Proceedings, 347 - 59
Presented at:
STACS 96. 13th Annual Symposium on Theoretical Aspects of Computer Science. Proceedings, Berlin, Germany
Year:
1996
Keywords:
Laboratories:




 Record created 2013-03-14, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)