Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes - Archive ouverte HAL Access content directly
Journal Articles Acta Informatica Year : 2017

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

(1) , (1) , (2) , (3)
1
2
3
Aaron Bohy
  • Function : Author
Université de Mons
Véronique Bruyère
  • Function : Author
  • PersonId : 941082
Université de Mons
Jean-François Raskin
  • Function : Author
  • PersonId : 871816
Université libre de Bruxelles
Nathalie Bertrand
  • Function : Author
  • PersonId : 838273
SUpervision of large MOdular and distributed systems

Domains

Computer Science [cs]

Nathalie Bertrand  : Connect in order to contact the contributor

https://hal.inria.fr/hal-01635132

Submitted on : Wednesday, November 15, 2017-4:56:22 PM

Last modification on : Friday, August 5, 2022-2:54:52 PM

Not file

Dates and versions

hal-01635132 , version 1 (15-11-2017)

Identifiers

Cite

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, 2017, 54 (6), pp.545 - 587. ⟨10.1007/s00236-016-0255-4⟩. ⟨hal-01635132⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

UNIV-RENNES1 CNRS INRIA INSA-RENNES IRISA CENTRALESUPELEC INRIA2 UR1-MATH-STIC UR1-UFR-ISTIC UNIV-RENNES UR1-MATH-NUM
191 View
1 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More