动态等价互不关联网络

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2024-10-09 DOI:10.1016/j.tcs.2024.114899

Julio Aracena , Luis Cabrera-Crot , Adrien Richard , Lilian Salinas

{"title":"动态等价互不关联网络","authors":"Julio Aracena , Luis Cabrera-Crot , Adrien Richard , Lilian Salinas","doi":"10.1016/j.tcs.2024.114899","DOIUrl":null,"url":null,"abstract":"<div><div>The study of the dynamical behavior of Boolean networks with different update schedules has so far focused primarily on the possible dynamics and equivalent networks that can be obtained. However, few studies have been done about which networks can be obtained from another network with a non-parallel schedule.</div><div>In this article, we define the problem of finding a Boolean network that is dynamically equivalent to another network. For the general case, it is shown that the problem is NP-Hard. However, if the problem is restricted to disjunctive Boolean networks, it can be solved in polynomial time.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1024 ","pages":"Article 114899"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamically equivalent disjunctive networks\",\"authors\":\"Julio Aracena , Luis Cabrera-Crot , Adrien Richard , Lilian Salinas\",\"doi\":\"10.1016/j.tcs.2024.114899\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The study of the dynamical behavior of Boolean networks with different update schedules has so far focused primarily on the possible dynamics and equivalent networks that can be obtained. However, few studies have been done about which networks can be obtained from another network with a non-parallel schedule.</div><div>In this article, we define the problem of finding a Boolean network that is dynamically equivalent to another network. For the general case, it is shown that the problem is NP-Hard. However, if the problem is restricted to disjunctive Boolean networks, it can be solved in polynomial time.</div></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1024 \",\"pages\":\"Article 114899\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0304397524005164\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005164","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

迄今为止，对具有不同更新时间表的布尔网络的动力学行为的研究主要集中在可能的动力学和可以得到的等价网络上。在本文中，我们定义了寻找与另一个网络动态等价的布尔网络的问题。对于一般情况，该问题的难度为 NP-Hard。但是，如果把问题限制在非等价布尔网络上，则可以在多项式时间内求解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Dynamically equivalent disjunctive networks

The study of the dynamical behavior of Boolean networks with different update schedules has so far focused primarily on the possible dynamics and equivalent networks that can be obtained. However, few studies have been done about which networks can be obtained from another network with a non-parallel schedule.

In this article, we define the problem of finding a Boolean network that is dynamically equivalent to another network. For the general case, it is shown that the problem is NP-Hard. However, if the problem is restricted to disjunctive Boolean networks, it can be solved in polynomial time.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.