On Cyclic Orders and Synchronisation Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

On Cyclic Orders and Synchronisation Graphs

Stefan Haar


We use a dedicated quotient operation called winding to give a new characteriz- ation of orientable cyclic orders; the characterization is twofold, in terms of partial orders and of separation properties. For this, we show the application to Petri nets: by winding causal nets, one obtains cyclic orders on synchronization graph that yield live and safe markings and describe the concurrent behavior of the system under these markings. Moreover, we characterize admissible action refinements on such nets by quotients of the corresponding (cyclic or acyclic) order structure.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4007.pdf (509.98 Ko) Télécharger le fichier

Dates and versions

inria-00072637 , version 1 (24-05-2006)


  • HAL Id : inria-00072637 , version 1


Stefan Haar. On Cyclic Orders and Synchronisation Graphs. [Research Report] RR-4007, INRIA. 2000. ⟨inria-00072637⟩
61 View
45 Download


Gmail Facebook Twitter LinkedIn More