Остановите войну!
for scientists:
default search action
Adriano Peron
- > Home > Persons > Adriano Peron
Publications
- 2023
- [j40]Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
Pspace-completeness of the temporal logic of sub-intervals and suffixes. Inf. Comput. 294: 105083 (2023) - [j39]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Interval Temporal Logic for Visibly Pushdown Systems. ACM Trans. Comput. Log. 24(3): 24:1-24:32 (2023) - [c63]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Quantifying Over Trees in Monadic Second-Order Logic. LICS 2023: 1-13 - [i17]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Quantifying over Trees in Monadic Second-Order Logic. CoRR abs/2304.11613 (2023) - 2022
- [j38]Laura Bozzelli, Aniello Murano, Adriano Peron:
Context-free timed formalisms: Robust automata and linear temporal logics. Inf. Comput. 283: 104673 (2022) - [j37]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. Log. Methods Comput. Sci. 18(1) (2022) - [j36]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Complexity issues for timeline-based planning over dense time under future and minimal semantics. Theor. Comput. Sci. 901: 87-113 (2022) - [c61]Laura Bozzelli, Adriano Peron, César Sánchez:
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. CONCUR 2022: 27:1-27:16 - [c58]Laura Bozzelli, Adriano Peron:
A Quantitative Extension of Interval Temporal Logic over Infinite Words. TIME 2022: 11:1-11:16 - [c56]Laura Bozzelli, Adriano Peron:
Parametric Interval Temporal Logic over Infinite Words. GandALF 2022: 97-113 - [i16]Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete. CoRR abs/2202.07881 (2022) - [i15]Laura Bozzelli, Adriano Peron:
A quantitative extension of Interval Temporal Logic over infinite words. CoRR abs/2206.13920 (2022) - [i14]Laura Bozzelli, Adriano Peron, César Sánchez:
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. CoRR abs/2207.02956 (2022) - 2021
- [j35]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Complexity analysis of a unifying algorithm for model checking interval temporal logic. Inf. Comput. 280: 104640 (2021) - [c54]Laura Bozzelli, Adriano Peron, César Sánchez:
Asynchronous Extensions of HyperLTL. LICS 2021: 1-13 - [c52]Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes. TIME 2021: 9:1-9:19 - [c51]Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
Adding the Relation Meets to the Temporal Logic of Prefixes and Infixes makes it EXPSPACE-Complete. GandALF 2021: 179-194 - [i13]Laura Bozzelli, Adriano Peron, César Sánchez:
Asynchronous Extensions of HyperLTL. CoRR abs/2104.12886 (2021) - 2020
- [j33]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Model checking interval temporal logics with regular expressions. Inf. Comput. 272: 104498 (2020) - [j31]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger:
Timeline-based planning over dense temporal domains. Theor. Comput. Sci. 813: 305-326 (2020) - [c50]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Undecidability of Future Timeline-based Planning over Dense Temporal Domains? ICTCS 2020: 155-166 - [c49]Laura Bozzelli, Aniello Murano, Adriano Peron:
Module Checking of Pushdown Multi-agent Systems. KR 2020: 162-171 - [c48]Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
On a Temporal Logic of Prefixes and Infixes. MFCS 2020: 21:1-21:14 - [i11]Laura Bozzelli, Aniello Murano, Adriano Peron:
Module checking of pushdown multi-agent systems. CoRR abs/2003.04728 (2020) - [i10]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. CoRR abs/2006.04652 (2020) - 2019
- [j30]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Which fragments of the interval temporal logic HS are tractable in model checking? Theor. Comput. Sci. 764: 125-144 (2019) - [j29]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval vs. Point Temporal Logic Model Checking: An Expressiveness Comparison. ACM Trans. Comput. Log. 20(1): 4:1-4:31 (2019) - [c45]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Interval Temporal Logic for Visibly Pushdown Systems. FSTTCS 2019: 33:1-33:14 - [c44]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains. FSTTCS 2019: 34:1-34:14 - [c43]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Model Checking Timeline-Based Systems over Dense Temporal Domains. ICTCS 2019: 235-247 - [c41]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Complexity Analysis of a Unifying Algorithm for Model Checking Interval Temporal Logic. TIME 2019: 18:1-18:17 - [i9]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Undecidability of future timeline-based planning over dense temporal domains. CoRR abs/1904.09184 (2019) - [i8]Laura Bozzelli, Aniello Murano, Adriano Peron:
Timed Context-Free Temporal Logics. CoRR abs/1911.08406 (2019) - 2018
- [j27]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy. Inf. Comput. 262: 241-264 (2018) - [c39]Laura Bozzelli, Aniello Murano, Adriano Peron:
Timed Context-Free Temporal Logics. GandALF 2018: 235-249 - [c38]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger:
Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete. ICTCS 2018: 116-127 - [c37]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Decidability and Complexity of Timeline-Based Planning over Dense Temporal Domains. KR 2018: 627-628 - [c36]Laura Bozzelli, Aniello Murano, Adriano Peron:
Event-Clock Nested Automata. LATA 2018: 80-92 - [c35]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground. GandALF 2018: 191-205 - [i7]Laura Bozzelli, Aniello Murano, Adriano Peron:
Timed context-free temporal logics (extended version). CoRR abs/1808.04271 (2018) - 2017
- [c34]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. ICALP 2017: 120:1-120:14 - [c33]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions. SEFM 2017: 104-119 - [c32]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions. GandALF 2017: 31-45 - [i5]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. CoRR abs/1711.08191 (2017) - [i4]Laura Bozzelli, Aniello Murano, Adriano Peron:
Event-Clock Nested Automata. CoRR abs/1711.08314 (2017) - 2016
- [c31]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments. IJCAR 2016: 389-405 - [c30]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. FSTTCS 2016: 26:1-26:14 - [c29]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling. ICTCS 2016: 49-61 - [c27]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Model Checking the Logic of Allen's Relations Meets and Started-by is PNP-Complete. GandALF 2016: 76-90 - 2010
- [j17]Laura Bozzelli, Aniello Murano, Adriano Peron:
Pushdown module checking. Formal Methods Syst. Des. 36(1): 65-95 (2010) - 2008
- [j15]Laura Bozzelli, Salvatore La Torre, Adriano Peron:
Verification of well-formed communicating recursive state machines. Theor. Comput. Sci. 403(2-3): 382-405 (2008) - 2006
- [c15]Laura Bozzelli, Salvatore La Torre, Adriano Peron:
Verification of Well-Formed Communicating Recursive State Machines. VMCAI 2006: 412-426 - 2005
- [c14]Laura Bozzelli, Aniello Murano, Adriano Peron:
Pushdown Module Checking. LPAR 2005: 504-518 - 2003
- [i1]Laura Bozzelli, Massimo Benerecetti, Adriano Peron:
Verification of recursive parallel systems. CoRR cs.OH/0312019 (2003)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint