Logical Methods in Computer Science最新文献

筛选
英文 中文
Node Replication: Theory And Practice 节点复制:理论与实践
IF 0.6 4区 数学
Logical Methods in Computer Science Pub Date : 2024-01-23 DOI: 10.46298/lmcs-20(1:5)2024
D. Kesner, Loïc Peyrot, Daniel Ventura
{"title":"Node Replication: Theory And Practice","authors":"D. Kesner, Loïc Peyrot, Daniel Ventura","doi":"10.46298/lmcs-20(1:5)2024","DOIUrl":"https://doi.org/10.46298/lmcs-20(1:5)2024","url":null,"abstract":"We define and study a term calculus implementing higher-order node\u0000replication. It is used to specify two different (weak) evaluation strategies:\u0000call-by-name and fully lazy call-by-need, that are shown to be observationally\u0000equivalent by using type theoretical technical tools.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2024-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139603983","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}
引用次数: 0
A categorical characterization of relative entropy on standard Borel spaces 标准Borel空间上相对熵的分类表征
4区 数学
Logical Methods in Computer Science Pub Date : 2023-11-09 DOI: 10.46298/lmcs-19(4:10)2023
Nicolas Gagne, Prakash Panangaden
{"title":"A categorical characterization of relative entropy on standard Borel spaces","authors":"Nicolas Gagne, Prakash Panangaden","doi":"10.46298/lmcs-19(4:10)2023","DOIUrl":"https://doi.org/10.46298/lmcs-19(4:10)2023","url":null,"abstract":"We give a categorical treatment, in the spirit of Baez and Fritz, of relative entropy for probability distributions defined on standard Borel spaces. We define a category suitable for reasoning about statistical inference on standard Borel spaces. We define relative entropy as a functor into Lawvere's category and we show convexity, lower semicontinuity and uniqueness.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135191531","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}
引用次数: 0
Token Games and History-Deterministic Quantitative-Automata 代币博弈与历史确定性定量自动机
4区 数学
Logical Methods in Computer Science Pub Date : 2023-11-03 DOI: 10.46298/lmcs-19(4:8)2023
Udi Boker, Karoliina Lehtinen
{"title":"Token Games and History-Deterministic Quantitative-Automata","authors":"Udi Boker, Karoliina Lehtinen","doi":"10.46298/lmcs-19(4:8)2023","DOIUrl":"https://doi.org/10.46298/lmcs-19(4:8)2023","url":null,"abstract":"A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties, history-deterministic automata are useful in solving games and synthesis problems. Deciding whether a given nondeterministic automaton is history-deterministic (the HDness problem) is generally a difficult task, which can involve an exponential procedure, or even be undecidable, as is the case for example with pushdown automata. Token games provide a PTime solution to the HDness problem of B\"uchi and coB\"uchi automata, and it is conjectured that 2-token games characterise HDness for all $omega$-regular automata. We extend token games to the quantitative setting and analyse their potential to help deciding HDness of quantitative automata. In particular, we show that 1-token games characterise HDness for all quantitative (and Boolean) automata on finite words, as well as discounted-sum (DSum), Inf and Reachability automata on infinite words, and that 2-token games characterise HDness of LimInf and LimSup automata, as well as Sup automata on infinite words. Using these characterisations, we provide solutions to the HDness problem of Safety, Reachability, Inf and Sup automata on finite and infinite words in PTime, of DSum automata on finite and infinite words in NP$cap$co-NP, of LimSup automata in quasipolynomial time, and of LimInf automata in exponential time, where the latter two are only polynomial for automata with a logarithmic number of weights.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135819917","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}
引用次数: 0
The Power-Set Construction for Tree Algebras 树代数的幂集构造
4区 数学
Logical Methods in Computer Science Pub Date : 2023-11-03 DOI: 10.46298/lmcs-19(4:9)2023
Achim Blumensath
{"title":"The Power-Set Construction for Tree Algebras","authors":"Achim Blumensath","doi":"10.46298/lmcs-19(4:9)2023","DOIUrl":"https://doi.org/10.46298/lmcs-19(4:9)2023","url":null,"abstract":"We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For non-linear ones, we prove that such a distributive law does not exist.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135819355","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}
引用次数: 0
A coherent differential PCF 相干差分PCF
4区 数学
Logical Methods in Computer Science Pub Date : 2023-10-26 DOI: 10.46298/lmcs-19(4:7)2023
Thomas Ehrhard
{"title":"A coherent differential PCF","authors":"Thomas Ehrhard","doi":"10.46298/lmcs-19(4:7)2023","DOIUrl":"https://doi.org/10.46298/lmcs-19(4:7)2023","url":null,"abstract":"The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential linear logic are concerned, these models feature finite non-determinism and indeed these languages are essentially non-deterministic. In a previous paper we introduced a categorical framework for differentiation which does not require additivity and is compatible with deterministic models such as coherence spaces and probabilistic models such as probabilistic coherence spaces. Based on this semantics we develop a syntax of a deterministic version of the differential lambda-calculus. One nice feature of this new approach to differentiation is that it is compatible with general fixpoints of terms, so our language is actually a differential extension of PCF for which we provide a fully deterministic operational semantics.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136377028","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}
引用次数: 0
Subgame-perfect Equilibria in Mean-payoff Games (journal version) 平均收益博弈中的次级完美均衡(期刊版)
4区 数学
Logical Methods in Computer Science Pub Date : 2023-10-25 DOI: 10.46298/lmcs-19(4:6)2023
Léonard Brice, Marie van den Bogaard, Jean-François Raskin
{"title":"Subgame-perfect Equilibria in Mean-payoff Games (journal version)","authors":"Léonard Brice, Marie van den Bogaard, Jean-François Raskin","doi":"10.46298/lmcs-19(4:6)2023","DOIUrl":"https://doi.org/10.46298/lmcs-19(4:6)2023","url":null,"abstract":"In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the notion of negotiation function. We establish that the plays that are supported by SPEs are exactly those that are consistent with a fixed point of the negotiation function. Finally, we use that characterization to prove that the SPE threshold problem, who status was left open in the literature, is decidable.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135112705","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}
引用次数: 0
Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library 验证基于效果处理程序的逐运行定义反向模式AD库
4区 数学
Logical Methods in Computer Science Pub Date : 2023-10-23 DOI: 10.46298/lmcs-19(4:5)2023
Paulo Emílio de Vilhena, François Pottier
{"title":"Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library","authors":"Paulo Emílio de Vilhena, François Pottier","doi":"10.46298/lmcs-19(4:5)2023","DOIUrl":"https://doi.org/10.46298/lmcs-19(4:5)2023","url":null,"abstract":"We apply program verification technology to the problem of specifying and verifying automatic differentiation (AD) algorithms. We focus on define-by-run, a style of AD where the program that must be differentiated is executed and monitored by the automatic differentiation algorithm. We begin by asking, \"what is an implementation of AD?\" and \"what does it mean for an implementation of AD to be correct?\" We answer these questions both at an informal level, in precise English prose, and at a formal level, using types and logical assertions. After answering these broad questions, we focus on a specific implementation of AD, which involves a number of subtle programming-language features, including dynamically allocated mutable state, first-class functions, and effect handlers. We present a machine-checked proof, expressed in a modern variant of Separation Logic, of its correctness. We view this result as an advanced exercise in program verification, with potential future applications to the verification of more realistic automatic differentiation systems and of other software components that exploit delimited-control effects.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135368327","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}
引用次数: 1
Impure Simplicial Complexes: Complete Axiomatization 不纯单纯复合体:完全公理化
4区 数学
Logical Methods in Computer Science Pub Date : 2023-10-18 DOI: 10.46298/lmcs-19(4:3)2023
Rojo Randrianomentsoa, Hans van Ditmarsch, Roman Kuznets
{"title":"Impure Simplicial Complexes: Complete Axiomatization","authors":"Rojo Randrianomentsoa, Hans van Ditmarsch, Roman Kuznets","doi":"10.46298/lmcs-19(4:3)2023","DOIUrl":"https://doi.org/10.46298/lmcs-19(4:3)2023","url":null,"abstract":"Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed under containment. Pure simplicial complexes describe message passing in asynchronous systems where all processes (agents) are alive, whereas impure simplicial complexes describe message passing in synchronous systems where processes may be dead (have crashed). Properties of impure simplicial complexes can be described in a three-valued multi-agent epistemic logic where the third value represents formulae that are undefined, e.g., the knowledge and local propositions of dead agents. In this work we present an axiomatization for the logic of the class of impure complexes and show soundness and completeness. The completeness proof involves the novel construction of the canonical simplicial model and requires a careful manipulation of undefined formulae.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135823571","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}
引用次数: 0
Locality and Centrality: The Variety ZG 局部性与中心性:品种ZG
4区 数学
Logical Methods in Computer Science Pub Date : 2023-10-18 DOI: 10.46298/lmcs-19(4:4)2023
Antoine Amarilli, Charles Paperman
{"title":"Locality and Centrality: The Variety ZG","authors":"Antoine Amarilli, Charles Paperman","doi":"10.46298/lmcs-19(4:4)2023","DOIUrl":"https://doi.org/10.46298/lmcs-19(4:4)2023","url":null,"abstract":"We study the variety ZG of monoids where the elements that belong to a group are central, i.e., commute with all other elements. We show that ZG is local, that is, the semidirect product ZG * D of ZG by definite semigroups is equal to LZG, the variety of semigroups where all local monoids are in ZG. Our main result is thus: ZG * D = LZG. We prove this result using Straubing's delay theorem, by considering paths in the category of idempotents. In the process, we obtain the characterization ZG = MNil vee Com, and also characterize the ZG languages, i.e., the languages whose syntactic monoid is in ZG: they are precisely the languages that are finite unions of disjoint shuffles of singleton languages and regular commutative languages.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135823692","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}
引用次数: 2
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy 在无领导的会合协议中找到切断是很容易的
4区 数学
Logical Methods in Computer Science Pub Date : 2023-10-12 DOI: 10.46298/lmcs-19(4:2)2023
A. R. Balasubramanian, Javier Esparza, Mikhail Raskin
{"title":"Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy","authors":"A. R. Balasubramanian, Javier Esparza, Mikhail Raskin","doi":"10.46298/lmcs-19(4:2)2023","DOIUrl":"https://doi.org/10.46298/lmcs-19(4:2)2023","url":null,"abstract":"In rendez-vous protocols an arbitrarily large number of indistinguishable finite-state agents interact in pairs. The cut-off problem asks if there exists a number $B$ such that all initial configurations of the protocol with at least $B$ agents in a given initial state can reach a final configuration with all agents in a given final state. In a recent paper (Horn and Sangnier, CONCUR 2020), Horn and Sangnier proved that the cut-off problem is decidable (and at least as hard as the Petri net reachability problem) for protocols with a leader, and in EXPSPACE for leaderless protocols. Further, for the special class of symmetric protocols they reduce these bounds to PSPACE and NP, respectively. The problem of lowering these upper bounds or finding matching lower bounds was left open. We show that the cut-off problem is P-complete for leaderless protocols and in NC for leaderless symmetric protocols. Further, we also consider a variant of the cut-off problem suggested in (Horn and Sangnier, CONCUR 2020), which we call the bounded-loss cut-off problem and prove that this problem is P-complete for leaderless protocols and NL-complete for leaderless symmetric protocols. Finally, by reusing some of the techniques applied for the analysis of leaderless protocols, we show that the cut-off problem for symmetric protocols with a leader is NP-complete, thereby improving upon all the elementary upper bounds of (Horn and Sangnier, CONCUR 2020).","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136013493","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信