On the public citation graph
Learning Weighted Assumptions for Compositional Verification of Markov Decision Processes
0 signed · 72 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.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1007/11603009_15openalex-snapshot
Counterexamples for Timed Probabilistic Reachability
inferredcites →https://doi.org/10.1007/3-540-36577-x_24openalex-snapshot
Learning Assumptions for Compositional Verification
inferredcites →https://doi.org/10.1007/3-540-46419-0_27openalex-snapshot
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
inferredcites →https://doi.org/10.1007/3-540-48778-6openalex-snapshot
Formal Methods for Real-Time and Probabilistic Systems, 5th International AMAST Workshop, ARTS'99, Bamberg, Germany, May 26-28, 1999. Proceedings
inferredcites →https://doi.org/10.1007/3-540-48778-6_16openalex-snapshot
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
inferredcites →https://doi.org/10.1007/3-540-60454-5_41openalex-snapshot
Learning ordered binary decision diagrams
inferredcites →https://doi.org/10.1007/3-540-63165-8_199openalex-snapshot
Symbolic model checking for probabilistic processes
inferredcites →https://doi.org/10.1007/978-3-540-27819-1_9openalex-snapshot
Learning Classes of Probabilistic Automata
inferredcites →https://doi.org/10.1007/978-3-540-39813-4_26openalex-snapshot
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_14openalex-snapshot
Automated Assume-Guarantee Reasoning by Abstraction Refinement
inferredcites →https://doi.org/10.1007/978-3-540-71209-1_23openalex-snapshot
Refining Interface Alphabets for Compositional Verification
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_45openalex-snapshot
Automated Assumption Generation for Compositional Verification
inferredcites →https://doi.org/10.1007/978-3-642-00768-2_3openalex-snapshot
Learning Minimal Separating DFA’s for Compositional Verification
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_3openalex-snapshot
Assume-Guarantee Verification for Probabilistic Systems
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_32openalex-snapshot
libalf: The Automata Learning Framework
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_44openalex-snapshot
Automated Assume-Guarantee Reasoning through Implicit Learning
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-24372-1_40openalex-snapshot
Learning-Based Compositional Verification for Synchronous Probabilistic Systems
inferredcites →https://doi.org/10.1007/978-3-642-28756-5_21openalex-snapshot
Minimal Critical Subsystems for Discrete-Time Markov Models
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.1007/978-3-642-31424-7_25openalex-snapshot
Assume-Guarantee Abstraction Refinement for Probabilistic Systems
inferredcites →https://doi.org/10.1007/978-3-642-40196-1_4openalex-snapshot
High-Level Counterexamples for Probabilistic Automata
inferredcites →https://doi.org/10.1007/bf01211866openalex-snapshot
A logic for reasoning about time and reliability
inferredcites →https://doi.org/10.1007/s001650300007openalex-snapshot
Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol
inferredcites →https://doi.org/10.1007/s10009-004-0140-2openalex-snapshot
Probabilistic symbolic model checking with PRISM: a hybrid approach
inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot
Fast randomized consensus using shared memory
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/j.ic.2005.05.003openalex-snapshot
An efficient query learning algorithm for ordered binary decision diagrams
inferredcites →https://doi.org/10.1016/s0019-9958(86)80001-8openalex-snapshot
Probabilistic propositional temporal logics
inferredcites →https://doi.org/10.1016/s0020-0190(98)00038-6openalex-snapshot
On the verification of qualitative properties of probabilistic processes under fairness constraints
inferredcites →https://doi.org/10.1023/a:1008647823331openalex-snapshot
Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/fmcad.2009.5351134openalex-snapshot
Data mining based decomposition for assume-guarantee reasoning
inferredcites →https://doi.org/10.1109/iccd.1990.130209openalex-snapshot
A parallel algorithm for constructing binary decision diagrams
inferredcites →https://doi.org/10.1109/iccd.1993.393415openalex-snapshot
Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93
inferredcites →https://doi.org/10.1109/lics.2002.1029814openalex-snapshot
Tree-like counterexamples in model checking
inferredcites →https://doi.org/10.1109/lics.2012.54openalex-snapshot
Learning Probabilistic Systems from Tree Samples
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.2010.24openalex-snapshot
Compositional Verification of Probabilistic Systems Using Learning
inferredcites →https://doi.org/10.1109/qest.2011.21openalex-snapshot
Learning Probabilistic Automata for Model Checking
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1109/sfcs.1996.548494openalex-snapshot
On the applications of multiplicity automata in learning
inferredcites →https://doi.org/10.1109/tse.2009.5openalex-snapshot
Counterexample Generation in Probabilistic Model Checking
inferredcites →https://doi.org/10.1137/s009753979326091xopenalex-snapshot
Learning Behaviors of Automata from Multiplicity and Equivalence Queries
inferredcites →https://doi.org/10.1145/1838552.1838553openalex-snapshot
A counterexample-guided abstraction-refinement framework for markov decision processes
inferredcites →https://doi.org/10.1145/210332.210339openalex-snapshot
The complexity of probabilistic verification
inferredcites →https://doi.org/10.1145/2568225.2568253openalex-snapshot
Symbolic assume-guarantee reasoning through BDD learning
inferredcites →https://doi.org/10.1145/2676726.2676998openalex-snapshot
Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems
inferredcites →https://doi.org/10.1145/337244.337257openalex-snapshot
Learning functions represented as multiplicity automata
inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot
On the andvantages of free choice
inferredcites →https://doi.org/10.21236/ada461346openalex-snapshot
Model Checking of Probabilistic and Nondeterministic Systems
inferredcites →https://doi.org/10.4204/eptcs.103.6openalex-snapshot
Learning Markov Decision Processes for Model Checking
inferredcites →https://doi.org/10.48550/arxiv.1207.1373openalex-snapshot
Counterexample-guided Planning
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-00359-3_13openalex-snapshot
Toward Implicit Learning for the Compositional Verification of Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-96562-8_5openalex-snapshot
Active Automata Learning in Practice
inferred← citeshttps://doi.org/10.1007/s10515-022-00327-zopenalex-snapshot
A three-valued model abstraction framework for PCTL* stochastic model checking
inferred← citeshttps://doi.org/10.1007/s11334-018-0316-7openalex-snapshot
Learning-based symbolic assume-guarantee reasoning for Markov decision process by using interval Markov process
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102439openalex-snapshot
A framework for assume-guarantee regression verification of evolving software
inferred← citeshttps://doi.org/10.1109/access.2019.2924639openalex-snapshot
A Probabilistic Assume-Guarantee Reasoning Framework Based on Genetic Algorithm
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/sera.2019.8886798openalex-snapshot
Genetic Algorithm-Based Assume-Guarantee Reasoning for Stochastic Model Checking
inferred← citeshttps://doi.org/10.1109/sera.2019.8886808openalex-snapshot
Compositional Stochastic Model Checking Probabilistic Automata via Symmetric Assume-Guarantee Rule
inferred← citeshttps://doi.org/10.2991/aer.k.201203.029openalex-snapshot
Research and Implementation of Organic Cucumber Intelligent Greenhouse Monitoring System Based on NB-IoT and Raspberry Pi
inferred← citeshttps://doi.org/10.2991/ijndc.k.190918.001openalex-snapshot
Compositional Stochastic Model Checking Probabilistic Automata via Assume-guarantee Reasoning
inferred← citeshttps://doi.org/10.48550/arxiv.1701.06209openalex-snapshot
Counterexample-guided Abstraction Refinement for POMDPs
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.