(1999):
IEEE Standard for Information Technology-Portable Operating System Interface (POSIX)-Part 1: System Application Program Interface (API)- Amendment D: Additional Real time Extensions [C Language],
doi:10.1109/IEEESTD.1999.91515.
Yasmina Adbeddaïm & Oded Maler (2002):
Preemptive Job-Shop Scheduling using Stopwatch Automata.
In: TACAS,
Lecture Notes in Computer Science 2280.
Springer-Verlag,
pp. 113–126,
doi:10.1007/3-540-46002-0_9.
Rajeev Alur & David L. Dill (1994):
A theory of timed automata.
Theoretical Computer Science 126(2),
pp. 183–235,
doi:10.1016/0304-3975(94)90010-8.
Rajeev Alur, Thomas A. Henzinger & Moshe Y. Vardi (1993):
Parametric real-time reasoning.
In: STOC.
ACM,
pp. 592–601,
doi:10.1145/167088.167242.
Étienne André & Laurent Fribourg (2010):
Behavioral Cartography of Timed Automata.
In: RP,
Lecture Notes in Computer Science 6227.
Springer,
pp. 76–90,
doi:10.1007/978-3-642-15349-5_5.
Étienne André, Laurent Fribourg & Romain Soulat (2013):
Merge and Conquer: State Merging in Parametric Timed Automata.
In: ATVA,
Lecture Notes in Computer Science 8172.
Springer,
pp. 381–396,
doi:10.1007/978-3-319-02444-8_27.
Étienne André, Laurent Fribourg, Ulrich Kühne & Romain Soulat (2012):
IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems.
In: FM,
Lecture Notes in Computer Science 7436.
Springer,
pp. 3336,
doi:10.1007/978-3-642-32759-9_6.
Étienne André & Romain Soulat (2013):
The Inverse Method.
ISTE Ltd and John Wiley & Sons Inc.,
doi:10.1002/9781118569351.
Sanjoy K. Baruah, Louis E. Rosier & Rodney R. Howell (1990):
Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor.
Real-Time Systems 2(4),
pp. 301–324,
doi:10.1007/BF01995675.
Enrico Bini, Marco Di Natale & Giorgio C. Buttazzo (2006):
Sensitivity Analysis for Fixed-Priority Real-Time Systems.
In: ECRTS,
pp. 1322,
doi:10.1007/s11241-006-9010-1.
Giacomo Bucci, Andrea Fedeli, Luigi Sassoli & Enrico Vicario (2004):
Timed state space analysis of real-time preemptive systems.
IEEE Transactions on Software Engineering 30(2),
pp. 97–111,
doi:10.1109/TSE.2004.1265815.
Giorgio C. Buttazzo (2004):
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series).
Springer-Verlag TELOS.
Alessandro Cimatti, Alberto Griggio, Sergio Mover & Stefano Tonetta (2013):
Parameter synthesis with IC3.
In: FMCAD.
IEEE,
pp. 165–168,
doi:10.1109/FMCAD.2013.6679406.
Alessandro Cimatti, Luigi Palopoli & Yusi Ramadian (2008):
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata.
In: RTSS.
IEEE Computer Society,
pp. 80–89,
doi:10.1109/RTSS.2008.36.
Elena Fersman, Leonid Mokrushin, Paul Pettersson & Wang Yi (2003):
Schedulability Analysis Using Two Clocks.
In: TACAS,
pp. 224–239,
doi:10.1007/3-540-36577-X_16.
Elena Fersman, Paul Pettersson & Wang Yi (2002):
Timed Automata with Asynchronous Processes: Schedulability and Decidability.
In: TACAS.
Springer-Verlag,
pp. 67–82,
doi:10.1007/3-540-46002-0_6.
Gomaa Hassan (2012):
Software Modeling and Design: UML, Use Cases, Patterns, and Software Architectures.
Cambridge University Press,
doi:10.1145/1988997.1989008.
Aleksandra Jovanovi\'c, Didier Lime & Olivier H. Roux (2013):
Integer Parameter Synthesis for Timed Automata.
In: TACAS,
Lecture Notes in Computer Science 7795.
Springer,
pp. 401–415,
doi:10.1007/978-3-642-36742-7_28.
Kai Lampka, Simon Perathoner & Lothar Thiele (2013):
Component-based system design: analytic real-time interfaces for state-based component implementations.
International Journal on Software Tools for Technology Transfer 15(3),
pp. 155170,
doi:10.1007/s10009-012-0257-7.
Thi Thieu Hoa Le, Luigi Palopoli, Roberto Passerone & Yusi Ramadian (2013):
Timed-automata based schedulability analysis for distributed firm real-time systems: A case study.
International Journal on Software Tools for Technology Transfer 15(3),
pp. 211–228,
doi:10.1007/s10009-012-0245-y.
Joseph Y.-T. Leung & Jennifer Whitehead (1982):
On the complexity of fixed-priority scheduling of periodic, real-time tasks.
Performance Evaluation 2(4),
pp. 237–250,
doi:10.1016/0166-5316(82)90024-4.
Didier Lime & Olivier H. Roux (2009):
Formal verification of real-time systems with preemptive scheduling.
Real-Time Systems 41(2),
pp. 118–151,
doi:10.1007/s11241-008-9059-0.
Shang-Wei Lin, Étienne André, Yang Liu, Jun Sun & Jin Song Dong (2014):
Learning Assumptions for Compositional Verification of Timed Systems.
Transactions on Software Engineering,
doi:10.1109/TSE.2013.57.
To appear.
Chung Laung Liu & James W Layland (1973):
Scheduling algorithms for multiprogramming in a hard-real-time environment.
Journal of the ACM 20(1),
pp. 46–61,
doi:10.1145/321738.321743.
Jane W. Liu (2000):
Real-time systems.
Prentice Hall PTR.
Insik Shin & Insup Lee (2008):
Compositional real-time scheduling framework with periodic model.
ACM Transactions on Embedded Computing Systems (TECS) 7(3),
pp. 30,
doi:10.1145/1347375.1347383.
Youcheng Sun, Romain Soulat, Étienne Lipari, Giuseppe André & Laurent Fribourg (2013):
Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems.
In: Cyrille Artho & Peter Ölveczky: Second International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS'13),
Communications in Computer and Information Science 419.
Springer.
To appear..
L. Thiele, S. Chakraborty & M. Naedele (2000):
Real-time calculus for scheduling hard real-time systems.
In: Proceedings of the 2000 IEEE International Symposium on Circuits and Systems, ISCAS 2000, Geneva. 4.
IEEE,
pp. 101–104,
doi:10.1109/ISCAS.2000.858698.
Louis-Marie Traonouez, Didier Lime & Olivier H. Roux (2009):
Parametric Model-Checking of Stopwatch Petri Nets.
Journal of Universal Computer Science 15(17),
pp. 3273–3304,
doi:10.3217/jucs-015-17-3273.