P.A. Abdulla & A. Nylén (2001):
Timed Petri Nets and BQOs.
In: Proceedings of the 22nd International Conference on Application and Theory of Petri Nets (ICATPN'01),
LNCS 2075.
Springer-Verlag,
pp. 53–70,
doi:10.1007/3-540-45740-2_5.
R. Alur & D. Dill (1994):
A Theory of Timed Automata.
Theoretical Computer Science (TCS) 126(2),
pp. 183–235,
doi:10.1016/0304-3975(94)90010-8.
E. Asarin, M. Bozga, A. Kerbrat, O. Maler, A. Pnueli & A. Rasse (1997):
Data-Structures for the Verification of Timed Automata.
In: Oded Maler: HART,
LNCS 1201.
Springer,
pp. 346–360,
doi:10.1007/BFb0014737.
G. Behrmann, A. David & K.G. Larsen (2004):
A Tutorial on Uppaal.
In: Formal Methods for the Design of Real-Time Systems: 4th International School on Formal Methods for the Design of Computer, Communication, and Software Systems (SFM-RT'04),
LNCS 3185.
Springer-Verlag,
pp. 200–236,
doi:10.1007/978-3-540-30080-9_7.
B. Berthomieu & M. Menasche (1983):
An Enumerative Approach for Analyzing Time Petri Nets.
In: IFIP Congress,
pp. 41–46.
D. Beyer, C. Lewerentz & A. Noack (2003):
Rabbit: A Tool for BDD-Based Verification of Real-Time Systems.
In: Warren A. Hunt Jr. & Fabio Somenzi: CAV,
LNCS 2725.
Springer,
pp. 122–125,
doi:10.1007/978-3-540-45069-6_13.
D. Beyer & A. Noack (2003):
Can Decision Diagrams Overcome State Space Explosion in Real-Time Verification?.
In: Hartmut König, Monika Heiner & Adam Wolisz: FORTE,
LNCS 2767.
Springer,
pp. 193–208,
doi:10.1007/978-3-540-39979-7_13.
P. Bouyer (2003):
Untameable Timed Automata!.
In: Helmut Alt & Michel Habib: STACS,
LNCS 2607.
Springer,
pp. 620–631,
doi:10.1007/3-540-36494-3_54.
M. Bozga, S. Graf & L. Mounier (2002):
IF-2.0: A Validation Environment for Component-Based Real-Time Systems.
In: Ed Brinksma & Kim Guldstrand Larsen: CAV,
LNCS 2404.
Springer,
pp. 343–348,
doi:10.1007/3-540-45657-0_26.
M. Bozga, O. Maler & S. Tripakis (1999):
Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics.
In: Proceedings of Correct Hardware Design and Verification Methods (CHARME'99),
LNCS 1703.
Springer,
pp. 125–141,
doi:10.1007/3-540-48153-2_11.
J. Byg, K.Y. Jørgensen & J. Srba (2009):
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata.
In: Proc. of the 11th International Conf. on Formal Engineering Methods (ICFEM'09),
LNCS 5885.
Springer-Verlag,
pp. 698–716,
doi:10.1007/978-3-642-10373-5_36.
A.E. Dalsgaard, R.R. Hansen, K.Y. Jørgensen, K.G. Larsen, M.Chr. Olesen, P. Olsen & J. Srba (2011):
opaal: A Lattice Model Checker.
In: Proceedings of the 3rd NASA Formal Methods Symposium (NFM'11),
LNCS 6617.
Springer-Verlag,
pp. 487–493,
doi:10.1007/978-3-642-20398-5_37.
A. David, L. Jacobsen, M. Jacobsen, K.Y. Jørgensen, M.H. Møller & J. Srba (2012):
TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets.
In: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'12),
LNCS 7214.
Springer-Verlag,
pp. 492–497,
doi:10.1007/978-3-642-28756-5_36.
C. Daws, A. Olivero, S. Tripakis & S. Yovine (1996):
The Tool Kronos.
In: Proc. Hybrid Systems III: Verification and Control (1995),
LNCS 1066.
Springer-Verlag,
pp. 208–219,
doi:10.1007/BFb0020947.
D.L. Dill (1989):
Timing Assumptions and Verification of Finite-State Concurrent Systems.
In: Joseph Sifakis: Automatic Verification Methods for Finite State Systems,
LNCS 407.
Springer,
pp. 197–212,
doi:10.1007/3-540-52148-8_17.
P.-A. Hsiung, F. Wang & R.-Ch. Chen (2000):
On the verification of Wireless Transaction Protocol using SGM and RED.
In: RTCSA.
IEEE Computer Society,
pp. 379–383,
doi:10.1109/RTCSA.2000.896414.
Y.-K. Kwok & I. Ahmad (1999):
Benchmarking and Comparison of the Task Graph Scheduling Algorithms.
Journal of Parallel and Distributed Computing 59(3),
pp. 381 – 422,
doi:10.1006/jpdc.1999.1578.
L. Lamport (1987):
A Fast Mutual Exclusion Algorithm.
ACM Transactions on Computer Systems 5(1),
pp. 1–11,
doi:10.1145/7351.7352.
L. Lamport (2005):
Real-Time Model Checking Is Really Simple.
In: CHARME,
LNCS 3725.
Springer,
pp. 162–175,
doi:10.1007/11560548_14.
K.G. Larsen & Y. Wang (1997):
Time-Abstracted Bisimulation: Implicit Specifications and Decidability.
Information and Computation 134(2),
pp. 75 – 101,
doi:10.1006/inco.1997.2623.
Y. Liu, J. Sun & J.S. Dong (2008):
An Analyzer for Extended Compositional Process Algebras.
In: ICSE Companion.
ACM,
pp. 919–920,
doi:10.1145/1370175.1370187.
Kasahara Laboratory at Waseda University:
Standard Task Graph Set.
Http://www.kasahara.elec.waseda.ac.jp/schedule/.
J. Zhao, X. Li & G. Zheng (2005):
A quadratic-time DBM-based successor algorithm for checking timed automata.
Information Processing Letters 96(3),
pp. 101–105,
doi:10.1016/j.ipl.2005.05.027.
eptcs@eptcs.org