Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Bazille, Hugo"'
In this paper we study finite higher-dimensional automata (HDAs) from the logical point of view. Languages of HDAs are sets of finite bounded-width interval pomsets with interfaces (iiPoms<=k) closed under order extension. We prove that languages of
Externí odkaz:
http://arxiv.org/abs/2403.19526
Interval-order partially ordered multisets with interfaces (ipomsets) have shown to be a versatile model for executions of concurrent systems in which both precedence and concurrency need to be taken into account. In this paper, we develop a presenta
Externí odkaz:
http://arxiv.org/abs/2403.16626
We present a new language semantics for real-time concurrency. Its operational models are higher-dimensional timed automata (HDTAs), a generalization of both higher-dimensional automata and timed automata. We define languages of HDTAs as sets of inte
Externí odkaz:
http://arxiv.org/abs/2401.17444
We report some further developments regarding the language theory of higher-dimensional automata (HDAs). Regular languages of HDAs are sets of finite interval partially ordered multisets (pomsets) with interfaces. We show a pumping lemma which allows
Externí odkaz:
http://arxiv.org/abs/2305.02873
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 2 (June 5, 2024) lmcs:10261
The Skolem problem is a long-standing open problem in linear dynamical systems: can a linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly, the positivity problem asks whether the LRS stays positive from an init
Externí odkaz:
http://arxiv.org/abs/2211.02365
Reachability for piecewise affine systems is known to be undecidable, starting from dimension $2$. In this paper we investigate the exact complexity of several decidable variants of reachability and control questions for piecewise affine systems. We
Externí odkaz:
http://arxiv.org/abs/1601.05353
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Theoretical Computer Science 29 July 2018 735:132-146
Publikováno v:
In IFAC PapersOnLine 2018 51(7):82-87
Publikováno v:
STACS 2022-39th International Symposium on Theoretical Aspects of Computer Science
STACS 2022-39th International Symposium on Theoretical Aspects of Computer Science, May 2022, Marseille, France. pp.1-20, ⟨10.4230/LIPIcs.STACS.2022.5⟩
STACS 2022-39th International Symposium on Theoretical Aspects of Computer Science, May 2022, Marseille, France. pp.1-20, ⟨10.4230/LIPIcs.STACS.2022.5⟩
The Skolem problem is a long-standing open problem in linear dynamical systems: can a linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly, the positivity problem asks whether the LRS stays positive from an init
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0692ecddd6b5577c67c56967b0f775f0
https://hal.science/hal-03695798/file/23-LIPIcs-STACS-2022-5.pdf
https://hal.science/hal-03695798/file/23-LIPIcs-STACS-2022-5.pdf