( en | de | ru )

 

Disambiguation of "Bozzelli, Laura"

Author of the publication

copydeleteadd this publication to your clipboard
Hierarchical cost-parity games.

, , , and . Theor. Comput. Sci., (2020)

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.

Mario Laura

Marco Laurati

Laura Dreiner

Anatomisch-histologische Variationen des Labrum glenoidale bei erwachsenen Hunden verschiedener Rassen im Vergleich zum jungen Beagle unter besonderer Berücksichtigung des Kollagenfaserverlaufs. Uni Gießen, (2009)

Laura Oberlin

Behandlung von Pankreaskarzinomzelllinien in vitro und in vivo mit einem monoklonalen Antikörper gegen den Transferrinrezeptor. Uni Gießen, (2009)

Laura Polen

 

Other publications of authors with the same name

Foundations of Boolean stream runtime verification., and . Theor. Comput. Sci., (2016)Model checking for process rewrite systems and a class of action-based regular properties.. Theor. Comput. Sci., 360 (1-3): 352-372 (2006)Timed context-free temporal logics (extended version)., , and . CoRR, (2018)Verification of Well-Formed Communicating Recursive State Machines., , and . VMCAI, volume 3855 of Lecture Notes in Computer Science, page 412-426. Springer, (2006)Complexity analysis of a unifying algorithm for model checking interval temporal logic., , and . Inf. Comput., (2021)Decidability and Complexity of Timeline-Based Planning over Dense Temporal Domains., , , and . KR, page 627-628. AAAI Press, (2018)A Quantitative Extension of Interval Temporal Logic over Infinite Words., and . TIME, volume 247 of LIPIcs, page 11:1-11:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains., , and . FSTTCS, volume 150 of LIPIcs, page 34:1-34:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Visibly Rational Expressions., and . FSTTCS, volume 18 of LIPIcs, page 211-223. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)On the Complexity of ATL and ATL* Module Checking., and . GandALF, volume 256 of EPTCS, page 268-282. (2017)