( en | de | ru )

 

Disambiguation of "Bozzelli, Laura"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Temporal Equilibrium Logic.

, and . LICS, page 645-656. IEEE Computer Society, (2015)

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 Linke

 

Other publications of authors with the same name

Verification of Well-Formed Communicating Recursive State Machines, , and . (2005)On Decidability of LTL Model Checking for Process Rewrite Systems., , , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 248-259. Springer, (2006)Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages.. CONCUR, volume 4703 of Lecture Notes in Computer Science, page 476-491. Springer, (2007)The Complexity of CTL* + Linear Past.. FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 186-200. Springer, (2008)Hierarchical cost-parity games., , , and . Theor. Comput. Sci., (2020)Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling., , , , and . ICTCS, volume 1720 of CEUR Workshop Proceedings, page 49-61. CEUR-WS.org, (2016)Complexity and Succinctness Issues for Linear-Time Hybrid Logics., and . JELIA, volume 5293 of Lecture Notes in Computer Science, page 48-61. Springer, (2008)Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes., , , and . TIME, volume 206 of LIPIcs, page 9:1-9:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Automata-Theoretic Characterisations of Branching-Time Temporal Logics., , , and . ICALP, volume 297 of LIPIcs, page 128:1-128:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Verification of Well-Formed Communicating Recursive State Machines., , and . VMCAI, volume 3855 of Lecture Notes in Computer Science, page 412-426. Springer, (2006)