Testing membership for timed automata
From MaRDI portal
Publication:6090987
DOI10.1007/s00236-023-00442-8arXiv1912.08277OpenAlexW2994801311MaRDI QIDQ6090987
Michel de Rougemont, Richard Lassaigne
Publication date: 21 November 2023
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.08277
Cites Work
- Unnamed Item
- Factorization forests of finite height
- Robust safety of timed automata
- Self-testing/correcting with applications to numerical problems
- A theory of timed automata
- Distance on timed words and applications
- Dynamical properties of timed automata
- Entropy of regular timed languages
- Property testing of regular tree languages
- Regular Languages are Testable with a Constant Number of Queries
- Edit distance for timed automata
- Approximate Satisfiability and Equivalence
- Property testing and its connection to learning and approximation
- Robust Reachability in Timed Automata: A Game-Based Approach
- Random sampling with a reservoir
- Probabilistic checking of proofs
- Designing programs that check their work
- The String-to-String Correction Problem
- Robust Characterizations of Polynomials with Applications to Program Testing
- Formal Methods for the Design of Real-Time Systems
- On Context-Free Languages
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
