P.A. Abdulla & B. Jonsson (2003):
Model checking of systems with many identical timed processes.
Theoretical Computer Science 290(1),
pp. 241–264,
doi:10.1016/S0304-3975(01)00330-9.
P.A. Abdulla & R. Mayr (2011):
Computing optimal coverability costs in priced timed Petri nets.
In: Logic in Computer Science (LICS), 2011 26th Annual IEEE Symposium on.
IEEE,
pp. 399–408,
doi:10.1109/LICS.2011.40.
Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson & Yih-Kuen Tsay (1996):
General Decidability Theorems for Infinite-State Systems.
In: LICS,
pp. 313–321,
doi:10.1109/LICS.1996.561359.
R. Alur, S. La Torre & G. J. Pappas (2001):
Optimal Paths in Weighted Timed Automata.
In: HSCC,
pp. 49–62,
doi:10.1007/3-540-45351-2_8.
B. Bérard, F. Cassez, S. Haddad, O. Roux & D. Lime (2005):
Comparison of Different Semantics for Time Petri Nets.
In: Automated Technology for Verification and Analysis,
LNCS 3707.
Springer Berlin Heidelberg,
pp. 293–307,
doi:10.1007/11562948_23.
R. Bonnet (2011):
The reachability problem for Vector Addition Systems with one zero-test.
In: Filip Murlak & Piotr Sankowski: Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11),
LNCS 6907.
Springer,
pp. 145–157,
doi:10.1007/978-3-642-22993-0_16.
P. Bouyer, T. Brihaye, V. Bruyère & J. Raskin (2007):
On the optimal reachability problem of weighted timed automata.
Formal Methods in System Design 31(2),
pp. 135–175,
doi:10.1007/s10703-007-0035-4.
P. Bouyer, F. Cassez, E. Fleury & K. G. Larsen (2005):
Optimal Strategies in Priced Timed Game Automata.
In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science,
Lecture Notes in Computer Science 3328.
Springer Berlin Heidelberg,
pp. 148–160,
doi:10.1007/978-3-540-30538-5_13.
F. D. J. Bowden (1996):
Modelling Time in Petri nets.
In: Proc. Second Australian-Japan Workshop on Stochastic Models.
K.G. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson & J. Romijn (2001):
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata.
In: Proc. 13th Int. Conf. on Computer Aided Verification,
Lecture Notes in Computer Science 2102.
Springer Berlin Heidelberg,
pp. 493–505,
doi:10.1007/3-540-44585-4_47.
J.L. Peterson (1977):
Petri Nets.
Computing Surveys 9(3),
pp. 221–252,
doi:10.1145/356698.356702.
C.A. Petri (1962):
Kommunikation mit Automaten.
University of Bonn.
K. Reinhardt (2008):
Reachability in Petri Nets with Inhibitor Arcs.
Electronic Notes in Theoretical Computuer Science 223,
pp. 239–264,
doi:10.1016/j.entcs.2008.12.042.
V. Valero Ruiz, F. Cuartero Gomez & D. de Frutos Escrig (1999):
On non-decidability of reachability for timed-arc Petri nets.
In: Proceedings of the The 8th International Workshop on Petri Nets and Performance Models,
PNPM '99.
IEEE Computer Society,
pp. 188–196,
doi:10.1109/PNPM.1999.796565.
eptcs@eptcs.org