Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-07317-0_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W103774727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Birth of Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification: Theory and Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample-guided abstraction refinement for symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples in Probabilistic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Directed Search for Probabilistic Timed Reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Aspects of Computing - ICTAC 2004 / 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: Minimal Critical Subsystems for Discrete-Time Markov Models / 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: A linear process-algebraic format with data for probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic CEGAR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal methods for performance evaluation. 7th international school on formal methods for the design of computer, communication, and software systems, SFM 2007, Bertinoro, Italy, May 28 -- June 2, 2007. Advanced lectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining shorter regular expressions from finite-state automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causes and Explanations: A Structural-Model Approach. Part I: Causes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking for probabilistic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank

Latest revision as of 17:31, 9 July 2024

scientific article; zbMATH DE number 6408110
Language Label Description Also known as
English
Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey
scientific article; zbMATH DE number 6408110

    Statements

    Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 February 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
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references