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

From MaRDI portal
Publication:1603709

DOI10.1016/S0304-3975(01)00046-9zbMath1050.68094MaRDI QIDQ1603709

Gethin Norman, Roberto Segala, Jeremy Sproston, Marta Kwiatkowska

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)




Related Items (55)

Expected reachability-time gamesProbabilistic Timed Automata with One Clock and Initialised Clock-Dependent ProbabilitiesTweaking the odds in probabilistic timed automataParameter Synthesis for Probabilistic Timed Automata Using Stochastic Game AbstractionsSymbolic model checking for probabilistic timed automataProbabilistic Real-Time Rewrite Theories and Their Expressive PowerModel Checking Probabilistic SystemsState explosion in almost-sure probabilistic reachabilityParameter synthesis for probabilistic timed automata using stochastic game abstractionsConcavely-Priced Probabilistic Timed AutomataStrict Divergence for Probabilistic Timed AutomataPerformance analysis of probabilistic timed automata using digital clocksBetter abstractions for timed automataModel Checking Linear-Time Properties of Probabilistic SystemsWeak bisimulation for probabilistic timed automataA uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalencesVerification and Control of Probabilistic Rectangular Hybrid AutomataSymbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed AutomataSafety verification for probabilistic hybrid systemsA survey of timed automata for the development of real-time systems\textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semanticsProbabilistic timed automata with clock-dependent probabilitiesA survey on temporal logics for specifying and verifying real-time systemsCombined model checking for temporal, probabilistic, and real-time logicsVerifying Probabilistic Timed Automata Against Omega-Regular Dense-Time PropertiesBounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logicModel checking HPnGs in multiple dimensions: representing state sets as convex polytopesFormal verification and quantitative metrics of MPSoC data dynamicsUnnamed ItemLocal abstraction refinement for probabilistic timed programsVerification and control for probabilistic hybrid automata with finite bisimulationsTowards general axiomatizations for bisimilarity and trace semanticsEmptiness and Universality Problems in Timed Automata with Positive FrequencySymbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automataAn extension of the inverse method to probabilistic timed automataModel checking for probabilistic timed automataA compositional modelling and analysis framework for stochastic hybrid systemsProbabilistic timed graph transformation systemsUnnamed ItemIdentity-Based Cryptosystems and Quadratic ResiduosityFormal Analysis of Publish-Subscribe Systems by Probabilistic Timed AutomataConsistency in parametric interval probabilistic timed automataUnnamed ItemStatistical Approximation of Optimal Schedulers for Probabilistic Timed AutomataProbabilistic Time Petri NetsStochastic Games for Verification of Probabilistic Timed AutomataPerformance analysis and functional verification of the stop-and-wait protocol in HOLA note on the attractor-property of infinite-state Markov chainsUnnamed ItemTowards light-weight probabilistic model checkingA theory of stochastic systems. I: Stochastic automataCalculating Probabilities of Real-Time Test CasesOn Verification of Linear Occurrence Properties of Real-Time SystemsModel checking for entanglement swappingInterval probabilistic timed graph transformation systems


Uses Software


Cites Work




This page was built for publication: Automatic verification of real-time systems with discrete probability distributions.