Liveness of Randomised Parameterised Systems under Arbitrary Schedulers

DOI10.1007/978-3-319-41540-6_7zbMath1411.68075arXiv1606.01451OpenAlexW2478824155MaRDI QIDQ4633552

Philipp Rümmer, Anthony Widjaja Lin

Publication date: 3 May 2019

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.01451

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Learning probabilistic termination proofs, Learning union of integer hypercubes with queries (with applications to monadic decomposition), Regular model checking revisited, Unnamed Item, Fair Termination for Parameterized Probabilistic Concurrent Systems, The complexity of verifying population protocols