Cover Image

Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hebballi, Chirantan, Poptani, Akash, Benny, Amrutha, Kalayappan, Rajshekar, Chandran, Sandeep, Phawade, Ramchandra
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science Formal Languages and Automata Theory F.1.1; I.2.4; C.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parameterized Verification of Disjunctive Timed Networks
by: André, Étienne, et al.
Published: (2023)

Verification of Unbounded Client-Server Systems with Distinguishable Clients
by: Phawade, Ramchandra, et al.
Published: (2026)

Neuro-Symbolic Predictive Process Monitoring
by: Mezini, Axel, et al.
Published: (2025)

Computational methods for Dynamic Answer Set Programming
by: Hahn, Susana
Published: (2025)

GOL in GOL in HOL: Verified Circuits in Conway's Game of Life
by: Myreen, Magnus O., et al.
Published: (2025)

Complex Event Recognition with Symbolic Register Transducers: Extended Technical Report
by: Alevizos, Elias, et al.
Published: (2024)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
by: Lin, Deren, et al.
Published: (2014)

Beyond Winning Strategies: Admissible and Admissible Winning Strategies for Quantitative Reachability Games
by: Muvvala, Karan, et al.
Published: (2024)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
by: Grabmayer, Clemens
Published: (2024)

Model-bounded monitoring of hybrid systems
by: Waga, Masaki, et al.
Published: (2021)

Inquisitive Team Semantics of LTL
by: Bozzelli, Laura, et al.
Published: (2025)

A Layered Implementation Framework for Regular Languages
by: Charlier, Baudouin Le
Published: (2025)

Bounded Model Checking for Unbounded Client Server Systems
by: Phawade, Ramchandra, et al.
Published: (2022)

Parameterized Verification of Timed Networks with Clock Invariants
by: André, Étienne, et al.
Published: (2024)

Orbit-finite linear programming
by: Ghosh, Arka, et al.
Published: (2023)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
by: Grabolle, Gustav
Published: (2022)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)

RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Lookarounds
by: Varatalu, Ian Erik, et al.
Published: (2024)

Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025)

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
by: Bobrow, Elliot, et al.
Published: (2025)

Equivariant ideals of polynomials
by: Ghosh, Arka, et al.
Published: (2024)

Quantitative Assurance and Synthesis of Controllers from Activity Diagrams
by: Ye, Kangfeng, et al.
Published: (2024)

CBCL: Safe Self-Extending Agent Communication
by: O'Connor, Hugo
Published: (2026)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)

LTL-Constrained Policy Optimization with Cycle Experience Replay
by: Shah, Ameesh, et al.
Published: (2024)

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
by: Geatti, Luca, et al.
Published: (2024)

Learning Deterministic One-Counter Automata in Polynomial Time
by: Mathew, Prince, et al.
Published: (2025)

A Theory of Hanoi Omega-Automata and Games
by: Filiot, Emmanuel, et al.
Published: (2026)

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

Openness And Partial Adjacency In One Variable TPTL
by: Krishna, Shankara Narayanan, et al.
Published: (2024)

Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)
by: Bollig, Benedikt
Published: (2026)

Tight Verification of Probabilistic Robustness in Bayesian Neural Networks
by: Batten, Ben, et al.
Published: (2024)

Real-Time Model Checking for Closed-Loop Robot Reactive Planning
by: Chandler, Christopher, et al.
Published: (2025)

Runtime Consultants
by: Fisman, Dana, et al.
Published: (2025)

Rabin Games and Colourful Universal Trees
by: Majumdar, Rupak, et al.
Published: (2024)

A LOCAL View of the Polynomial Hierarchy
by: Reiter, Fabian
Published: (2023)

Introducing Divergence for Infinite Probabilistic Models
by: Finkel, Alain, et al.
Published: (2023)

Stratifiable formulae are not context-free
by: Ryan-Smith, Calliope
Published: (2023)