Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logics for the specification of performance and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming as a Discipline of Mathematical Nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / 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 models for the guarded command language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving time bounds for randomized distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of multiprocess probabilistic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Probabilistic Programs / rank
 
Normal rank

Latest revision as of 11:50, 4 June 2024

scientific article
Language Label Description Also known as
English
Quantitative program logic and expected time bounds in probabilistic distributed algorithms.
scientific article

    Statements