Samy Abbes

dblp:08/225 · DBLP profile ↗
← Back
14ranked-venue papers
12as first author
3since 2021 · last 2023
0000-0003-3382-3647ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 13 · 11 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 2 first-author
YearPublicationVenuePosition
2023 Convergence of Distributions on Paths
Samy Abbes
FCT1
2022 Introduction to Probabilistic Concurrent Systems
abstract
The first part of the paper is an introduction to the theory of probabilistic concurrent systems under a partial order semantics. Key definitions and results are given and illustrated on examples. The second part includes contributions. We introduce deterministic concurrent systems as a subclass of concurrent systems. Deterministic concurrent system are "locally commutative'" concurrent systems. We prove that irreducible and deterministic concurrent systems have a unique probabilistic dynamics, and we characterize these systems by means of their combinatorial properties. Comment: Extended version of the Petri Net 2021 conference paper arXiv:2008.07233 "Deterministic concurrent systems" by the same author. 32 pages, 9 figures, 17 references
Samy Abbes
Fundam. Informaticae1
2021 Deterministic Concurrent Systems
Samy Abbes
Petri Nets1
2017 Synchronization of Bernoulli sequences on shared letters
Samy Abbes
Inf. Comput.1
2015 Uniform Generation in Trace Monoids
Samy Abbes, Jean Mairesse
MFCS (1)1
2014 Branching cells for asymmetric event structures
Samy Abbes
Theor. Comput. Sci.1
2014 Foreword in honor of Glynn Winskel
Albert Benveniste, Claude Jard, Samy Abbes
Theor. Comput. Sci.3
2014 Application of branching cells to QoS aware service orchestrations
Albert Benveniste, Claude Jard, Samy Abbes
Theor. Comput. Sci.3
2009 Concurrency, sigma-Algebras, and Probabilistic Fairness
Samy Abbes, Albert Benveniste
FoSSaCS1
2008 True-concurrency probabilistic models: Markov nets and a law of large numbers
Samy Abbes, Albert Benveniste
Theor. Comput. Sci.1
2007 A projective formalism applied to topological and probabilistic event structures
abstract
This paper introduces projective systems for topological and probabilistic event structures. The projective formalism is used for studying the domain of configurations of a prime event structure and its space of maximal elements. This is done from both a topological and a probabilistic viewpoint. We give probability measure extension theorems in this framework.
Samy Abbes
Math. Struct. Comput. Sci.1
2006 True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
Samy Abbes, Albert Benveniste
Inf. Comput.1
2006 Projective topology on bifinite domains and applications
Samy Abbes, Klaus Keimel
Theor. Comput. Sci.1
2005 Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
Samy Abbes, Albert Benveniste
FoSSaCS1