Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
On the Logical Characterisation of Performability Properties
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Model Checking Performability Properties
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
On the role of generalized semi-Markov processes in simulation output analysis
WSC '83 Proceedings of the 15th conference on Winter simulation - Volume 1
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Model Checking Markov Reward Models with Impulse Rewards
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
VESTA: A Statistical Model-checker and Analyzer for Probabilistic Systems
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
APMC 3.0: Approximate Verification of Discrete and Continuous Time Markov Chains
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Statistical probabilistic model checking with a focus on time-bounded properties
Information and Computation
Model Checking Markov Chains with Actions and State Labels
IEEE Transactions on Software Engineering
Model Checking Timed and Stochastic Properties with CSL^{TA}
IEEE Transactions on Software Engineering
Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Simulation-Based CTMC Model Checking: An Empirical Evaluation
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
A bounded statistical approach for model checking of unbounded until properties
Proceedings of the IEEE/ACM international conference on Automated software engineering
On statistical model checking of stochastic systems
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Ymer: a statistical model checker
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Coupling and importance sampling for statistical model checking
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Expressive statistical model checking of genetic networks with delayed stochastic dynamics
CMSB'12 Proceedings of the 10th international conference on Computational Methods in Systems Biology
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
Expressing and computing passage time measures of GSPN models with HASL
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
We introduce the Hybrid Automata Stochastic Logic (HASL), a new temporal logic formalism for the verification of discrete event stochastic processes (DESP). HASL employs Linear Hybrid Automata (LHA) as machineries to select prefixes of relevant execution paths of a DESP. The advantage with LHA is that rather elaborate information can be collected on-the-fly during path selection, providing the user with a powerful means to express sophisticated measures. A formula of HASL consists of an LHA and an expression Z referring to moments of path random variables. A simulation-based statistical engine is employed to obtain a confidence-interval estimate of the expected value of Z. In essence HASL provides a unifying verification framework where temporal reasoning is naturally blended with elaborate reward-based analysis. We illustrate the HASL approach by means of some examples and a discussion about its expressivity. We also provide empirical evidence obtained through Cosmos, a prototype software tool for HASL verification.