On probabilistic monitorability
From MaRDI portal
Publication:6113983
DOI10.1007/978-3-031-22337-2_16zbMath1528.68246MaRDI QIDQ6113983
Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Mathias Ruggaard Pedersen, Adrian Francalanza, Karoliina Lehtinen, Anna Ingólfsdóttir
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Runtime monitors for Markov decision processes
- Monitoring temporal logic with clock variables
- A framework for parameterized monitorability
- A theory of monitors
- Monitorability for the Hennessy-Milner logic with recursion
- EQUIVALENCE OF LABELED MARKOV CHAINS
- Monitoring the Full Range of ω-Regular Properties of Stochastic Systems
- Algebraic laws for nondeterminism and concurrency
- Consistently-detecting monitors
- Monitoring for Silent Actions
- A Theory of Register Monitors
- Monitoring Temporal Properties of Stochastic Systems
This page was built for publication: On probabilistic monitorability