TY  - CHAP
AU  - Frutos Escrig, David De
AU  - Valero Ruiz, Valentín
AU  - Marroquín Alonso, Olga
A4  - Nielsen, Mogens
A4  - Simpson, Dan
PY  - 2000
DO  - 10.1007/3-540-44988-4_12
SN  - 978-3-540-67693-5
UR  - https://hdl.handle.net/20.500.14352/60658
AB  - Timed-arc Petri nets (TAPN’s) are not Turing powerful, because, in particular, they cannot simulate a counter with zero testing. Thus, we could think that this model does not increase significantly the expressiveness of untimed Petri nets. But this is...
LA  - eng
M2  - 187
PB  - Springer
KW  - Models and methods for concurrent and distributed computing (process algebras
KW  - Bisimulation
KW  - Transition nets
KW  - Decidability of theories and sets of sentences
TI  - Decidability of properties of timed-arc Petri nets
TY  - book part
ER  -