The efficiency of identifying timed automata and the power of clocks
From MaRDI portal
Publication:553334
DOI10.1016/J.IC.2010.11.023zbMATH Open1217.68134OpenAlexW2170987619MaRDI QIDQ553334FDOQ553334
Authors: Mathijs M. de Weerdt, Cees Witteveen, Sicco Verwer 
Publication date: 27 July 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://resolver.tudelft.nl/uuid:1b229891-aed4-4def-b022-c4dab1b94b08
Recommendations
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
- Detecting quasi-equal clocks in timed automata
- The power of reachability testing for timed automata
- Synthesizing Clock-Efficient Timed Automata
- The timestamp of timed automata
- scientific article; zbMATH DE number 3480493
- The Power of Proofs: New Algorithms for Timed Automata Model Checking
- Event-clock automata: a determinizable class of timed automata
- On clock-aware LTL properties of timed automata
- scientific article; zbMATH DE number 7559498
Cites Work
- Uppaal in a nutshell
- A theory of timed automata
- Language identification in the limit
- Title not available (Why is that?)
- Minimal NFA Problems are Hard
- Teaching a smarter learner.
- Complexity of automaton identification from given data
- Characteristic sets for polynomial grammatical inference
- Event-clock automata: a determinizable class of timed automata
- Timed regular expressions
- Inference of Event-Recording Automata Using Timed Decision Trees
- CONCUR 2004 - Concurrency Theory
- On polynomial-time learnability in the limit of strictly deterministic automata
Cited In (10)
- Learning one-clock timed automata
- Efficiently identifying deterministic real-time automata from labeled data
- Active learning of one-clock timed automata using constraint solving
- Inferring switched nonlinear dynamical systems
- Title not available (Why is that?)
- Equivalence checking and intersection of deterministic timed finite state machines
- Polynomial Distinguishability of Timed Automata
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
- A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data
- Biased clocks: a novel approach to improve the ability to perform predicate detection with \(O(1)\) clocks
Uses Software
This page was built for publication: The efficiency of identifying timed automata and the power of clocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553334)
