| Decision problems for lower/upper bound parametric timed automata L Bozzelli, S La Torre Formal Methods in System Design 35 (2), 121-151, 2009 | 88 | 2009 |
| Complexity analysis of the backward coverability algorithm for VASS L Bozzelli, P Ganty International Workshop on Reachability Problems, 96-109, 2011 | 46 | 2011 |
| Refinement modal logic L Bozzelli, H van Ditmarsch, T French, J Hales, S Pinchinat Information and Computation 239, 303-339, 2014 | 44 | 2014 |
| Pushdown module checking L Bozzelli, A Murano, A Peron Formal Methods in System Design 36, 65-95, 2010 | 44 | 2010 |
| Unifying hyper and epistemic temporal logics L Bozzelli, B Maubert, S Pinchinat International Conference on Foundations of Software Science and Computation …, 2015 | 40 | 2015 |
| Controller synthesis for MTL specifications P Bouyer, L Bozzelli, F Chevalier International Conference on Concurrency Theory, 450-464, 2006 | 39 | 2006 |
| Verification of gap-order constraint abstractions of counter systems L Bozzelli, S Pinchinat Theoretical Computer Science 523, 1-36, 2014 | 38 | 2014 |
| Alternating automata and a temporal fixpoint calculus for visibly pushdown languages L Bozzelli International Conference on Concurrency Theory, 476-491, 2007 | 32 | 2007 |
| The complexity of one-agent refinement modal logic L Bozzelli, H Van Ditmarsch, S Pinchinat Theoretical Computer Science 603, 58-83, 2015 | 28 | 2015 |
| Interval vs. point temporal logic model checking: An expressiveness comparison L Bozzelli, A Molinari, A Montanari, A Peron, P Sala ACM Transactions on Computational Logic (TOCL) 20 (1), 1-31, 2018 | 26 | 2018 |
| Complexity results on branching-time pushdown model checking L Bozzelli Theoretical computer science 379 (1-2), 286-297, 2007 | 26 | 2007 |
| Asynchronous extensions of HyperLTL L Bozzelli, A Peron, C Sánchez 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021 | 25 | 2021 |
| Interval temporal logic model checking: The border between good and bad HS fragments L Bozzelli, A Molinari, A Montanari, A Peron, P Sala International Joint Conference on Automated Reasoning, 389-405, 2016 | 24 | 2016 |
| Uniform strategies, rational relations and jumping automata L Bozzelli, B Maubert, S Pinchinat Information and Computation 242, 80-107, 2015 | 24 | 2015 |
| Branching-time temporal logic extended with qualitative Presburger constraints L Bozzelli, R Gascon Logic for Programming, Artificial Intelligence, and Reasoning: 13th …, 2006 | 24 | 2006 |
| Pushdown module checking L Bozzelli, A Murano, A Peron Logic for Programming, Artificial Intelligence, and Reasoning: 12th …, 2005 | 21 | 2005 |
| On the complexity of temporal equilibrium logic L Bozzelli, D Pearce 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 645-656, 2015 | 20 | 2015 |
| Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption L Bozzelli, A Molinari, A Montanari, A Peron, P Sala 44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017 | 19* | 2017 |
| Which fragments of the interval temporal logic HS are tractable in model checking? L Bozzelli, A Molinari, A Montanari, A Peron, P Sala Theoretical Computer Science 764, 125-144, 2019 | 18 | 2019 |
| On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions L Bozzelli, A Molinari, A Montanari, A Peron arXiv preprint arXiv:1709.02094, 2017 | 17 | 2017 |
