共 2 条
[1]
Interrupt Timed Automata: verification and expressiveness.[J] Béatrice Bérard;Serge Haddad;Mathieu Sassolas Formal Methods in System Design 2012,
[2]
Task automata: Schedulability; decidability and undecidability[J] Elena Fersman;Pavel Krcal;Paul Pettersson;Wang Yi Information and Computation 2007,

