Jeremy Sproston

From MaRDI portal
(Redirected from Person:846014)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
scientific article; zbMATH DE number 7730627 (Why is no real title available?)
(available as arXiv preprint)
2023-08-21Paper
Timed games with bounded window parity objectives
(available as arXiv preprint)
2023-01-18Paper
Probabilistic timed automata with one clock and initialised clock-dependent probabilities
Formal Techniques for Distributed Objects, Components, and Systems
2022-10-13Paper
Probabilistic timed automata with one clock and initialised clock-dependent probabilities
(available as arXiv preprint)
2022-02-09Paper
Probabilistic timed automata with one clock and initialised clock-dependent probabilities2022-02-09Paper
Probabilistic timed automata with clock-dependent probabilities
Fundamenta Informaticae
2021-05-21Paper
Verification and control for probabilistic hybrid automata with finite bisimulations
Journal of Logical and Algebraic Methods in Programming
2019-03-27Paper
Qualitative reachability for open interval Markov chains
(available as arXiv preprint)
2018-10-23Paper
Probabilistic timed automata with clock-dependent probabilities
Lecture Notes in Computer Science
2017-12-20Paper
Qualitative analysis of VASS-induced MDPs
Lecture Notes in Computer Science
2016-06-10Paper
Qualitative analysis of VASS-induced MDPs
Lecture Notes in Computer Science
2016-06-10Paper
Verification and control of probabilistic rectangular hybrid automata
Lecture Notes in Computer Science
2015-09-14Paper
An extension of the inverse method to probabilistic timed automata
Formal Methods in System Design
2014-06-30Paper
Solving parity games on integer vectors
CONCUR 2013 – Concurrency Theory
2013-08-12Paper
Simulation and Bisimulation for Probabilistic Timed Automata
Lecture Notes in Computer Science
2010-09-10Paper
State explosion in almost-sure probabilistic reachability
Information Processing Letters
2010-01-29Paper
Strict Divergence for Probabilistic Timed Automata
CONCUR 2009 - Concurrency Theory
2009-10-22Paper
Validation of Stochastic Systems
Lecture Notes in Computer Science
2009-07-24Paper
Model Checking Probabilistic Timed Automata with One or Two Clocks
Logical Methods in Computer Science
2008-11-13Paper
Model Checking Probabilistic Timed Automata with One or Two Clocks
Tools and Algorithms for the Construction and Analysis of Systems
2007-09-03Paper
From Time Petri Nets to Timed Automata: An Untimed Approach
Tools and Algorithms for the Construction and Analysis of Systems
2007-09-03Paper
Symbolic model checking for probabilistic timed automata
Information and Computation
2007-07-16Paper
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science
2005-11-10Paper
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Lecture Notes in Computer Science
2005-08-19Paper
scientific article; zbMATH DE number 2090709 (Why is no real title available?)2004-08-13Paper
Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol
Formal Aspects of Computing
2003-08-27Paper
scientific article; zbMATH DE number 1864589 (Why is no real title available?)2003-02-06Paper
scientific article; zbMATH DE number 1759607 (Why is no real title available?)2002-11-28Paper
Automatic verification of real-time systems with discrete probability distributions.
Theoretical Computer Science
2002-07-15Paper
scientific article; zbMATH DE number 1696496 (Why is no real title available?)2002-06-17Paper


Research outcomes over time


This page was built for person: Jeremy Sproston