Rajeev Alur & David L. Dill (1994):
A theory of timed automata.
Theor. Comput. Sci. 126(2),
pp. 183–235,
doi:10.1016/0304-3975(94)90010-8.
Rajeev Alur, Limor Fix & Thomas A. Henzinger (1999):
Event-Clock Automata: A Determinizable Class of Timed Automata.
Theor. Comput. Sci. 211(1-2),
pp. 253–273,
doi:10.1016/S0304-3975(97)00173-4.
Sebastian Bauer, Uli Fahrenberg, Axel Legay & Claus Thrane (2012):
General Quantitative Specification Theories with Modalities.
In: Computer Science – Theory and Applications,
LNCS 7353.
Springer,
pp. 18–30,
doi:10.1007/978-3-642-30642-6_3.
Nathalie Bertrand, Axel Legay, Sophie Pinchinat & Jean-Baptiste Raclet (2012):
Modal event-clock specifications for timed component-based design.
Science of Computer Programming 77(12),
pp. 1212–1234,
doi:10.1016/j.scico.2011.01.007.
Benoît Caillaud, Benoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen & Andrzej Wąsowski (2011):
Constraint Markov Chains.
Theoretical Computer Science 412(34),
pp. 4373–4404,
doi:10.1016/j.tcs.2011.05.010.
Taolue Chen, Chris Chilton, Bengt Jonsson & Marta Z. Kwiatkowska (2012):
A Compositional Specification Theory for Component Behaviours.
In: ESOP'12,
LNCS 7211.
Springer,
pp. 148–168,
doi:10.1007/978-3-642-28869-2_8.
Taolue Chen, Tingting Han & Joost-Pieter Katoen (2008):
Time-Abstracting Bisimulation for Probabilistic Timed Automata.
In: TASE'08.
IEEE Computer Society,
pp. 177–184,
doi:10.1109/TASE.2008.29.
Chris Chilton, Bengt Jonsson & Marta Kwiatkowska (2012):
Assume-Guarantee Reasoning for Safe Component Behaviours.
In: FACS'12,
LNCS 7684.
Springer,
pp. 92–109,
doi:10.1007/978-3-642-35861-6_6.
Chris Chilton, Marta Z. Kwiatkowska & Xu Wang (2012):
Revisiting Timed Specification Theories: A Linear-Time Perspective.
In: FORMATS'12,
LNCS 7595.
Springer,
pp. 75–90,
doi:10.1007/978-3-642-33365-1_7.
Alexandre David, Kim G. Larsen, Axel Legay, Ulrik Nyman & Andrzej Wasowski (2010):
Timed I/O automata: a complete specification theory for real-time systems.
In: HSCC'10.
ACM,
pp. 91–100,
doi:10.1145/1755952.1755967.
Benoît Delahaye, Joost-Pieter Katoen, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Falak Sher & Andrzej Wasowski (2011):
Abstract Probabilistic Automata.
In: VMCAI'11,
LNCS 6538.
Springer,
pp. 324–339,
doi:10.1007/978-3-642-18275-4_23.
Uli Fahrenberg & Axel Legay (2012):
A Robust Specification Theory for Modal Event-Clock Automata.
In: FIT,
EPTCS 87,
pp. 5–16,
doi:10.4204/EPTCS.87.2.
Tingting Han, Christian Krause, Marta Kwiatkowska & Holger Giese (2013):
Modal Specifications for Probabilistic Timed Systems.
Technical Report CS-RR-13-03.
University of Oxford, Department of Computer Science.
M. Kwiatkowska, G. Norman, R. Segala & J. Sproston (2002):
Automatic verification of real-time systems with discrete probability distributions.
Theoretical Computer Science 282,
pp. 101–150,
doi:10.1016/S0304-3975(01)00046-9.
Kim Guldstrand Larsen, Ulrik Nyman & Andrzej Wasowski (2007):
On Modal Refinement and Consistency.
In: CONCUR'07,
LNCS 4703.
Springer,
pp. 105–119,
doi:10.1007/978-3-540-74407-8_8.
Kim Guldstrand Larsen & Bent Thomsen (1988):
A Modal Process Logic.
In: LICS'88.
IEEE Computer Society,
pp. 203–210,
doi:10.1109/LICS.1988.5119.
Roberto Segala (1995):
Modeling and Verification of Randomized Distributed Real-Time Systems.
Massachusetts Institute of Technology.
eptcs@eptcs.org