Monitoring Timed Properties (Revisited)
Fuente:
arXiv
Saved in:
| Main Authors: | Grosen, Thomas Møller, Kauffman, Sean, Larsen, Kim Guldstrand, Zimmermann, Martin |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Time for Timed Monitorability
by: Grosen, Thomas M., et al.
Published: (2025)
by: Grosen, Thomas M., et al.
Published: (2025)
Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability
by: Cimatti, Alessandro, et al.
Published: (2024)
by: Cimatti, Alessandro, et al.
Published: (2024)
Robust Probabilistic Temporal Logics
by: Zimmermann, Martin
Published: (2023)
by: Zimmermann, Martin
Published: (2023)
Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays
by: Fränzle, Martin, et al.
Published: (2024)
by: Fränzle, Martin, et al.
Published: (2024)
Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
by: Winter, Sarah, et al.
Published: (2024)
by: Winter, Sarah, et al.
Published: (2024)
Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond $\forall^*\exists^*$
by: Winter, Sarah, et al.
Published: (2025)
by: Winter, Sarah, et al.
Published: (2025)
Logics for Context-free Hyperproperties
by: Winter, Sarah, et al.
Published: (2026)
by: Winter, Sarah, et al.
Published: (2026)
The Complexity of Generalized HyperLTL with Stuttering and Contexts
by: Regaud, Gaëtan, et al.
Published: (2025)
by: Regaud, Gaëtan, et al.
Published: (2025)
The Complexity of Second-order HyperLTL
by: Frenkel, Hadar, et al.
Published: (2023)
by: Frenkel, Hadar, et al.
Published: (2023)
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
by: Guha, Shibashis, et al.
Published: (2021)
by: Guha, Shibashis, et al.
Published: (2021)
The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)
by: Baeten, Jos C. M., et al.
Published: (2025)
DTMC Model Checking by Path Abstraction Revisited (extended version)
by: Hartmanns, Arnd, et al.
Published: (2025)
by: Hartmanns, Arnd, et al.
Published: (2025)
High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
by: Bollig, Benedikt, et al.
Published: (2025)
by: Bollig, Benedikt, et al.
Published: (2025)
History-deterministic Timed Automata
by: Bose, Sougata, et al.
Published: (2023)
by: Bose, Sougata, et al.
Published: (2023)
Learning Verified Monitors for Hidden Markov Models
by: van der Maas, Luko, et al.
Published: (2025)
by: van der Maas, Luko, et al.
Published: (2025)
Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)
by: Bollig, Benedikt
Published: (2026)
by: Bollig, Benedikt
Published: (2026)
Online Monitoring of Metric Temporal Logic using Sequential Networks
by: Ulus, Dogan
Published: (2019)
by: Ulus, Dogan
Published: (2019)
Automata-less Monitoring via Trace-Checking (Extended Version)
by: Brunello, Andrea, et al.
Published: (2025)
by: Brunello, Andrea, et al.
Published: (2025)
Positional Properties in Temporal Logic
by: Newman, Jessica, et al.
Published: (2026)
by: Newman, Jessica, et al.
Published: (2026)
Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
by: Aceto, Luca, et al.
Published: (2025)
by: Aceto, Luca, et al.
Published: (2025)
Unknown Biases and Timing Constraints in Timed Automata
by: Haase, Darion, et al.
Published: (2024)
by: Haase, Darion, et al.
Published: (2024)
Model Checking Temporal Properties of Recursive Probabilistic Programs
by: Winkler, Tobias, et al.
Published: (2021)
by: Winkler, Tobias, et al.
Published: (2021)
Higher-Dimensional Timed Automata for Real-Time Concurrency
by: Amrane, Amazigh, et al.
Published: (2024)
by: Amrane, Amazigh, et al.
Published: (2024)
Characterizing the Polynomial-Time Minimizable $ω$-Automata
by: Radi, Bader Abu, et al.
Published: (2025)
by: Radi, Bader Abu, et al.
Published: (2025)
A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata
by: Doveri, Kyveli, et al.
Published: (2026)
by: Doveri, Kyveli, et al.
Published: (2026)
On the Existence of Reactive Strategies Resilient to Delay
by: Fränzle, Martin, et al.
Published: (2023)
by: Fränzle, Martin, et al.
Published: (2023)
Expregular functions
by: Colcombet, Thomas, et al.
Published: (2026)
by: Colcombet, Thomas, et al.
Published: (2026)
Resolving Nondeterminism with Randomness
by: Henzinger, Thomas A., et al.
Published: (2025)
by: Henzinger, Thomas A., et al.
Published: (2025)
Algebraic Characterizations of Classes of Regular Languages in DynFO
by: Barloy, Corentin, et al.
Published: (2026)
by: Barloy, Corentin, et al.
Published: (2026)
Automating the Analysis of Quantitative Automata with QuAK
by: Chalupa, Marek, et al.
Published: (2025)
by: Chalupa, Marek, et al.
Published: (2025)
Extending QuAK with Nested Quantitative Automata
by: Henzinger, Thomas A., et al.
Published: (2026)
by: Henzinger, Thomas A., et al.
Published: (2026)
Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)
by: Kuperberg, Denis
Published: (2022)
A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)
by: Rooduijn, Jan, et al.
Published: (2024)
A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)
by: Barloy, Corentin, et al.
Published: (2025)
An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)
by: Bojańczyk, Mikołaj, et al.
Published: (2024)
An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)
by: Haase, Christoph, et al.
Published: (2024)
Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)
by: Ye, Lina, et al.
Published: (2023)
Similar Items
-
Time for Timed Monitorability
by: Grosen, Thomas M., et al.
Published: (2025) -
Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability
by: Cimatti, Alessandro, et al.
Published: (2024) -
Robust Probabilistic Temporal Logics
by: Zimmermann, Martin
Published: (2023) -
Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays
by: Fränzle, Martin, et al.
Published: (2024) -
Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
by: Winter, Sarah, et al.
Published: (2024)