PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Fioriti, Luis María Ferrer"

Author of the publication

copydeleteadd this publication to your clipboard
MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata.

, , , , , and . QAPL, volume 154 of EPTCS, page 48-63. (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Claudia Marianowski University of Stuttgart

Luis Orozco University of Stuttgart

Luis Mandl University of Stuttgart

apl. Prof. Dr. Maria Fyta University of Stuttgart

Maria Papadimitraki University of Stuttgart

 

Other publications of authors with the same name

Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms., , and . Theor. Comput. Sci., (2014)Variable Probabilistic Abstraction Refinement., , , and . ATVA, volume 7561 of Lecture Notes in Computer Science, page 300-316. Springer, (2012)Heuristics for Probabilistic Timed Automata with Abstraction Refinement., and . MMB/DFT, volume 7201 of Lecture Notes in Computer Science, page 151-165. Springer, (2012)MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata., , , , , and . QAPL, volume 154 of EPTCS, page 48-63. (2014)Synthesizing Probabilistic Invariants via Doob's Decomposition., , , and . CAV (1), volume 9779 of Lecture Notes in Computer Science, page 43-61. Springer, (2016)Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers., , and . CONCUR, volume 5710 of Lecture Notes in Computer Science, page 338-353. Springer, (2009)Abstraction-Based Computation of Reward Measures for Markov Automata., , , , , and . VMCAI, volume 8931 of Lecture Notes in Computer Science, page 172-189. Springer, (2015)Probabilistic Termination: Soundness, Completeness, and Compositionality., and . POPL, page 489-501. ACM, (2015)Deciding probabilistic automata weak bisimulation: theory and practice., , , and . Formal Asp. Comput., 28 (1): 109-143 (2016)Probabilistic CTL*: The Deductive Way., , , and . TACAS, volume 9636 of Lecture Notes in Computer Science, page 280-296. Springer, (2016)