On the public citation graph
Active Learning of Markov Decision Processes for System Verification
0 signed · 38 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-58473-0_144openalex-snapshot
Learning stochastic regular grammars by means of a state merging method
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-3-642-21455-4_8openalex-snapshot
Introduction to Active Automata Learning from a Practical Perspective
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_47openalex-snapshot
PRISM 4.0: Verification of Probabilistic Real-Time Systems
inferredcites →https://doi.org/10.1007/978-3-642-28891-3_22openalex-snapshot
Learning Markov Models for Stationary System Behaviors
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1109/memcod.2004.1459815openalex-snapshot
PROBMELA: a modeling language for communicating probabilistic processes
inferredcites →https://doi.org/10.1109/qest.2004.1348029openalex-snapshot
Learning continuous time Markov chains from sample executions
inferredcites →https://doi.org/10.1109/qest.2004.22openalex-snapshot
Supporting Dynamic Crosscutting with Partial Behavioral Reflection: A Case Study
inferredcites →https://doi.org/10.1109/qest.2011.21openalex-snapshot
Learning Probabilistic Automata for Model Checking
inferredcites →https://doi.org/10.1145/1102351.1102353openalex-snapshot
Active learning for Hidden Markov Models
inferredcites →https://doi.org/10.4204/eptcs.103.6openalex-snapshot
Learning Markov Decision Processes for Model Checking
inferredcites →https://doi.org/10.5555/1046920.1194900openalex-snapshot
Active Coevolutionary Learning of Deterministic Finite Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-30281-8_6openalex-snapshot
Bayes-Adaptive Planning for Data-Efficient Verification of Uncertain Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_38openalex-snapshot
$$L^*$$-Based Learning of Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_27openalex-snapshot
Active Model Learning of Stochastic Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-68738-9_35openalex-snapshot
Neuro-Symbolic Artificial Intelligence for Safety Engineering
inferred← citeshttps://doi.org/10.1007/978-3-319-43425-4_3openalex-snapshot
Data-Efficient Bayesian Verification of Parametric Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-319-66335-7_16openalex-snapshot
Automated Experiment Design for Data-Efficient Verification of Parametric Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-67531-2_4openalex-snapshot
Probabilistic Black-Box Reachability Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-68690-5_23openalex-snapshot
Improving Probability Estimation Through Active Probabilistic Model Learning
inferred← citeshttps://doi.org/10.1007/s00165-021-00536-5openalex-snapshot
L∗-based learning of Markov decision processes (extended version)
inferred← citeshttps://doi.org/10.1007/s10270-024-01158-0openalex-snapshot
Active model learning of stochastic reactive systems (extended version)
inferred← citeshttps://doi.org/10.1007/s10703-019-00333-0openalex-snapshot
Probabilistic black-box reachability checking (extended version)
inferred← citeshttps://doi.org/10.1007/s10994-016-5565-9openalex-snapshot
Learning deterministic probabilistic automata from a model checking perspective
inferred← citeshttps://doi.org/10.1007/s11334-022-00449-3openalex-snapshot
AALpy: an active automata learning library
inferred← citeshttps://doi.org/10.1016/j.automatica.2017.01.037openalex-snapshot
Data-driven and model-based verification via Bayesian identification and reachability analysis
inferred← citeshttps://doi.org/10.1109/acc.2015.7170994openalex-snapshot
Data-driven property verification of grey-box systems by bayesian experiment design
inferred← citeshttps://doi.org/10.1109/access.2020.3000907openalex-snapshot
Survey on Learning-Based Formal Methods: Taxonomy, Applications and Possible Future Directions
inferred← citeshttps://doi.org/10.1109/icmla52953.2021.00195openalex-snapshot
Active Learning of Markov Decision Processes using Baum-Welch algorithm
inferred← citeshttps://doi.org/10.1109/qrs.2015.40openalex-snapshot
An Effective Approach to Continuous User Authentication for Touch Screen Smart Devices
inferred← citeshttps://doi.org/10.23919/acc50511.2021.9482889openalex-snapshot
Adaptive Shielding under Uncertainty
inferred← citeshttps://doi.org/10.48550/arxiv.2110.03014openalex-snapshot
Active Learning of Markov Decision Processes using Baum-Welch algorithm (Extended)
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.