Information and Computation最新文献

{"title":"Characterizing contrasimilarity through games, modal logic, and complexity","authors":"Benjamin Bisping,&nbsp;Luisa Montanari","doi":"10.1016/j.ic.2024.105191","DOIUrl":"10.1016/j.ic.2024.105191","url":null,"abstract":"<div><p>We present the first game characterization of contrasimilarity, the weakest form of bisimilarity. It corresponds to an elegant modal characterization of nested trees of impossible future behavior. The game is exponential but finite for finite-state systems and can thus be used for contrasimulation equivalence checking, of which no tool has been capable to date. By reduction from weak trace equivalence, we establish that contrasimilarity is PSPACE-complete. A machine-checked Isabelle/HOL formalization backs our work and enables further use of contrasimilarity in verification contexts.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"300 ","pages":"Article 105191"},"PeriodicalIF":0.8,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000567/pdfft?md5=5d349cca73dcbd929167de5c7c879b9e&pid=1-s2.0-S0890540124000567-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141713198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A computable and compositional semantics for hybrid systems","authors":"Davide Bresolin ,&nbsp;Pieter Collins ,&nbsp;Luca Geretti ,&nbsp;Roberto Segala ,&nbsp;Tiziano Villa ,&nbsp;Sanja Živanović Gonzalez","doi":"10.1016/j.ic.2024.105189","DOIUrl":"10.1016/j.ic.2024.105189","url":null,"abstract":"<div><p>Hybrid Systems are systems having a mixed discrete and continuous behaviour that cannot be characterised faithfully using either discrete or continuous models only.</p><p>Due to the intrinsic complexity of hybrid systems, it is highly desirable to describe them compositionally, where large systems are seen as the composition of several simpler subparts that are studied independently. Furthermore, since several problems, including reachability, are undecidable for hybrid systems, the availability of approximate decision procedures is another important feature.</p><p>In this paper, we propose a purely behavioural formalism for hybrid systems that is compositional and supports approximate decision procedures. The formalism is abstract and sufficiently general to subsume or be a semantic framework for most of the concrete formalisms or languages proposed in the literature.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"300 ","pages":"Article 105189"},"PeriodicalIF":0.8,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141637812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Pathwise-randomness and models of second-order arithmetic","authors":"George Barmpalias ,&nbsp;Wei Wang","doi":"10.1016/j.ic.2024.105181","DOIUrl":"10.1016/j.ic.2024.105181","url":null,"abstract":"<div><p>A tree is <em>pathwise-random</em> if all of its paths are Martin-Löf random. We show that: (a) no weakly 2-random real computes a perfect pathwise-random tree; it follows that the class of perfect pathwise-random trees is null, with respect to any computable measure; (b) there exists a positive-measure pathwise-random tree which does not compute any complete extension of Peano arithmetic; and (c) there exists a perfect pathwise-random tree which does not compute any tree of positive measure and finite randomness deficiency. We then obtain models of second-order arithmetic that separate principles below weak Königs lemma.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105181"},"PeriodicalIF":1.0,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141197156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Spiking neural P systems with mute rules","authors":"Tingfang Wu ,&nbsp;Luis Valencia-Cabrera ,&nbsp;Mario J. Pérez-Jiménez ,&nbsp;Linqiang Pan","doi":"10.1016/j.ic.2024.105179","DOIUrl":"10.1016/j.ic.2024.105179","url":null,"abstract":"<div><p>Spiking neural P (SNP) systems are a class of neural network models that draw inspiration from the functioning of biological neurons. It was experimentally found that there exist autapses from neurons onto themselves in the brain, i.e., a neuron can transmit a signal back to itself through an autapse. In this work, inspired by the characteristics of autapses, a new variant of the SNP system, termed SNP systems with mute rules (SNPMR systems), is considered. Specifically, mute rules have no communication functioning, namely the execution of a mute rule only applies the change on the number of spikes within its residing neuron, rather than affecting other postsynaptic neurons. The computational power of SNPMR systems is examined by demonstrating that SNPMR systems achieve Turing universality with four or ten neurons. In addition, a simulator for SNPMR systems is developed to provide an experimental validation of the systems designed theoretically.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105179"},"PeriodicalIF":1.0,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141196976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Special issue: Selected papers of the 9th International Conference on Algebraic Informatics, CAI 2022","authors":"Dimitrios Poulakis,&nbsp;George Rahonis","doi":"10.1016/j.ic.2024.105180","DOIUrl":"https://doi.org/10.1016/j.ic.2024.105180","url":null,"abstract":"","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105180"},"PeriodicalIF":1.0,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141091060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Relative approximate bisimulations for fuzzy picture automata","authors":"Chao Yang ,&nbsp;Ruiling Wu ,&nbsp;Xiaobing Sun ,&nbsp;Qichao Wang ,&nbsp;Yongming Li","doi":"10.1016/j.ic.2024.105172","DOIUrl":"10.1016/j.ic.2024.105172","url":null,"abstract":"<div><p>In this paper, we firstly give the notion of relative <em>ϵ</em>-approximate bisimulations between two fuzzy two-dimensional on-line tessellation automata (F2OTAs) and elaborate that the relative error between two F2OTAs, accompanying with a relative <em>ϵ</em>-approximate bisimulation between them, is less than or equal to <em>ϵ</em> where <span><math><mi>ϵ</mi><mo>∈</mo><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></math></span>. Moreover, if relative <em>ϵ</em>-approximate bisimulations between two F2OTAs are restricted to be surjective functional, then some properties are drawn and by which relative <em>ϵ</em>-approximate bisimulations on a F2OTA are defined. We construct the factor F2OTA of a F2OTA with respect to a relative <em>ϵ</em>-approximate bisimulation on it and describe the relationship between this factor automaton and the original F2OTA. Whereafter, we novelly design two algorithms to compute all maximal relative <em>ϵ</em>-approximate bisimulations on a given F2OTA. Finally, we discuss some interesting properties of bisimulations on F2OTAs.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105172"},"PeriodicalIF":1.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141041905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source","authors":"Argyrios Deligkas ,&nbsp;Michelle Döring ,&nbsp;Eduard Eiben ,&nbsp;Tiger-Lily Goldsmith ,&nbsp;George Skretas","doi":"10.1016/j.ic.2024.105171","DOIUrl":"https://doi.org/10.1016/j.ic.2024.105171","url":null,"abstract":"<div><p>We consider the influence maximization problem over a temporal graph. We deviate from the standard model of influence maximization, where the goal is to choose the most influential vertices. In our model, we are given a fixed vertex and the goal is to find the best time steps to transmit so that the influence of this vertex is maximized. We frame this problem as a spreading process that follows a variant of the susceptible-infected-susceptible (SIS) model and focus on four objective functions. In the <span>MaxSpread</span> objective, the goal is to maximize the number of vertices that get infected at least once. In <span>MaxViral</span> and <span>MaxViralTstep</span>, the goal is to maximize the number of vertices that are infected at the same time step and at a given time step, respectively. Finally, in <span>MinNonViralTime</span>, the goal is to maximize the number of vertices that are infected in every <em>d</em> time-step window.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105171"},"PeriodicalIF":1.0,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141077859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The complexity of subcube partition relates to the additive structure of the support","authors":"Norbert Hegyvári","doi":"10.1016/j.ic.2024.105170","DOIUrl":"https://doi.org/10.1016/j.ic.2024.105170","url":null,"abstract":"<div><p>The subcube partition of a Boolean function is a partition of <span><math><msup><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></mrow><mrow><mi>n</mi></mrow></msup></math></span> into the union of subcubes <span><math><msub><mrow><mo>∪</mo></mrow><mrow><mi>i</mi></mrow></msub><msub><mrow><mi>C</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>, such that the value of the function <em>f</em> is the same on each vector of <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>, i.e. for every <em>i</em> and <span><math><mi>x</mi><mo>,</mo><mi>y</mi><mo>∈</mo><msub><mrow><mi>C</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>, <span><math><mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>=</mo><mi>f</mi><mo>(</mo><mi>y</mi><mo>)</mo></math></span>. The complexity of it denotes by <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>S</mi><mi>C</mi><mi>P</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> is the minimum number of subcubes in a subcube partition which computes the Boolean function <em>f</em>. We give a lower bound of the complexity of subcube partitions of Boolean function which relates the additive behaviour of the support and the influence of the function.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"299 ","pages":"Article 105170"},"PeriodicalIF":1.0,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140878547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Solving modular cubic equations with Coppersmith's method","authors":"Virgile Dossou-Yovo ,&nbsp;Abderrahmane Nitaj ,&nbsp;Alain Togbé","doi":"10.1016/j.ic.2024.105169","DOIUrl":"10.1016/j.ic.2024.105169","url":null,"abstract":"<div><p>Several cryptosystems based on Elliptic Curve Cryptography such as KMOV and Demytko process the message as a point <span><math><mi>M</mi><mo>=</mo><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>)</mo></math></span> of an elliptic curve with an equation of the form <span><math><msup><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>≡</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>+</mo><mi>a</mi><mi>x</mi><mo>+</mo><mi>b</mi><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mi>n</mi><mo>)</mo></math></span> over a finite field when <em>n</em> is a prime number, or over a finite ring when <span><math><mi>n</mi><mo>=</mo><mi>p</mi><mi>q</mi></math></span> is an RSA modulus. Other systems use singular cubic curves such as <span><math><msup><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>≡</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>+</mo><mi>a</mi><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mi>n</mi><mo>)</mo></math></span> and <span><math><msup><mrow><mi>y</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mi>a</mi><mi>x</mi><mi>y</mi><mo>≡</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msup><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mi>n</mi><mo>)</mo></math></span>. In this paper, we present a method to find the small solutions of the former modular cubic equations. Our method is based on Coppersmith's technique and enables one to find the solutions <span><math><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>)</mo></math></span> when <span><math><mo>|</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>0</mn></mrow></msub><msup><mrow><mo>|</mo></mrow><mrow><mn>3</mn></mrow></msup><mo>|</mo><msub><mrow><mi>y</mi></mrow><mrow><mn>0</mn></mrow></msub><msup><mrow><mo>|</mo></mrow><mrow><mn>2</mn></mrow></msup></math></span> is smaller than the modulus.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"298 ","pages":"Article 105169"},"PeriodicalIF":1.0,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140609867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Model checking timed recursive CTL","authors":"Florian Bruse,&nbsp;Martin Lange","doi":"10.1016/j.ic.2024.105168","DOIUrl":"https://doi.org/10.1016/j.ic.2024.105168","url":null,"abstract":"<div><p>We introduce Timed Recursive CTL, a merger of two extensions of the well-known branching-time logic CTL: Timed CTL is interpreted over real-time systems like timed automata; Recursive CTL introduces a powerful recursion operator which takes the expressiveness of this logic CTL well beyond that of regular properties. The result is an expressive logic for real-time properties. We show that its model checking problem is decidable over timed automata, namely 2-EXPTIME-complete.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"298 ","pages":"Article 105168"},"PeriodicalIF":1.0,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540124000336/pdfft?md5=e0944002710ef9bea65dbc962149ddfc&pid=1-s2.0-S0890540124000336-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140558984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}