Cover Image

Querying Labeled Time Series Data with Scenario Programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kim, Edward, Shanker, Devan, Bharadwaj, Varun, Park, Hongbeen, Kim, Jinkyu, Torfah, Hazem, Fremont, Daniel J, Seshia, Sanjit A
Format:	Preprint
Published:	2025
Subjects:	Artificial Intelligence Computer Vision and Pattern Recognition Formal Languages and Automata Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Querying Labeled Time Series Data with Scenario Programs
by: Shanker, Devan
Published: (2024)

Learning Formal Specifications from Membership and Preference Queries
by: Shah, Ameesh, et al.
Published: (2023)

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

Time for Timed Monitorability
by: Grosen, Thomas M., et al.
Published: (2025)

Compositional Automata Embeddings for Goal-Conditioned Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2024)

Provably Correct Automata Embeddings for Optimal Automata-Conditioned Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2025)

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

Query Learning of Advice and Nominal Automata
by: Zhou, Kevin
Published: (2024)

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

$L^*LM$: Learning Automata from Examples using Natural Language Oracles
by: Vazquez-Chanlatte, Marcell, 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)

Synthesizing Petri Nets from Labelled Petri Nets using Token Trail Regions
by: Bergenthum, Robin, et al.
Published: (2026)

Structural Abstraction and Refinement for Probabilistic Programs
by: Li, Guanyan, et al.
Published: (2025)

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

On the Complexity of Computing the Co-lexicographic Width of a Regular Language
by: Becker, Ruben, et al.
Published: (2024)

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

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

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

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

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

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)

Automata-Conditioned Cooperative Multi-Agent Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2025)

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)

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

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

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

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

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
by: Bergsträßer, Pascal, et al.
Published: (2024)

Alloy-Driven Verification of Object-Centric Event Data: From Temporal Logic to Knowledge Graphs
by: Latif, Saba, et al.
Published: (2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
by: Hausmann, Daniel, et al.
Published: (2024)

Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
by: Stan, Daniel, et al.
Published: (2026)

Benchmarking Testing in Automated Theorem Proving
by: Kim, Jongyoon, et al.
Published: (2026)

Refuting Equivalence in Probabilistic Programs with Conditioning
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Equivalence and Similarity Refutation for Probabilistic Programs
by: Chatterjee, Krishnendu, et al.
Published: (2024)

PDFA Distillation via String Probability Queries
by: Baumgartner, Robert, et al.
Published: (2024)

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
by: Geißler, Dominik, et al.
Published: (2025)