Comparing LTL semantics for runtime verification
From MaRDI portal
Recommendations
Cited in
(50)- Finite-trace linear temporal logic: coinductive completeness
- Concurrency-preserving and sound monitoring of multi-threaded component-based systems: theory, algorithms, implementation, and evaluation
- Computer says no: verdict explainability for runtime monitors using a local proof system
- Comparing trace expressions and linear temporal logic for runtime verification
- Monitoring timed properties (revisited)
- Incorporating monitors in reactive synthesis without paying the price
- Time-triggered runtime verification
- Determinizing monitors for HML with recursion
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
- A brief account of runtime verification
- Monitorability for the Hennessy-Milner logic with recursion
- A tableau construction for finite linear-time temporal logic
- Monitoring metric first-order temporal properties
- Extended Nested Dual System Groups, Revisited
- A theory of monitors (extended abstract)
- Runtime verification of component-based systems
- Multi-head monitoring of metric temporal logic
- Almost event-rate independent monitoring of metric temporal logic
- Contracts Violation: Justification via Argumentation
- Impartial Anticipation in Runtime-Verification
- Runtime verification using a temporal description logic
- Observation strategies for event detection with incidence on runtime verification: theory, algorithms, experimentation
- Decentralized asynchronous crash-resilient runtime verification
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited
- Runtime verification of embedded real-time systems
- Development of global specification for dynamically adaptive software
- Consistently-detecting monitors
- An LTL proof system for runtime verification
- Trace-length independent runtime monitoring of quantitative policies in LTL
- scientific article; zbMATH DE number 7056237 (Why is no real title available?)
- Decentralized Asynchronous Crash-resilient Runtime Verification
- Introduction to the special issue on runtime verification
- A counting semantics for monitoring LTL specifications over finite traces
- On monitoring linear temporal properties
- Quantitative safety and liveness
- Assumption-based runtime verification
- Bridging the gap between single- and multi-model predictive runtime verification
- From LTL to rLTL monitoring: improved monitorability through robust semantics
- Symbolic runtime verification for monitoring under uncertainties and assumptions
- Refining the safety-liveness classification of temporal properties according to monitorability
- Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption
- An Operational Guide to Monitorability
- First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
- Towards the exact complexity of realizability for safety LTL
- Runtime verification of partially-synchronous distributed system
- Organising LTL monitors over distributed systems with a global clock
- Semantics for linear-time temporal logic with finite observations
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- The ins and outs of first-order runtime verification
This page was built for publication: Comparing LTL semantics for runtime verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569195)
