Published in: LIPIcs, Volume 323, 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)
Alberto Bombardelli, Laura Bozzelli, César Sánchez, and Stefano Tonetta. Unifying Asynchronous Logics for Hyperproperties. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bombardelli_et_al:LIPIcs.FSTTCS.2024.14, author = {Bombardelli, Alberto and Bozzelli, Laura and S\'{a}nchez, C\'{e}sar and Tonetta, Stefano}, title = {{Unifying Asynchronous Logics for Hyperproperties}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.14}, URN = {urn:nbn:de:0030-drops-222034}, doi = {10.4230/LIPIcs.FSTTCS.2024.14}, annote = {Keywords: Asynchronous hyperproperties, Temporal logics for hyperproperties, Expressiveness, Decidability, Model checking} }
Published in: LIPIcs, Volume 318, 31st International Symposium on Temporal Representation and Reasoning (TIME 2024)
Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, and Adriano Peron. Full Characterisation of Extended CTL*. In 31st International Symposium on Temporal Representation and Reasoning (TIME 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 318, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{benerecetti_et_al:LIPIcs.TIME.2024.18, author = {Benerecetti, Massimo and Bozzelli, Laura and Mogavero, Fabio and Peron, Adriano}, title = {{Full Characterisation of Extended CTL*}}, booktitle = {31st International Symposium on Temporal Representation and Reasoning (TIME 2024)}, pages = {18:1--18:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-349-2}, ISSN = {1868-8969}, year = {2024}, volume = {318}, editor = {Sala, Pietro and Sioutis, Michael and Wang, Fusheng}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2024.18}, URN = {urn:nbn:de:0030-drops-212259}, doi = {10.4230/LIPIcs.TIME.2024.18}, annote = {Keywords: Branching-Time Temporal Logics, Monadic Chain Logic, Tree Automata} }
Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, and Adriano Peron. Automata-Theoretic Characterisations of Branching-Time Temporal Logics. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 128:1-128:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{benerecetti_et_al:LIPIcs.ICALP.2024.128, author = {Benerecetti, Massimo and Bozzelli, Laura and Mogavero, Fabio and Peron, Adriano}, title = {{Automata-Theoretic Characterisations of Branching-Time Temporal Logics}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {128:1--128:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.128}, URN = {urn:nbn:de:0030-drops-202716}, doi = {10.4230/LIPIcs.ICALP.2024.128}, annote = {Keywords: Branching-Time Temporal Logics, Monadic Second-Order Logics, Tree Automata} }
Published in: LIPIcs, Volume 247, 29th International Symposium on Temporal Representation and Reasoning (TIME 2022)
Laura Bozzelli and Adriano Peron. A Quantitative Extension of Interval Temporal Logic over Infinite Words. In 29th International Symposium on Temporal Representation and Reasoning (TIME 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 247, pp. 11:1-11:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bozzelli_et_al:LIPIcs.TIME.2022.11, author = {Bozzelli, Laura and Peron, Adriano}, title = {{A Quantitative Extension of Interval Temporal Logic over Infinite Words}}, booktitle = {29th International Symposium on Temporal Representation and Reasoning (TIME 2022)}, pages = {11:1--11:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-262-4}, ISSN = {1868-8969}, year = {2022}, volume = {247}, editor = {Artikis, Alexander and Posenato, Roberto and Tonetta, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2022.11}, URN = {urn:nbn:de:0030-drops-172585}, doi = {10.4230/LIPIcs.TIME.2022.11}, annote = {Keywords: Interval temporal logic, Homogeneity Assumption, Quantitative Constraints, Model checking, Decision Procedures, Complexity issues, Linear-time Hybrid Logics} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Laura Bozzelli, Adriano Peron, and César Sánchez. Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bozzelli_et_al:LIPIcs.CONCUR.2022.27, author = {Bozzelli, Laura and Peron, Adriano and S\'{a}nchez, C\'{e}sar}, title = {{Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.27}, URN = {urn:nbn:de:0030-drops-170905}, doi = {10.4230/LIPIcs.CONCUR.2022.27}, annote = {Keywords: Hyperproperties, Asynchronous hyperproperties, Temporal logics for hyperproperties, Expressiveness, Decidability, Model checking} }
Published in: LIPIcs, Volume 206, 28th International Symposium on Temporal Representation and Reasoning (TIME 2021)
Laura Bozzelli, Angelo Montanari, Adriano Peron, and Pietro Sala. Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes. In 28th International Symposium on Temporal Representation and Reasoning (TIME 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 206, pp. 9:1-9:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bozzelli_et_al:LIPIcs.TIME.2021.9, author = {Bozzelli, Laura and Montanari, Angelo and Peron, Adriano and Sala, Pietro}, title = {{Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes}}, booktitle = {28th International Symposium on Temporal Representation and Reasoning (TIME 2021)}, pages = {9:1--9:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-206-8}, ISSN = {1868-8969}, year = {2021}, volume = {206}, editor = {Combi, Carlo and Eder, Johann and Reynolds, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2021.9}, URN = {urn:nbn:de:0030-drops-147853}, doi = {10.4230/LIPIcs.TIME.2021.9}, annote = {Keywords: Interval temporal logic, Satisfiability, Model checking} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Laura Bozzelli, Angelo Montanari, Adriano Peron, and Pietro Sala. On a Temporal Logic of Prefixes and Infixes. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bozzelli_et_al:LIPIcs.MFCS.2020.21, author = {Bozzelli, Laura and Montanari, Angelo and Peron, Adriano and Sala, Pietro}, title = {{On a Temporal Logic of Prefixes and Infixes}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.21}, URN = {urn:nbn:de:0030-drops-126898}, doi = {10.4230/LIPIcs.MFCS.2020.21}, annote = {Keywords: Interval Temporal Logic, Star-Free Regular Languages, Satisfiability, Complexity} }
Published in: LIPIcs, Volume 150, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)
Laura Bozzelli, Angelo Montanari, and Adriano Peron. Interval Temporal Logic for Visibly Pushdown Systems. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 150, pp. 33:1-33:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bozzelli_et_al:LIPIcs.FSTTCS.2019.33, author = {Bozzelli, Laura and Montanari, Angelo and Peron, Adriano}, title = {{Interval Temporal Logic for Visibly Pushdown Systems}}, booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-131-3}, ISSN = {1868-8969}, year = {2019}, volume = {150}, editor = {Chattopadhyay, Arkadev and Gastin, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.33}, URN = {urn:nbn:de:0030-drops-115959}, doi = {10.4230/LIPIcs.FSTTCS.2019.33}, annote = {Keywords: Pushdown systems, Interval temporal logic, Model checking} }
Published in: LIPIcs, Volume 150, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)
Laura Bozzelli, Angelo Montanari, and Adriano Peron. Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 150, pp. 34:1-34:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bozzelli_et_al:LIPIcs.FSTTCS.2019.34, author = {Bozzelli, Laura and Montanari, Angelo and Peron, Adriano}, title = {{Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains}}, booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-131-3}, ISSN = {1868-8969}, year = {2019}, volume = {150}, editor = {Chattopadhyay, Arkadev and Gastin, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.34}, URN = {urn:nbn:de:0030-drops-115963}, doi = {10.4230/LIPIcs.FSTTCS.2019.34}, annote = {Keywords: Timeline-based planning, timed automata, event-clock automata} }
Published in: LIPIcs, Volume 147, 26th International Symposium on Temporal Representation and Reasoning (TIME 2019)
Laura Bozzelli, Angelo Montanari, and Adriano Peron. Complexity Analysis of a Unifying Algorithm for Model Checking Interval Temporal Logic. In 26th International Symposium on Temporal Representation and Reasoning (TIME 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 147, pp. 18:1-18:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bozzelli_et_al:LIPIcs.TIME.2019.18, author = {Bozzelli, Laura and Montanari, Angelo and Peron, Adriano}, title = {{Complexity Analysis of a Unifying Algorithm for Model Checking Interval Temporal Logic}}, booktitle = {26th International Symposium on Temporal Representation and Reasoning (TIME 2019)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-127-6}, ISSN = {1868-8969}, year = {2019}, volume = {147}, editor = {Gamper, Johann and Pinchinat, Sophie and Sciavicco, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2019.18}, URN = {urn:nbn:de:0030-drops-113768}, doi = {10.4230/LIPIcs.TIME.2019.18}, annote = {Keywords: Interval temporal logic, Model checking, Complexity and succinctness issues} }
Published in: LIPIcs, Volume 120, 25th International Symposium on Temporal Representation and Reasoning (TIME 2018)
Laura Bozzelli, Aniello Murano, and Loredana Sorrentino. Results on Alternating-Time Temporal Logics with Linear Past. In 25th International Symposium on Temporal Representation and Reasoning (TIME 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 120, pp. 6:1-6:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bozzelli_et_al:LIPIcs.TIME.2018.6, author = {Bozzelli, Laura and Murano, Aniello and Sorrentino, Loredana}, title = {{Results on Alternating-Time Temporal Logics with Linear Past}}, booktitle = {25th International Symposium on Temporal Representation and Reasoning (TIME 2018)}, pages = {6:1--6:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-089-7}, ISSN = {1868-8969}, year = {2018}, volume = {120}, editor = {Alechina, Natasha and N{\o}rv\r{a}g, Kjetil and Penczek, Wojciech}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2018.6}, URN = {urn:nbn:de:0030-drops-97714}, doi = {10.4230/LIPIcs.TIME.2018.6}, annote = {Keywords: Alternating-time temporal logics, Linear Past, Model Checking} }
Published in: LIPIcs, Volume 90, 24th International Symposium on Temporal Representation and Reasoning (TIME 2017)
Laura Bozzelli, Aniello Murano, Giuseppe Perelli, and Loredana Sorrentino. Hierarchical Cost-Parity Games. In 24th International Symposium on Temporal Representation and Reasoning (TIME 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 90, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bozzelli_et_al:LIPIcs.TIME.2017.6, author = {Bozzelli, Laura and Murano, Aniello and Perelli, Giuseppe and Sorrentino, Loredana}, title = {{Hierarchical Cost-Parity Games}}, booktitle = {24th International Symposium on Temporal Representation and Reasoning (TIME 2017)}, pages = {6:1--6:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-052-1}, ISSN = {1868-8969}, year = {2017}, volume = {90}, editor = {Schewe, Sven and Schneider, Thomas and Wijsen, Jef}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2017.6}, URN = {urn:nbn:de:0030-drops-79175}, doi = {10.4230/LIPIcs.TIME.2017.6}, annote = {Keywords: Parity Games, Cost-Parity Games, Hierarchical Systems, System Verification} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, and Pietro Sala. Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 120:1-120:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bozzelli_et_al:LIPIcs.ICALP.2017.120, author = {Bozzelli, Laura and Molinari, Alberto and Montanari, Angelo and Peron, Adriano and Sala, Pietro}, title = {{Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {120:1--120:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.120}, URN = {urn:nbn:de:0030-drops-74703}, doi = {10.4230/LIPIcs.ICALP.2017.120}, annote = {Keywords: Interval Temporal Logic, Satisfiability, Model Checking, Decidability, Computational Complexity} }
Published in: LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, and Pietro Sala. Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 26:1-26:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bozzelli_et_al:LIPIcs.FSTTCS.2016.26, author = {Bozzelli, Laura and Molinari, Alberto and Montanari, Angelo and Peron, Adriano and Sala, Pietro}, title = {{Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison}}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, pages = {26:1--26:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-027-9}, ISSN = {1868-8969}, year = {2016}, volume = {65}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.26}, URN = {urn:nbn:de:0030-drops-68615}, doi = {10.4230/LIPIcs.FSTTCS.2016.26}, annote = {Keywords: Interval Temporal Logics, Expressiveness, Model Checking} }
Published in: LIPIcs, Volume 18, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)
Laura Bozzelli and César Sánchez. Visibly Rational Expressions. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 18, pp. 211-223, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bozzelli_et_al:LIPIcs.FSTTCS.2012.211, author = {Bozzelli, Laura and S\'{a}nchez, C\'{e}sar}, title = {{Visibly Rational Expressions}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)}, pages = {211--223}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-47-7}, ISSN = {1868-8969}, year = {2012}, volume = {18}, editor = {D'Souza, Deepak and Radhakrishnan, Jaikumar and Telikepalli, Kavitha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.211}, URN = {urn:nbn:de:0030-drops-38604}, doi = {10.4230/LIPIcs.FSTTCS.2012.211}, annote = {Keywords: Visibly Pushdown Languages, Context-free specifications, Regular expressions, Algebraic characterization} }
Published in: LIPIcs, Volume 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)
Laura Bozzelli, Axel Legay, and Sophie Pinchinat. On Timed Alternating Simulation for Concurrent Timed Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 85-96, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bozzelli_et_al:LIPIcs.FSTTCS.2009.2309, author = {Bozzelli, Laura and Legay, Axel and Pinchinat, Sophie}, title = {{On Timed Alternating Simulation for Concurrent Timed Games}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {85--96}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2309}, URN = {urn:nbn:de:0030-drops-23092}, doi = {10.4230/LIPIcs.FSTTCS.2009.2309}, annote = {Keywords: Concurrent Timed Games, Timed Alternating Simulation, Timed Alternating Temporal Logics} }
Feedback for Dagstuhl Publishing