Testing dynamic environments: Back to basics

Yonatan Nakar, Dana Ron

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We continue the line of work initiated by Goldreich and Ron (Journal of the ACM, 2017) on testing dynamic environments and propose to pursue a systematic study of the complexity of testing basic dynamic environments and local rules. As a first step, in this work we focus on dynamic environments that correspond to elementary cellular automata that evolve according to threshold rules. Our main result is the identification of a set of conditions on local rules, and a meta-algorithm that tests evolution according to local rules that satisfy the conditions. The meta-algorithm has query complexity poly(1/∈), is non-adaptive and has one-sided error. We show that all the threshold rules satisfy the set of conditions, and therefore are poly(1/∈)-testable. We believe that this is a rich area of research and suggest a variety of open problems and natural research directions that may extend and expand our results.

Original languageEnglish
Title of host publication48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
EditorsNikhil Bansal, Emanuela Merelli, James Worrell
ISBN (Electronic)9783959771955
DOIs
StatePublished - 1 Jul 2021
Event48th International Colloquium on Automata, Languages, and Programming, ICALP 2021 - Virtual, Glasgow, United Kingdom
Duration: 12 Jul 202116 Jul 2021

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume198

Conference

Conference48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
Country/TerritoryUnited Kingdom
CityVirtual, Glasgow
Period12/07/2116/07/21

Keywords

  • Property testing

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Testing dynamic environments: Back to basics'. Together they form a unique fingerprint.

Cite this