Jeremy Sproston

Proceedings of the Formal Methods and Software Engineering, 2024

2023

Qualitative reachability for open interval Markov chains.

[BibT_eX]

[DOI]

PeerJ Comput. Sci., 2023

2022

Timed Games with Bounded Window Parity Objectives.

[BibT_eX]

[DOI]

James C. A. Main

Mickael Randour

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2022

2021

Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

Probabilistic Timed Automata with Clock-Dependent Probabilities.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives.

[BibT_eX]

[DOI]

James C. A. Main

Mickael Randour

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2019

Verification and control for probabilistic hybrid automata with finite bisimulations.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2019

2017

Analysis of Timed Properties Using the Jump-Diffusion Approximation.

[BibT_eX]

[DOI]

Proceedings of the Computer Performance Engineering - 14th European Workshop, 2017

2016

Qualitative Analysis of VASS-Induced MDPs.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

Verification and Control of Probabilistic Rectangular Hybrid Automata.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015

2014

Exact and Approximate Abstraction for Classes of Stochastic Hybrid Systems.

[BibT_eX]

[DOI]

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014

2013

Model checking for probabilistic timed automata.

[BibT_eX]

[DOI]

David Parker

Formal Methods Syst. Des., 2013

An extension of the inverse method to probabilistic timed automata.

[BibT_eX]

[DOI]

Étienne André

Laurent Fribourg

Formal Methods Syst. Des., 2013

Solving Parity Games on Integer Vectors.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2011

Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Quantitative Evaluation of Systems, 2011

Performability Measure Specification: Combining CSRL and MSL.

[BibT_eX]

[DOI]

Alessandro Aldini

Marco Bernardo

Proceedings of the Formal Methods for Industrial Critical Systems, 2011

2010

Simulation and Bisimulation for Probabilistic Timed Automata.

[BibT_eX]

[DOI]

Angelo Troina

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010

2009

Model Checking Timed and Stochastic Properties with CSL^{TA}.

[BibT_eX]

[DOI]

Serge Haddad

IEEE Trans. Software Eng., 2009

Strict Divergence for Probabilistic Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Model Checking Probabilistic Timed Automata with One or Two Clocks.

[BibT_eX]

[DOI]

Marcin Jurdzinski

François Laroussinie

Log. Methods Comput. Sci., 2008

Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

2007

State explosion in almost-sure probabilistic reachability.

[BibT_eX]

[DOI]

François Laroussinie

Inf. Process. Lett., 2007

Symbolic model checking for probabilistic timed automata.

[BibT_eX]

[DOI]

Inf. Comput., 2007

From Time Petri Nets to Timed Automata: An Untimed Approach.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

CSL<sup>TA</sup>: an Expressive Logic for Continuous-Time Markov Chains.

[BibT_eX]

[DOI]

Serge Haddad

Proceedings of the Fourth International Conference on the Quantitative Evaluaiton of Systems (QEST 2007), 2007

2006

Backward Bisimulation in Markov Chain Model Checking.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 2006

Performance analysis of probabilistic timed automata using digital clocks.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2006

CSL Model Checking for Generalized Stochastic Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 2006

Verifying Stochastic Well-formed Nets with CSL Model-Checking Tools.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 2006

2005

Model Checking Durational Probabilistic Systems.

[BibT_eX]

[DOI]

François Laroussinie

Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004

Model Checking for Probabilistic Timed Systems.

[BibT_eX]

[DOI]

Proceedings of the Validation of Stochastic Systems - A Guide to Current Research, 2004

Backward Stochastic Bisimulation in CSL Model Checking.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

CSL Model Checking for the GreatSPN Tool.

[BibT_eX]

[DOI]

Davide D'Aprile

Proceedings of the Computer and Information Sciences, 2004

2003

Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol.

[BibT_eX]

[DOI]

Marta Z. Kwiatkowska

Formal Aspects Comput., 2003

2002

Automatic verification of real-time systems with discrete probability distributions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol.

[BibT_eX]

[DOI]

Marta Z. Kwiatkowska

Proceedings of the Process Algebra and Probabilistic Methods, 2002

2001

Symbolic Computation of Maximal Probabilistic Reachability.

[BibT_eX]

[DOI]

Marta Z. Kwiatkowska

Proceedings of the CONCUR 2001, 2001

2000

Model checking of probabilistic timed and hybrid systems.

[BibT_eX]

[DOI]

Jeremy James Sproston

PhD thesis, 2000

Decidable Model Checking of Probabilistic Hybrid Automata.

[BibT_eX]

[DOI]