Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Amrane, Amazigh"'
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
Autor:
Amrane, Amazigh, Bedon, Nicolas
Let $A$ be an alphabet and $SP^\diamond(A)$ denote the class of all countable N-free partially ordered sets labeled by $A$, in which chains are scattered linear orderings and antichains are finite. We characterize the rational languages of $SP^\diamo
Externí odkaz:
http://arxiv.org/abs/1912.10240
Autor:
Amrane, Amazigh, Bedon, Nicolas
Publikováno v:
In Theoretical Computer Science 24 February 2020 809:538-562
Autor:
Amrane, Amazigh
Publikováno v:
Informatique et langage [cs.CL]. Normandie Université, 2020. Français. ⟨NNT : 2020NORMR102⟩
We study in this thesis structures extending the classical notion of word. They are built from a partially ordered set (poset) verifying the following properties : — they do not contain 4 distinct elements x, y, z, t whose relative order is exactly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ed9156d16949252cb04c201311cfea52
https://tel.archives-ouvertes.fr/tel-03215265
https://tel.archives-ouvertes.fr/tel-03215265
Autor:
AMRANE, Amazigh
We study in this thesis structures extending the classical notion of word. They are built from a partially ordered set (poset) verifying the following properties : — they do not contain 4 distinct elements x, y, z, t whose relative order is exactly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c1fb32c7f2ac3c9449f17ca70a0a8c4f
https://theses.hal.science/tel-03215265
https://theses.hal.science/tel-03215265