Zobrazeno 1 - 10
of 56
pro vyhledávání: '"PESCHANSKI, Frédéric"'
In this paper we study the notion of synchronization from the point of view of combinatorics. As a first step, we address the quantitative problem of counting the number of executions of simple processes interacting with synchronization barriers. We
Externí odkaz:
http://arxiv.org/abs/1907.04243
Publikováno v:
Electronic Journal of Combinatorics, 23, 1, (2016), P1.11
In this paper, we study the interleaving -- or pure merge -- operator that most often characterizes parallelism in concurrency theory. This operator is a principal cause of the so-called combinatorial explosion that makes very hard - at least from th
Externí odkaz:
http://arxiv.org/abs/1407.1873
Publikováno v:
EPTCS 39, 2010, pp. 47-61
This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics of Pi-gra
Externí odkaz:
http://arxiv.org/abs/1011.0220
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:
Application and Theory of Petri Nets and Concurrency ISBN: 9783031066528
43rd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2022)
43rd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2022), Jun 2022, Bergen, Norway. pp.43--63, ⟨10.1007/978-3-031-06653-5_3⟩
43rd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2022)
43rd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2022), Jun 2022, Bergen, Norway. pp.43--63, ⟨10.1007/978-3-031-06653-5_3⟩
International audience; This paper presents the model of Layered Memory Automata (LaMA) to deal with languages involving infinite alphabets, with practical applications in the analysis of datastreams, or modeling complex resource usages in concurrent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1c74d4616af96e69a0ed263910fc4cd
https://doi.org/10.1007/978-3-031-06653-5_3
https://doi.org/10.1007/978-3-031-06653-5_3
Autor:
Peschanski, Frédéric
Publikováno v:
In Electronic Notes in Theoretical Computer Science 11 May 2006 154(1):63-82
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:
Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'2017)
Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'2017), Jun 2017, Montpellier, France
Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'2017), Jun 2017, Montpellier, France
National audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3ac646db77c22f5fe741e2e74010648c
https://hal.sorbonne-universite.fr/hal-01558732
https://hal.sorbonne-universite.fr/hal-01558732
Publikováno v:
Fundamenta Informaticae. 2013, Vol. 122 Issue 1-2, p85-117. 33p. 10 Diagrams, 3 Charts.
Publikováno v:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2013, Guwahati, India. pp.425-436, ⟨10.4230/LIPIcs.FSTTCS.2013.425⟩
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2013, Guwahati, India. pp.425-436, ⟨10.4230/LIPIcs.FSTTCS.2013.425⟩
International audience; A deep connection exists between the interleaving semantics of concurrent processes and increasingly labelled combinatorial structures. In this paper we further explore this connection by studying the rich combinatorics of par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::beb93d9f969445cb81594935bbd4a50a
https://hal.science/hal-01216553
https://hal.science/hal-01216553