On the complexity of deciding fair termination of probabilistic concurrent finite-state programs

From MaRDI portal

(Redirected from On the complexity of deciding fair termination of probabilistic concurrent finite-state programs)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_the_complexity_of_deciding_fair_termination_of_probabilistic_concurrent_finite-state_programs&oldid=66688629"