scientific article; zbMATH DE number 3982496

MaRDI QIDQ3746869zbMATH OpenFDO

Authors Louis E. Rosier, Hsu-Chun Yen

Publication date 1986

zbMATH Keywords

complexity boundsconcurrencyfair termination problemfairness constraintsmodellingprobabilistic concurrent finite-state programs

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• Probabilistic termination versus fair termination
• Concurrent Probabilistic Programs, Or: How to Schedule If You Must
• Probabilistic verification
• Fair termination for parameterized probabilistic concurrent systems

Cited in

(7)

• Probabilistic Ianov's schemes
• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• Probabilistic termination versus fair termination
• Fair termination for parameterized probabilistic concurrent systems
• Concurrent Probabilistic Programs, Or: How to Schedule If You Must
• Global and local views of state fairness

This page was built for publication:

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