Foundations of Software Science and Computation Structure最新文献

Clones, closed categories, and combinatory logic 克隆、封闭范畴和组合逻辑

Foundations of Software Science and Computation Structure Pub Date : 2024-05-02 DOI: 10.1007/978-3-031-57231-9_8

Philip Saville

引用次数: 0

Coverability in 2-VASS with One Unary Counter is in NP 具有一个一元计数器的2-VASS的可复盖性是NP

Foundations of Software Science and Computation Structure Pub Date : 2023-01-31 DOI: 10.48550/arXiv.2301.13543

Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki

{"title":"Coverability in 2-VASS with One Unary Counter is in NP","authors":"Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki","doi":"10.48550/arXiv.2301.13543","DOIUrl":"https://doi.org/10.48550/arXiv.2301.13543","url":null,"abstract":"Coverability in Petri nets finds applications in verification of safety properties of reactive systems. We study coverability in the equivalent model: Vector Addition Systems with States (VASS). A k-VASS can be seen as k counters and a finite automaton whose transitions are labelled with k integers. Counter values are updated by adding the respective transition labels. A configuration in this system consists of a state and k counter values. Importantly, the counters are never allowed to take negative values. The coverability problem asks whether one can traverse the k-VASS from the initial configuration to a configuration with at least the counter values of the target. In a well-established line of work on k-VASS, coverability in 2-VASS is already PSPACE-hard when the integer updates are encoded in binary. This lower bound limits the practicality of applications, so it is natural to focus on restrictions. In this paper we initiate the study of 2-VASS with one unary counter. Here, one counter receives binary encoded updates and the other receives unary encoded updates. Our main result is that coverability in 2-VASS with one unary counter is in NP. This improves upon the inherited state-of-the-art PSPACE upper bound. Our main technical contribution is that one only needs to consider runs in a certain compressed linear form.","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128462416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report) 规则模式与同步计数的快速匹配(技术报告)

Foundations of Software Science and Computation Structure Pub Date : 2023-01-30 DOI: 10.48550/arXiv.2301.12851

L. Holík, J. Síč, Lenka Turonová, Tomáš Vojnar

引用次数: 1

Quantitative Safety and Liveness 安全性和活动性

Foundations of Software Science and Computation Structure Pub Date : 2023-01-26 DOI: 10.48550/arXiv.2301.11175

T. Henzinger, Nicolas Mazzocchi, N. Saraç

{"title":"Quantitative Safety and Liveness","authors":"T. Henzinger, Nicolas Mazzocchi, N. Saraç","doi":"10.48550/arXiv.2301.11175","DOIUrl":"https://doi.org/10.48550/arXiv.2301.11175","url":null,"abstract":"Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be $min$-decomposed into safety and liveness parts, or alternatively, $max$-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states.","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115103056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Unboundedness problems for machines with reversal-bounded counters 具有反向有界计数器的机器的无界性问题

Foundations of Software Science and Computation Structure Pub Date : 2023-01-24 DOI: 10.48550/arXiv.2301.10198

Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, O. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche

{"title":"Unboundedness problems for machines with reversal-bounded counters","authors":"Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, O. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche","doi":"10.48550/arXiv.2301.10198","DOIUrl":"https://doi.org/10.48550/arXiv.2301.10198","url":null,"abstract":"We consider a general class of decision problems concerning formal languages, called ``(one-dimensional) unboundedness predicates'', for automata that feature reversal-bounded counters (RBCA). We show that each problem in this class reduces -- non-deterministically in polynomial time -- to the same problem for just finite automata. We also show an analogous reduction for automata that have access to both a pushdown stack and reversal-bounded counters (PRBCA). This allows us to answer several open questions: For example, we show that it is coNP-complete to decide whether a given (P)RBCA language $L$ is bounded, meaning whether there exist words $w_1,ldots,w_n$ with $Lsubseteq w_1^*cdots w_n^*$. For PRBCA, even decidability was open. Our methods also show that there is no language of a (P)RBCA of intermediate growth. This means, the number of words of each length grows either polynomially or exponentially. Part of our proof is likely of independent interest: We show that one can translate an RBCA into a machine with $mathbb{Z}$-counters in logarithmic space, while preserving the accepted language.","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124265431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Weighted and Branching Bisimilarities from Generalized Open Maps 广义开映射的加权和分支双相似度

Foundations of Software Science and Computation Structure Pub Date : 2023-01-17 DOI: 10.48550/arXiv.2301.07004

Jérémy Dubut, Thorsten Wißmann

引用次数: 0

On the Comparison of Discounted-Sum Automata with Multiple Discount Factors 多折现因子的折现和自动机的比较

Foundations of Software Science and Computation Structure Pub Date : 2023-01-10 DOI: 10.1007/978-3-031-30829-1_18

Udi Boker, G. Hefetz

引用次数: 2

A programming language characterizing quantum polynomial time 描述量子多项式时间的一种编程语言

Foundations of Software Science and Computation Structure Pub Date : 2022-12-13 DOI: 10.48550/arXiv.2212.06656

Emmanuel Hainry, Romain P'echoux, M'ario Silva

引用次数: 3

On History-Deterministic One-Counter Nets 论历史决定论的单counter网

Foundations of Software Science and Computation Structure Pub Date : 2022-10-18 DOI: 10.48550/arXiv.2210.10084

Aditya Prakash, K. S. Thejaswini

引用次数: 3

Pebble minimization: the last theorems 卵石最小化:最后一个定理

Foundations of Software Science and Computation Structure Pub Date : 2022-10-05 DOI: 10.48550/arXiv.2210.02426

Gaetan Dou'eneau-Tabot

引用次数: 5