Learning deterministic probabilistic automata from a model checking perspective
type: Item
instance of: scholarly article
title: Learning deterministic probabilistic automata from a model checking perspective
zbMATH Open document ID: 1454.68061
author: Hua Mao
author: Yingke Chen
author: Manfred Jaeger
author: Thomas D. Nielsen
author: Kim G. Larsen
author: Brian Nielsen
published in: Machine Learning
publication date: 2018-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6825554
zbMATH Keywords: probabilistic model checking
zbMATH Keywords: probabilistic automata learning
zbMATH Keywords: linear-time temporal logic
describes a project that uses: Uppaal
describes a project that uses: APMC
describes a project that uses: LearnLib
describes a project that uses: PRISM
MaRDI profile type: Publication
full work available at URL: s10994-016-5565-9
OpenAlex ID: W2406438973
cites work: Learning I/O Automata
cites work: Mining specifications
cites work: Learning regular sets from queries and counterexamples
cites work: Q5322945
cites work: Q2754096
cites work: Model Checking One-clock Priced Timed Automata
cites work: Learning deterministic regular grammars from stochastic samples in polynomial time
cites work: Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
cites work: Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
cites work: Inference of timed transition systems
cites work: Q3093192
cites work: Q4417936
cites work: The complexity of probabilistic verification
cites work: SOME SIMPLE APPROXIMATE TESTS FOR POISSON VARIATES
cites work: Grammatical Inference: Algorithms and Applications
cites work: Q2754009
cites work: Q4270063
cites work: Learning-Based Compositional Verification for Synchronous Probabilistic Systems
cites work: Inference of Event-Recording Automata Using Timed Decision Trees
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Q3404129
cites work: Learning Probabilistic Systems from Tree Samples
cites work: From timed automata to logic — and back
cites work: Learning Meets Verification
cites work: A behavioural pseudometric for probabilistic transition systems
cites work: Probabilistic automata
cites work: The power of amnesia: Learning probabilistic automata with variable memory length
cites work: On the learnability and usage of acyclic probabilistic finite automata
cites work: Computer Aided Verification
cites work: Learning probabilistic automata and Markov chains via queries
DOI: 10.1007/S10994-016-5565-9
description: scientific article; zbMATH DE number 6825554