Generalized predecessor existence problems for boolean finite dynamical systems

Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A Boolean Finite Synchronous Dynamical System (BFDS, for short) consists of a finite number of objects that each maintains a boolean state, where after individually receiving state assignments, the objects update their state with respect to object-specific time-independent boolean functions synchronously in discrete time steps. The present paper studies the computational complexity of determining, given a boolean finite synchronous dynamical system, a configuration, which is a boolean vector representing the states of the objects, and a positive integer t, whether there exists another configuration from which the given configuration can be reached in t steps. It was previously shown that this problem, which we call the t-Predecessor Problem, is NP-complete even for t = 1 if the update function of an object is either the conjunction of arbitrary fan-in or the disjunction of arbitrary fan-in. This paper studies the computational complexity of the t-Predecessor Problem for a variety of sets of permissible update functions as well as for polynomially bounded t. It also studies the t-Garden-Of-Eden Problem, a variant of the t-Predecessor Problem that asks whether a configuration has a t-predecessor, which itself has no predecessor. The paper obtains complexity theoretical characterizations of all but one of these problems.

Original languageEnglish (US)
Title of host publication42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Volume83
ISBN (Electronic)9783959770460
DOIs
StatePublished - Nov 1 2017
Event42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 - Aalborg, Denmark
Duration: Aug 21 2017Aug 25 2017

Other

Other42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
CountryDenmark
CityAalborg
Period8/21/178/25/17

Fingerprint

Computational complexity
Dynamical systems
State assignment
Boolean functions

Keywords

  • Computational complexity
  • Dynamical systems
  • Garden of Eden
  • Predecessor

ASJC Scopus subject areas

  • Software

Cite this

Kawachi, A., Ogihara, M., & Uchizawa, K. (2017). Generalized predecessor existence problems for boolean finite dynamical systems. In 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 (Vol. 83). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2017.8

Generalized predecessor existence problems for boolean finite dynamical systems. / Kawachi, Akinori; Ogihara, Mitsunori; Uchizawa, Kei.

42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Vol. 83 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kawachi, A, Ogihara, M & Uchizawa, K 2017, Generalized predecessor existence problems for boolean finite dynamical systems. in 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. vol. 83, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aalborg, Denmark, 8/21/17. https://doi.org/10.4230/LIPIcs.MFCS.2017.8
Kawachi A, Ogihara M, Uchizawa K. Generalized predecessor existence problems for boolean finite dynamical systems. In 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Vol. 83. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017 https://doi.org/10.4230/LIPIcs.MFCS.2017.8
Kawachi, Akinori ; Ogihara, Mitsunori ; Uchizawa, Kei. / Generalized predecessor existence problems for boolean finite dynamical systems. 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Vol. 83 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017.
@inproceedings{07cb1e2832e84f40a5d8dd6ec23ae1f4,
title = "Generalized predecessor existence problems for boolean finite dynamical systems",
abstract = "A Boolean Finite Synchronous Dynamical System (BFDS, for short) consists of a finite number of objects that each maintains a boolean state, where after individually receiving state assignments, the objects update their state with respect to object-specific time-independent boolean functions synchronously in discrete time steps. The present paper studies the computational complexity of determining, given a boolean finite synchronous dynamical system, a configuration, which is a boolean vector representing the states of the objects, and a positive integer t, whether there exists another configuration from which the given configuration can be reached in t steps. It was previously shown that this problem, which we call the t-Predecessor Problem, is NP-complete even for t = 1 if the update function of an object is either the conjunction of arbitrary fan-in or the disjunction of arbitrary fan-in. This paper studies the computational complexity of the t-Predecessor Problem for a variety of sets of permissible update functions as well as for polynomially bounded t. It also studies the t-Garden-Of-Eden Problem, a variant of the t-Predecessor Problem that asks whether a configuration has a t-predecessor, which itself has no predecessor. The paper obtains complexity theoretical characterizations of all but one of these problems.",
keywords = "Computational complexity, Dynamical systems, Garden of Eden, Predecessor",
author = "Akinori Kawachi and Mitsunori Ogihara and Kei Uchizawa",
year = "2017",
month = "11",
day = "1",
doi = "10.4230/LIPIcs.MFCS.2017.8",
language = "English (US)",
volume = "83",
booktitle = "42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
address = "Germany",

}

TY - GEN

T1 - Generalized predecessor existence problems for boolean finite dynamical systems

AU - Kawachi, Akinori

AU - Ogihara, Mitsunori

AU - Uchizawa, Kei

PY - 2017/11/1

Y1 - 2017/11/1

N2 - A Boolean Finite Synchronous Dynamical System (BFDS, for short) consists of a finite number of objects that each maintains a boolean state, where after individually receiving state assignments, the objects update their state with respect to object-specific time-independent boolean functions synchronously in discrete time steps. The present paper studies the computational complexity of determining, given a boolean finite synchronous dynamical system, a configuration, which is a boolean vector representing the states of the objects, and a positive integer t, whether there exists another configuration from which the given configuration can be reached in t steps. It was previously shown that this problem, which we call the t-Predecessor Problem, is NP-complete even for t = 1 if the update function of an object is either the conjunction of arbitrary fan-in or the disjunction of arbitrary fan-in. This paper studies the computational complexity of the t-Predecessor Problem for a variety of sets of permissible update functions as well as for polynomially bounded t. It also studies the t-Garden-Of-Eden Problem, a variant of the t-Predecessor Problem that asks whether a configuration has a t-predecessor, which itself has no predecessor. The paper obtains complexity theoretical characterizations of all but one of these problems.

AB - A Boolean Finite Synchronous Dynamical System (BFDS, for short) consists of a finite number of objects that each maintains a boolean state, where after individually receiving state assignments, the objects update their state with respect to object-specific time-independent boolean functions synchronously in discrete time steps. The present paper studies the computational complexity of determining, given a boolean finite synchronous dynamical system, a configuration, which is a boolean vector representing the states of the objects, and a positive integer t, whether there exists another configuration from which the given configuration can be reached in t steps. It was previously shown that this problem, which we call the t-Predecessor Problem, is NP-complete even for t = 1 if the update function of an object is either the conjunction of arbitrary fan-in or the disjunction of arbitrary fan-in. This paper studies the computational complexity of the t-Predecessor Problem for a variety of sets of permissible update functions as well as for polynomially bounded t. It also studies the t-Garden-Of-Eden Problem, a variant of the t-Predecessor Problem that asks whether a configuration has a t-predecessor, which itself has no predecessor. The paper obtains complexity theoretical characterizations of all but one of these problems.

KW - Computational complexity

KW - Dynamical systems

KW - Garden of Eden

KW - Predecessor

UR - http://www.scopus.com/inward/record.url?scp=85038443054&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85038443054&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.MFCS.2017.8

DO - 10.4230/LIPIcs.MFCS.2017.8

M3 - Conference contribution

VL - 83

BT - 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -