Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes

Aaron Bohy 1 Véronique Bruyère 1 Jean-François Raskin 2 Nathalie Bertrand 3
1 UMons - Université de Mons
2 ULB - Université Libre de Bruxelles [Bruxelles]
3 SUMO - SUpervision of large MOdular and distributed systems
Inria Rennes – Bretagne Atlantique , IRISA_D4 - LANGAGE ET GÉNIE LOGICIEL
Document type :
Journal articles
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download
https://hal.inria.fr/hal-01635132
Contributor : Nathalie Bertrand <>
Submitted on : Wednesday, November 15, 2017 - 4:56:22 PM
Last modification on : Tuesday, February 12, 2019 - 12:06:03 PM

Identifiers

Collections

UNIV-RENNES1 | INRIA | IRISA | INRIA2017 | UR1-UFR-ISTIC | UNIV-RENNES | CENTRALESUPELEC

Citation

Aaron Bohy, Véronique Bruyère, Jean-François Raskin, Nathalie Bertrand. Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. Acta Informatica, Springer Verlag, 2017, 54 (6), pp.545 - 587. ⟨10.1007/s00236-016-0255-4⟩. ⟨hal-01635132⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

355

Contact


archive-ouverte@inria.fr