The Combinatorics of Barrier Synchronization - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

The Combinatorics of Barrier Synchronization

Matthieu Dien
Antoine Genitrini
  • Function : Author
  • PersonId : 881263
Frederic Peschanski
  • Function : Author
  • PersonId : 1012844


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 elaborate a systematic decomposition of processes that produces a symbolic integral formula to solve the problem. Based on this procedure, we develop a generic algorithm to generate process executions uniformly at random. For some interesting sub-classes of processes we propose very efficient counting and random sampling algorithms. All these algorithms have one important characteristic in common: they work on the control graph of processes and thus do not require the explicit construction of the state-space.

Dates and versions

hal-02163607 , version 1 (24-06-2019)



Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frederic Peschanski. The Combinatorics of Barrier Synchronization. PETRI NETS 2019 - 40th International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2019, Aachen, Germany. pp.386-405, ⟨10.1007/978-3-030-21571-2_21⟩. ⟨hal-02163607⟩
88 View
0 Download



Gmail Facebook Twitter LinkedIn More