Výsledky vyhledávání - "Vincent Penelle"

Akademický článek

Undecidability of a weak version of MSO+U

Autor: Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith

Publikováno v: Logical Methods in Computer Science, Vol Volume 16, Issue 1 (2020)

We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing that adding

Externí odkaz: https://doaj.org/article/b60e87abd5514f09801fab6fe043315b

Zobrazit plný text záznamu

Constrained Dynamic Tree Networks

Autor: Matthew Hague, Vincent Penelle

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030002497
RP

We generalise Constrained Dynamic Pushdown Networks, introduced by Bouajjani\et al, to Constrained Dynamic Tree Networks.In this model, we have trees of processes which may monitor their children.We allow the processes to be defined by any computatio

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9dd874ef8071210221cb369c6d7c4910

Zobrazit plný text záznamu

Rewriting Higher-Order Stack Trees

Autor: Vincent Penelle

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319202969
CSR

Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for monadic seco

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2bb3d324f8bb59fb0b33222a8397bb97
https://doi.org/10.1007/978-3-319-20297-6_24

Zobrazit plný text záznamu

The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems

Autor: Grégoire Sutre, Jérôme Leroux, Vincent Penelle

Publikováno v: ATVA'14
ATVA'14, Nov 2014, Sydney, Australia. pp.248-263, ⟨10.1007/978-3-319-11936-6_19⟩
Automated Technology for Verification and Analysis ISBN: 9783319119359
ATVA

International audience; Bounded languages have recently proved to be an important class of languages for the analysis of Turing-powerful models. For instance, bounded context-free languages are used to under-approximate the behav-iors of recursive pr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4388f115aa6906c868bf46897f4599c1
https://hal.archives-ouvertes.fr/hal-01084819/file/atva.pdf

Zobrazit plný text záznamu

On the Context-Freeness Problem for Vector Addition Systems

Autor: Jérôme Leroux, Vincent Penelle, Grégoire Sutre

Publikováno v: 28th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS 2013
LICS 2013, Jun 2013, New Orleans, LA, United States. pp.43-52, ⟨10.1109/LICS.2013.9⟩
LICS

10 pages; International audience; Petri nets, or equivalently vector addition systems (VAS), are widely recognized as a central model for concurrent systems. Many interesting properties are decidable for this class, such as boundedness, reachability,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::549367fc2dcb2756756bfa296d2395b6
https://hal.archives-ouvertes.fr/hal-00788744v2/document

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání