Q5009450 (Q5009450): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.CONCUR.2018.32 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4673428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Satisfiability for PCTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Satisfiability of Some Simple Probabilistic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of probabilistic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005. 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24--26, 2005. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Probabilistic Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / 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: Probabilistic propositional temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the universal and existential fragments of the \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite model theorem for the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Microcomputer technique. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Chains / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.CONCUR.2018.32 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:36, 30 December 2024

scientific article; zbMATH DE number 7378576
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7378576

    Statements

    0 references
    0 references
    4 August 2021
    0 references
    temporal logic
    0 references
    probabilistic verification
    0 references
    probabilistic computation tree logic
    0 references
    satisfiability
    0 references

    Identifiers