Model-checking for probabilistic real-time systems (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
Theoretical Computer Science
Modeling and analysis of stochastic systems
Modeling and analysis of stochastic systems
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
A Characterization of the Stochastic Process Underlying a Stochastic Petri Net
IEEE Transactions on Software Engineering
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Efficient Timed Reachability Analysis Using Clock Difference Diagrams
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Verifying Automata Specifications of Probabilistic Real-time Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Markov regenerative SPN with non-overlapping activity cycles
IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
Introducing Probability within State Class Analysis of Dense-Time-Dependent Systems
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
State-Density Functions over DBM Domains in the Analysis of Non-Markovian Models
IEEE Transactions on Software Engineering
Using Stochastic State Classes in Quantitative Evaluation of Dense-Time Reactive Systems
IEEE Transactions on Software Engineering
Probabilistic and topological semantics for timed automata
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Oris: a tool for modeling, verification and evaluation of real-time systems
International Journal on Software Tools for Technology Transfer (STTT)
Stochastic Petri Nets: Modelling, Stability, Simulation
Stochastic Petri Nets: Modelling, Stability, Simulation
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
A framework for simulation and symbolic state space analysis of non-markovian models
SAFECOMP'11 Proceedings of the 30th international conference on Computer safety, reliability, and security
Probabilistic Model Checking of Non-Markovian Models with Concurrent Generally Distributed Timers
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
Bounded model checking for GSMP models of stochastic real-time systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Transient analysis of non-Markovian models using stochastic state classes
Performance Evaluation
Almost-Sure Model-Checking of Reactive Timed Automata
QEST '12 Proceedings of the 2012 Ninth International Conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
Stochastic Timed Automata (STA) associate logical locations with continuous, generally distributed sojourn times. In this paper, we introduce Networks of Stochastic Timed Automata (NSTA), where the components interact with each other by message broadcasts. This results in an underlying stochastic process whose state is made of the vector of logical locations, the remaining sojourn times, and the value of clocks. We characterize this general state space Markov process through transient stochastic state classes that sample the state and the absolute age after each event. This provides an algorithmic approach to transient analysis of NSTA models, with fairly general termination conditions which we characterize with respect to structural properties of individual components that can be checked through straightforward algorithms.