P^5: planner-less proofs of probabilistic parameterized protocols

DOI10.1007/978-3-319-73721-8_16zbMATH Open1446.68107OpenAlexW2780317961MaRDI QIDQ3296338FDOQ3296338

Authors: Lenore D. Zuck, K. L. McMillan, Jordan N. Torf 

Publication date: 7 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-73721-8_16

Recommendations

• scientific article; zbMATH DE number 1956507
• Liveness of randomised parameterised systems under arbitrary schedulers
• An inductive technique for parameterised model checking of degenerative distributed randomised protocols
• Model checking and abstraction to the aid of parameterized systems (a survey)
• Fair termination for parameterized probabilistic concurrent systems

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (3)

• Liveness of randomised parameterised systems under arbitrary schedulers
• An inductive technique for parameterised model checking of degenerative distributed randomised protocols
• Title not available (Why is that?)

This page was built for publication: \(P^5\): planner-less proofs of probabilistic parameterized protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296338)