Cover Image

Time for Timed Monitorability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Grosen, Thomas M., Kauffman, Sean, Larsen, Kim G., Zimmermann, Martin
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Monitoring Timed Properties (Revisited)
by: Grosen, Thomas Møller, et al.
Published: (2022)

Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability
by: Cimatti, Alessandro, et al.
Published: (2024)

Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays
by: Fränzle, Martin, et al.
Published: (2024)

You May Delay, but Time Will Not: Timed Games Under Delayed Control
by: Larsen, Kim G., et al.
Published: (2025)

On Decidability Timed Automata with 2 Parametric Clocks
by: Bersani, Marcello M., et al.
Published: (2025)

Parametric Timed Pattern Matching
by: Waga, Masaki, et al.
Published: (2019)

History-deterministic Parikh Automata
by: Erlich, Enzo, et al.
Published: (2022)

DRAMPyML: A Formal Description of DRAM Protocols with Timed Petri Nets
by: Christ, Derek, et al.
Published: (2026)

Controller Synthesis for Parametric Timed Games
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2025)

Corrections to A Menagerie of Timed Automata
by: Keiren, Jeroen J. A., et al.
Published: (2016)

Compositional Abstraction for Timed Systems with Broadcast Synchronization
by: Chen, Hanyue, et al.
Published: (2025)

Learning Deterministic Multi-Clock Timed Automata
by: Teng, Yu, et al.
Published: (2024)

Formalized Run-Time Analysis of Active Learning -- Coalgebraically in Agda
by: Wißmann, Thorsten
Published: (2026)

On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2024)

Unconditional Time and Space Complexity Lower Bounds for Intersection Non-Emptiness
by: Wehar, Michael
Published: (2025)

Random Testing of Model Checkers for Timed Automata with Automated Oracle Generation
by: Manini, Andrea, et al.
Published: (2025)

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
by: Akshay, S, et al.
Published: (2023)

Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
by: Briones, Laura Brandán, et al.
Published: (2025)

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
by: Akshay, S., et al.
Published: (2024)

TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version)
by: Manini, Andrea, et al.
Published: (2026)

Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption
by: Waga, Masaki, et al.
Published: (2024)

Robust Probabilistic Temporal Logics
by: Zimmermann, Martin
Published: (2023)

Formally Verified Linear-Time Invertible Lexing
by: Chassot, Samuel, et al.
Published: (2025)

Characterization of Isometric Words based on Swap and Mismatch Distance
by: Anselmo, M., et al.
Published: (2024)

Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains
by: Kim, Moon, et al.
Published: (2025)

All about unambiguous polynomial closure
by: Place, Thomas, et al.
Published: (2022)

Navigational hierarchies of regular languages
by: Place, Thomas, et al.
Published: (2024)

Dot-depth three, return of the J-class
by: Place, Thomas, et al.
Published: (2024)

Closure Properties of General Grammars -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2023)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
by: Maneth, Sebastian, et al.
Published: (2023)

Attributed Tree Transducers for Partial Functions
by: Maneth, Sebastian, et al.
Published: (2024)

Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond $\forall^*\exists^*$
by: Winter, Sarah, et al.
Published: (2025)

The Complexity of Generalized HyperLTL with Stuttering and Contexts
by: Regaud, Gaëtan, et al.
Published: (2025)

Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
by: Winter, Sarah, et al.
Published: (2024)

Logics for Context-free Hyperproperties
by: Winter, Sarah, et al.
Published: (2026)

Deciding Subtyping for Asynchronous Multiparty Sessions
by: Li, Elaine, et al.
Published: (2024)

Input-Driven Pushdown Automata with Translucent Input Letters
by: Kutrib, Martin, et al.
Published: (2025)

Binary codes that do not preserve primitivity
by: Holub, Štěpán, et al.
Published: (2022)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
by: Schwartz, Daniel G.
Published: (2025)

Cost Automata, Safe Schemes, and Downward Closures
by: Barozzini, David, et al.
Published: (2020)