Maximum number of fixed points in AND–OR–NOT networks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Computer and System Sciences Année : 2014

Maximum number of fixed points in AND–OR–NOT networks

Résumé

We are interested in the number of fixed points in AND-OR-NOT networks, i.e. Boolean networks in which the update function of each component is either a conjunction or a disjunction of positive or negative literals. As main result, we prove that the maximum number of fixed points in a loop-less connected AND-OR-NOT network with n components is at most the maximum number of maximal independent sets in a loop-less connected graph with n vertices, a quantity already known.
Fichier principal
Vignette du fichier
2014_AND-OR-NET_JCSS.pdf (375.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01298835 , version 1 (06-04-2016)

Identifiants

Citer

J Aracena, Adrien Richard, L Salinas. Maximum number of fixed points in AND–OR–NOT networks. Journal of Computer and System Sciences, 2014, ⟨10.1016/j.jcss.2014.04.025⟩. ⟨hal-01298835⟩
107 Consultations
89 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More