Cyclic Ordering through Partial Orders * - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Multiple-Valued Logic and Soft Computing Year : 2016

Cyclic Ordering through Partial Orders *

Abstract

The orientation problem for ternary cyclic order relations has been attacked in the literature from combinatorial perspectives, through rotations , and by connection with Petri nets. We propose here a twofold characterization of orientable cyclic orders in terms of symmetries of partial orders as well as in terms of separating sets (cuts). The results are inspired by properties of non-sequential discrete processeses, but also apply to dense structures of any cardinality.
Fichier principal
Vignette du fichier
Rogics_SI_HAAR_2013.pdf (434.63 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01360144 , version 1 (06-09-2016)

Identifiers

  • HAL Id : hal-01360144 , version 1

Cite

Stefan Haar. Cyclic Ordering through Partial Orders *. Journal of Multiple-Valued Logic and Soft Computing, 2016, 27 (2-3), pp.209-228. ⟨hal-01360144⟩
207 View
411 Download

Share

Gmail Mastodon Facebook X LinkedIn More