Syntactic partial order compression for probabilistic reachability

DOI10.1007/978-3-030-11245-5_21MaRDI QIDQ2287108zbMATH OpenOpenAlexFDO

Authors Gereon Fox, Daniel Stan, Holger Hermanns

Publication date 23 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-11245-5_21

zbMATH Keywords

model checkingconcurrencyatomicitypartial order reductionstate space explosioninterleavings

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Processes, Terms and Cycles: Steps on the Road to Infinity
• scientific article; zbMATH DE number 1864589
• Compressing probabilistic Prolog programs
• Probabilistic termination: soundness, completeness, and compositionality
• Compositional abstraction techniques for probabilistic automata
• Partial order reduction for rewriting semantics of programming languages
• CONCUR 2003 - Concurrency Theory
• The satisfiability problem for probabilistic ordered branching programs
• scientific article; zbMATH DE number 1335882
• scientific article; zbMATH DE number 1863173

Cited in

(1)

• A theory of distributed Markov chains

This page was built for publication: Syntactic partial order compression for probabilistic reachability

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