Performance analysis of probabilistic timed automata using digital clocks
From MaRDI portal
Recommendations
- Formal Modeling and Analysis of Timed Systems
- Symbolic model checking for probabilistic timed automata
- Model checking for probabilistic timed automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Automatic verification of real-time systems with discrete probability distributions.
Cites work
- scientific article; zbMATH DE number 1693437 (Why is no real title available?)
- scientific article; zbMATH DE number 1701758 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3543391 (Why is no real title available?)
- scientific article; zbMATH DE number 1304998 (Why is no real title available?)
- scientific article; zbMATH DE number 1361118 (Why is no real title available?)
- scientific article; zbMATH DE number 2080039 (Why is no real title available?)
- scientific article; zbMATH DE number 2080040 (Why is no real title available?)
- scientific article; zbMATH DE number 1796156 (Why is no real title available?)
- scientific article; zbMATH DE number 1794360 (Why is no real title available?)
- scientific article; zbMATH DE number 1794367 (Why is no real title available?)
- scientific article; zbMATH DE number 1864589 (Why is no real title available?)
- scientific article; zbMATH DE number 2090709 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- scientific article; zbMATH DE number 3060775 (Why is no real title available?)
- A logic for reasoning about time and reliability
- A theory of timed automata
- An Analysis of Stochastic Shortest Path Problems
- Automatic verification of real-time systems with discrete probability distributions.
- Finite state Markovian decision processes
- Formal Modeling and Analysis of Timed Systems
- Formal Modeling and Analysis of Timed Systems
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k
- Model checking of probabilistic and nondeterministic systems
- Model-checking in dense real-time
- Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol
- Symbolic model checking for real-time systems
- Timing verification by successive approximation
- Uppaal in a nutshell
Cited in
(37)- Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata
- Of cores: a partial-exploration framework for Markov decision processes
- Tweaking the odds in probabilistic timed automata
- Verification and control for probabilistic hybrid automata with finite bisimulations
- Model checking for entanglement swapping
- Verification and control of partially observable probabilistic real-time systems
- Local abstraction refinement for probabilistic timed programs
- Verification and control of partially observable probabilistic systems
- Stochastic games for verification of probabilistic timed automata
- Statistical approximation of optimal schedulers for probabilistic timed automata
- Synthesizing efficient systems in probabilistic environments
- Statistical model checking of stochastic component-based systems
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions
- Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol
- Performance model checking scenario-aware dataflow
- A game-based abstraction-refinement framework for Markov decision processes
- An extension of the inverse method to probabilistic timed automata
- Consistency in parametric interval probabilistic timed automata
- Formal Modeling and Analysis of Timed Systems
- Compositional probabilistic verification through multi-objective model checking
- Of cores: a partial-exploration framework for Markov decision processes
- Symbolic minimum expected time controller synthesis for probabilistic timed automata
- Model checking for probabilistic timed automata
- Value iteration for simple stochastic games: stopping criterion and learning algorithm
- Strict Divergence for Probabilistic Timed Automata
- Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties
- Parameter synthesis for probabilistic timed automata using stochastic game abstractions
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Concavely-Priced Probabilistic Timed Automata
- Abstract model repair for probabilistic systems
- scientific article; zbMATH DE number 1759599 (Why is no real title available?)
- A practitioner's guide to MDP model checking algorithms
- Correct probabilistic model checking with floating-point arithmetic
- Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
- Formal verification and quantitative metrics of MPSoC data dynamics
- Decoupled fitness criteria for reactive systems
- On the convolution efficiency for probabilistic analysis of real-time systems
This page was built for publication: Performance analysis of probabilistic timed automata using digital clocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853731)
