scientific article; zbMATH DE number 1759607
From MaRDI portal
Publication:4536598
Recommendations
- Automatic verification of real-time systems with discrete probability distributions.
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
- Symbolic model checking for probabilistic timed automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Verifying automata specification of distributed probabilistic real-time systems
Cited in
(24)- Verifying automata specification of distributed probabilistic real-time systems
- Proving properties of continuous systems: Qualitative simulation and temporal logic
- Automatic verification of real-time systems with discrete probability distributions.
- Model checking for probabilistic timed automata
- A compositional modelling and analysis framework for stochastic hybrid systems
- Consistency in parametric interval probabilistic timed automata
- A survey on temporal logics for specifying and verifying real-time systems
- Statistical probabilistic model checking with a focus on time-bounded properties
- A theory of stochastic systems. I: Stochastic automata
- Verification and control of probabilistic rectangular hybrid automata
- Verification and control of partially observable probabilistic real-time systems
- Rewarding probabilistic hybrid automata
- Calculating Probabilities of Real-Time Test Cases
- A framework for verification of software with time and probabilities
- Trace-Based Semantics for Probabilistic Timed I/O Automata
- A survey of timed automata for the development of real-time systems
- scientific article; zbMATH DE number 1444738 (Why is no real title available?)
- Model checking probabilistic real-time properties for service-oriented systems with service level agreements
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- Monitoring CTMCs by multi-clock timed automata
- Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties
- Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe construction
- Expressiveness and conciseness of timed automata for the verification of stochastic models
- Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe-construction
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536598)