On Abstraction of Probabilistic Systems (Q2937733): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PRISM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CEGAR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PRISM-games / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PASS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-45489-3_4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W29485814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magnifying-Lens Abstraction for Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative branching-time semantics for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of probabilistic and nondeterministic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample-guided abstraction-refinement framework for markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRISM-games: A Model Checker for Stochastic Multi-Player Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SMT-Based Bisimulation Minimisation of Markov Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quest for Minimal Quotients for Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using branching time temporal logic to synthesize synchronization skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Probabilistic Abstraction Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples in Probabilistic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about time and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding Window Abstraction for Infinite Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic CEGAR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Counterexamples for Discrete-Time Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-valued abstraction for probabilistic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game-based abstraction-refinement framework for Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry Reduction for Probabilistic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assume-Guarantee Verification for Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy Abstraction with Interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best Probabilistic Transformers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sigref – A Symbolic Bisimulation Tool Box / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Critical Subsystems for Discrete-Time Markov Models / rank
 
Normal rank

Latest revision as of 11:53, 9 July 2024

scientific article
Language Label Description Also known as
English
On Abstraction of Probabilistic Systems
scientific article

    Statements

    On Abstraction of Probabilistic Systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 January 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers