On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One

DOI10.1007/978-3-319-55911-7_9zbMath1485.68136arXiv1702.03101OpenAlexW2593460421MaRDI QIDQ2988816

Pierre Guillon, Sylvain Sené, Guillaume Theyssier, Florian Bridoux, Kévin Perrot

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.03101

zbMATH Keywords

Boolean automata networksintrinsic simulationblock-sequential update schedules

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Sequentialization and procedural complexity in automata networks

Cites Work

• Unnamed Item
• Unnamed Item
• About non-monotony in Boolean automata networks
• Disjunctive networks and update schedules
• Bulking I: An abstract theory of bulking
• Bulking II: Classifications of cellular automata
• Comparison between parallel and serial dynamics of Boolean networks
• Sequential simulation of parallel iterations and applications
• Computing with truly asynchronous threshold logic networks
• On the Convergence of Boolean Automata Networks without Negative Cycles
• Universal Tilings
• An Almost Totally Universal Tile Set
• A generalized convergence theorem for neural networks
• Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks
• Neural networks and physical systems with emergent collective computational abilities.
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One