Continuous One-counter Automata

IF 0.7 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

ACM Transactions on Computational Logic Pub Date : 2023-01-18 DOI:10.1145/3558549

Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez

引用次数: 0

Abstract

We study the reachability problem for continuous one-counter automata, COCA for short. In such automata, transitions are guarded by upper- and lower-bound tests against the counter value. Additionally, the counter updates associated with taking transitions can be (non-deterministically) scaled down by a nonzero factor between zero and one. Our three main results are as follows: we prove (1) that the reachability problem for COCA with global upper- and lower-bound tests is in NC 2 ; (2) that, in general, the problem is decidable in polynomial time; and (3) that it is NP-complete for COCA with parametric counter updates and bound tests.

查看原文本刊更多论文

连续单计数器自动机

研究连续单计数器自动机(COCA)的可达性问题。在这种自动机中，转换由计数器值的上界和下界测试来保护。此外，与进行转换相关的计数器更新可以(不确定地)按0到1之间的非零因子进行缩放。我们的三个主要结果如下:我们证明(1)具有全局上界和下界检验的COCA可达性问题是在NC 2中;(2)一般情况下，问题在多项式时间内是可判定的;(3)具有参数计数器更新和界检验的COCA是np完全的。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

ACM Transactions on Computational Logic 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： TOCL welcomes submissions related to all aspects of logic as it pertains to topics in computer science. This area has a great tradition in computer science. Several researchers who earned the ACM Turing award have also contributed to this field, namely Edgar Codd (relational database systems), Stephen Cook (complexity of logical theories), Edsger W. Dijkstra, Robert W. Floyd, Tony Hoare, Amir Pnueli, Dana Scott, Edmond M. Clarke, Allen E. Emerson, and Joseph Sifakis (program logics, program derivation and verification, programming languages semantics), Robin Milner (interactive theorem proving, concurrency calculi, and functional programming), and John McCarthy (functional programming and logics in AI). Logic continues to play an important role in computer science and has permeated several of its areas, including artificial intelligence, computational complexity, database systems, and programming languages. The Editorial Board of this journal seeks and hopes to attract high-quality submissions in all the above-mentioned areas of computational logic so that TOCL becomes the standard reference in the field. Both theoretical and applied papers are sought. Submissions showing novel use of logic in computer science are especially welcome.