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.
Type de document :
Rapport
[Research Report] RR-4007, INRIA. 2000
Liste complète des métadonnées

https://hal.inria.fr/inria-00072637
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 10:28:10
Dernière modification le : vendredi 16 septembre 2016 - 15:09:40
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:16:30

Fichiers

Identifiants

  • HAL Id : inria-00072637, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

670

Téléchargements de fichiers

79