Skip to Main content Skip to Navigation
Reports

On Cyclic Orders and Synchronisation Graphs

Abstract : 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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072637
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:28:10 AM
Last modification on : Thursday, February 11, 2021 - 2:50:06 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:16:30 PM

Identifiers

  • HAL Id : inria-00072637, version 1

Collections

Citation

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

Share

Metrics

Record views

1084

Files downloads

116