Learning deterministic probabilistic automata from a model checking perspective
From MaRDI portal
Publication:1689574
DOI10.1007/s10994-016-5565-9zbMath1454.68061OpenAlexW2406438973MaRDI QIDQ1689574
Yingke Chen, Manfred Jaeger, Kim Guldstrand Larsen, Hua Mao, Brian Nielsen, Thomas D. Nielsen
Publication date: 12 January 2018
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-016-5565-9
Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (7)
Learning from positive and negative examples: dichotomies and parameterized algorithms ⋮ Active model learning of stochastic reactive systems ⋮ Learning from positive and negative examples: new proof for binary alphabets ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ \(L^\ast\)-based learning of Markov decision processes (extended version) ⋮ Probabilistic black-box reachability checking (extended version) ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The power of amnesia: Learning probabilistic automata with variable memory length
- Learning regular sets from queries and counterexamples
- Learning probabilistic automata and Markov chains via queries
- On the learnability and usage of acyclic probabilistic finite automata
- Learning deterministic probabilistic automata from a model checking perspective
- A behavioural pseudometric for probabilistic transition systems
- Learning Probabilistic Systems from Tree Samples
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
- Learning-Based Compositional Verification for Synchronous Probabilistic Systems
- Model Checking One-clock Priced Timed Automata
- Learning Meets Verification
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- From timed automata to logic — and back
- Learning I/O Automata
- Learning deterministic regular grammars from stochastic samples in polynomial time
- The complexity of probabilistic verification
- Mining specifications
- Computer Aided Verification
- Grammatical Inference: Algorithms and Applications
- Probabilistic automata
- Inference of Event-Recording Automata Using Timed Decision Trees
- SOME SIMPLE APPROXIMATE TESTS FOR POISSON VARIATES
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Learning deterministic probabilistic automata from a model checking perspective
