Optimising attractor computation in Boolean automata networks

This paper details a method for optimising the size of Boolean automata networks in order to compute their attractors under the parallel update schedule. This method relies on the formalism of modules introduced recently that allows for (de)composing such networks. We discuss the practicality of thi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Perrot, Kévin, Perrotin, Pacôme, Sené, Sylvain
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Discrete Mathematics Computer Science - Logic in Computer Science
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!