Learning deterministic probabilistic automata from a model checking perspective
From MaRDI portal
Publication:1689574
Recommendations
Cites work
- A behavioural pseudometric for probabilistic transition systems
- Computer Aided Verification
- From timed automata to logic -- and back
- Grammatical Inference: Algorithms and Applications
- Grammatical inference. Learning automata and grammars.
- scientific article; zbMATH DE number 1670719 (Why is no real title available?)
- scientific article; zbMATH DE number 1670788 (Why is no real title available?)
- scientific article; zbMATH DE number 5957212 (Why is no real title available?)
- scientific article; zbMATH DE number 1361128 (Why is no real title available?)
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Inference of Event-Recording Automata Using Timed Decision Trees
- Inference of timed transition systems
- Learning deterministic probabilistic automata from a model checking perspective
- Learning deterministic regular grammars from stochastic samples in polynomial time
- Learning I/O automata
- Learning Meets Verification
- Learning probabilistic automata and Markov chains via queries
- Learning probabilistic systems from tree samples
- Learning regular sets from queries and counterexamples
- Learning-based compositional verification for synchronous probabilistic systems
- Mining specifications
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
- Model Checking One-clock Priced Timed Automata
- On the learnability and usage of acyclic probabilistic finite automata
- Probabilistic automata
- SOME SIMPLE APPROXIMATE TESTS FOR POISSON VARIATES
- The complexity of probabilistic verification
- The power of amnesia: Learning probabilistic automata with variable memory length
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- Verification, Model Checking, and Abstract Interpretation
Cited in
(27)- On the learnability and usage of acyclic probabilistic finite automata
- Learning deterministic probabilistic automata from a model checking perspective
- Learning probabilistic automata: a study in state distinguishability
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Probabilistic black-box reachability checking (extended version)
- Learning probabilistic automata using residuals
- Learning from positive and negative examples: dichotomies and parameterized algorithms
- Time to learn -- learning timed automata from tests
- Global PAC bounds for learning discrete time Markov chains
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- Learning probabilistic systems from tree samples
- scientific article; zbMATH DE number 5957212 (Why is no real title available?)
- Verification of Markov decision processes using learning algorithms
- Learning Meets Verification
- A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- Probably approximately correct learning of regulatory networks from time-series data
- Algorithmic Learning Theory
- Learning Algorithms and Formal Verification (Invited Tutorial)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Active model learning of stochastic reactive systems
- Learning from positive and negative examples: new proof for binary alphabets
- From languages to behaviors and back
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- L^*-based learning of Markov decision processes
- Regular decision processes
This page was built for publication: Learning deterministic probabilistic automata from a model checking perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689574)
