L. Aceto, A. Ingacute013olfsdacute013ottir, K.G. Larsen & J. Srba (2007):
Reactive Systems: Modelling, Specification and Verification.
Cambridge University Press,
doi:10.1145/1811226.1811243.
R. Alur, C. Courcoubetis & T. A. Henzinger (1994):
The Observational Power of Clocks.
In: Proceedings of CONCUR,
pp. 162–177,
doi:10.1007/BFb0015008.
R. Alur & D.L. Dill (1994):
A Theory of Timed Automata.
Theoretical Computer Science 126,
pp. 183–235,
doi:10.1016/0304-3975(94)90010-8.
K. Cerans (1992):
Decidability of bisimulation equivalences for parallel timer processes.
In: Proceedings of CAV 663.
Springer-Verlag,
pp. 302–315,
doi:10.1007/3-540-56496-9_24.
X. Chen & Y. Deng (2008):
Game Characterizations of Process Equivalences.
In: Proceedings of APLAS,
pp. 107–121,
doi:10.1007/978-3-540-89330-1_8.
C. Daws & S. Tripakis (1998):
Model Checking of Real-Time Reachability Properties Using Abstractions.
In: Proceedings of TACAS.
Springer-Verlag,
pp. 313–329,
doi:10.1007/BFb0054180.
E. Fleury G. Behrmann, P. Bouyer & K. G. Larsen (2003):
Static guard analysis in timed automata verification.
In: Proceedings of TACAS.
Springer-Verlag,
pp. 254–270,
doi:10.1007/3-540-36577-X_18.
K. G. Larsen G. Behrmann, P. Bouyer & R. Pelanek (2006):
Lower and upper bounds in zone-based abstractions of timed automata.
International Journal on Software Tools for Technology Transfer 8,
pp. 204–215,
doi:10.1007/s10009-005-0190-0.
Rob J. van Glabbeek (1990):
The Linear Time-Branching Time Spectrum (Extended Abstract).
In: Proceedings of CONCUR,
pp. 278–297,
doi:10.1007/BFb0039066.
J. C. Godskesen & K. G. Larsen (1995):
Synthesizing distinguishing formulae for real time systems.
Nordic J. of Computing 2(3),
pp. 338–357.
S. Guha, C. Narayan & S. Arun-Kumar (2012):
On Decidability of Prebisimulation for Timed Automata.
In: Proceedings of CAV.
Springer-Verlag,
pp. 444–461,
doi:10.1007/978-3-642-31424-7_33.
T. A. Henzinger, X. Nicollin, J. Sifakis & S. Yovine (1992):
Symbolic Model Checking for Real-time Systems.
Information and Computation 111,
pp. 394–406,
doi:10.1006/inco.1994.1045.
M. Kwiatkowska, G. Norman, R. Segala & J. Sproston (2002):
Automatic verification of real-time systems with discrete probability distributions.
Theoretical Computer Science 282(1),
pp. 101–150,
doi:10.1016/S0304-3975(01)00046-9.
F. Laroussinie, Kim G. Larsen & C. Weise (1995):
From Timed Automata to Logic – and Back.
In: Proceedings of MFCS,
pp. 529–539,
doi:10.1007/3-540-60246-1_158.
F. Laroussinie & Ph. Schnoebelen (2000):
The State Explosion Problem from Trace to Bisimulation Equivalence.
In: Proceedings of FoSSaCS.
Springer-Verlag,
pp. 192–207,
doi:10.1007/3-540-46432-8_13.
K. G. Larsen & W. Yi (1994):
Time abstracted bisimulation: implicit specifications and decidability.
In: Proceedings of MFPS 802.
Springer-Verlag,
pp. 160–176,
doi:10.1007/3-540-58027-1_8.
R. Milner (1989):
Communication and Concurrency.
Prentice Hall.
C. Stirling (1995):
Local Model Checking Games.
In: Proceedings of CONCUR,
pp. 1–11,
doi:10.1007/3-540-60218-6_1.
C. Stirling (2001):
Modal and temporal properties of processes.
Springer-Verlag New York, Inc.,
New York, NY, USA,
doi:10.1007/978-1-4757-3550-5.
H. Straubing (1994):
Finite automata, formal logic, and circuit complexity.
Birkhauser Verlag,
Basel, Switzerland, Switzerland,
doi:10.1007/978-1-4612-0289-9.
S. Tripakis & S. Yovine (2001):
Analysis of Timed Systems using Time-Abstracting Bisimulations.
Formal Methods in System Design 18,
pp. 25–68,
doi:10.1023/A:1008734703554.
C. Weise & D. Lenzkes (1997):
Efficient scaling-invariant checking of timed bisimulation.
In: Proceedings of STACS 1200.
Springer, Berlin,
pp. 177–188,
doi:10.1007/BFb0023458.
eptcs@eptcs.org