发布求助
文献互助 智能选刊 最新文献

arXiv - CS - Logic in Computer Science最新文献

筛选
英文 中文
Complete Dynamic Logic of Communicating Hybrid Programs 混合通信程序的完整动态逻辑
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-09 DOI: arxiv-2408.05012
Marvin Brieger, Stefan Mitsch, André Platzer
{"title":"Complete Dynamic Logic of Communicating Hybrid Programs","authors":"Marvin Brieger, Stefan Mitsch, André Platzer","doi":"arxiv-2408.05012","DOIUrl":"https://doi.org/arxiv-2408.05012","url":null,"abstract":"This article presents a relatively complete proof calculus for the dynamic\u0000logic of communicating hybrid programs dLCHP. Beyond traditional hybrid systems\u0000mixing discrete and continuous dynamics, communicating hybrid programs feature\u0000parallel interactions of hybrid systems. This not only compounds the subtleties\u0000of hybrid and parallel systems but adds the truly simultaneous synchronized\u0000evolution of parallel hybrid dynamics as a new challenge. To enable\u0000compositional reasoning about communicating hybrid programs nevertheless, dLCHP\u0000combines differential dynamic logic dL and assumption-commitment reasoning. To\u0000maintain the logical essence of dynamic logic axiomatizations, dLCHP's proof\u0000calculus presents a new modal logic view onto ac-reasoning. This modal view\u0000drives a decomposition of classical monolithic proof rules for parallel systems\u0000reasoning into new modular axioms, which yields better flexibility and\u0000simplifies soundness arguments. Adequacy of the proof calculus is shown by two\u0000completeness results: First, dLCHP is complete relative to the logic of\u0000communication traces and differential equation properties. This result proves\u0000the new modular modal view sufficient for reasoning about parallel hybrid\u0000systems, and captures modular strategies for reasoning about concrete parallel\u0000hybrid systems. The second result proof-theoretically aligns dLCHP and dL by\u0000proving that reasoning about parallel hybrid systems is exactly as hard as\u0000reasoning about hybrid systems, continuous systems, or discrete systems. This\u0000completeness result reveals the possibility of representational succinctness in\u0000parallel hybrid systems proofs.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"109 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934532","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}
引用次数: 0
Algorithms for Markov Binomial Chains 马尔可夫二叉链算法
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-09 DOI: arxiv-2408.04902
Alejandro Alarcón Gonzalez, Niel Hens, Tim Leys, Guillermo A. Pérez
{"title":"Algorithms for Markov Binomial Chains","authors":"Alejandro Alarcón Gonzalez, Niel Hens, Tim Leys, Guillermo A. Pérez","doi":"arxiv-2408.04902","DOIUrl":"https://doi.org/arxiv-2408.04902","url":null,"abstract":"We study algorithms to analyze a particular class of Markov population\u0000processes that is often used in epidemiology. More specifically, Markov\u0000binomial chains are the model that arises from stochastic time-discretizations\u0000of classical compartmental models. In this work we formalize this class of\u0000Markov population processes and focus on the problem of computing the expected\u0000time to termination in a given such model. Our theoretical contributions\u0000include proving that Markov binomial chains whose flow of individuals through\u0000compartments is acyclic almost surely terminate. We give a PSPACE algorithm for\u0000the problem of approximating the time to termination and a direct algorithm for\u0000the exact problem in the Blum-Shub-Smale model of computation. Finally, we\u0000provide a natural encoding of Markov binomial chains into a common input\u0000language for probabilistic model checkers. We implemented the latter encoding\u0000and present some initial empirical results showcasing what formal methods can\u0000do for practicing epidemilogists.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934389","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}
引用次数: 0
Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed and Accuracy 部分同步下的近似分布式监控：平衡速度与精度
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-09 DOI: arxiv-2408.05033
Borzoo Bonakdarpour, Anik Momtaz, Dejan Ničković, N. Ege Saraç
{"title":"Approximate Distributed Monitoring under Partial Synchrony: Balancing Speed and Accuracy","authors":"Borzoo Bonakdarpour, Anik Momtaz, Dejan Ničković, N. Ege Saraç","doi":"arxiv-2408.05033","DOIUrl":"https://doi.org/arxiv-2408.05033","url":null,"abstract":"In distributed systems with processes that do not share a global clock,\u0000emph{partial synchrony} is achieved by clock synchronization that guarantees\u0000bounded clock skew among all applications. Existing solutions for distributed\u0000runtime verification under partial synchrony against temporal logic\u0000specifications are exact but suffer from significant computational overhead. In\u0000this paper, we propose an emph{approximate} distributed monitoring algorithm\u0000for Signal Temporal Logic (STL) that mitigates this issue by abstracting away\u0000potential interleaving behaviors. This conservative abstraction enables a\u0000significant speedup of the distributed monitors, albeit with a tradeoff in\u0000accuracy. We address this tradeoff with a methodology that combines our\u0000approximate monitor with its exact counterpart, resulting in enhanced\u0000efficiency without sacrificing precision. We evaluate our approach with\u0000multiple experiments, showcasing its efficacy in both real-world applications\u0000and synthetic examples.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"38 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934531","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}
引用次数: 0
Knowledge Base Embeddings: Semantics and Theoretical Properties 知识库嵌入：语义和理论特性
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-09 DOI: arxiv-2408.04913
Camille Bourgaux, Ricardo Guimarães, Raoul Koudijs, Victor Lacerda, Ana Ozaki
{"title":"Knowledge Base Embeddings: Semantics and Theoretical Properties","authors":"Camille Bourgaux, Ricardo Guimarães, Raoul Koudijs, Victor Lacerda, Ana Ozaki","doi":"arxiv-2408.04913","DOIUrl":"https://doi.org/arxiv-2408.04913","url":null,"abstract":"Research on knowledge graph embeddings has recently evolved into knowledge\u0000base embeddings, where the goal is not only to map facts into vector spaces but\u0000also constrain the models so that they take into account the relevant\u0000conceptual knowledge available. This paper examines recent methods that have\u0000been proposed to embed knowledge bases in description logic into vector spaces\u0000through the lens of their geometric-based semantics. We identify several\u0000relevant theoretical properties, which we draw from the literature and\u0000sometimes generalize or unify. We then investigate how concrete embedding\u0000methods fit in this theoretical framework.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934533","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}
引用次数: 0
The Complexity of Learning Temporal Properties 学习时态特性的复杂性
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-08 DOI: arxiv-2408.04486
Benjamin Bordais, Daniel Neider, Rajarshi Roy
{"title":"The Complexity of Learning Temporal Properties","authors":"Benjamin Bordais, Daniel Neider, Rajarshi Roy","doi":"arxiv-2408.04486","DOIUrl":"https://doi.org/arxiv-2408.04486","url":null,"abstract":"We consider the problem of learning temporal logic formulas from examples of\u0000system behavior. Learning temporal properties has crystallized as an effective\u0000mean to explain complex temporal behaviors. Several efficient algorithms have\u0000been designed for learning temporal formulas. However, the theoretical\u0000understanding of the complexity of the learning decision problems remains\u0000largely unexplored. To address this, we study the complexity of the passive\u0000learning problems of three prominent temporal logics, Linear Temporal Logic\u0000(LTL), Computation Tree Logic (CTL) and Alternating-time Temporal Logic (ATL)\u0000and several of their fragments. We show that learning formulas using an\u0000unbounded amount of occurrences of binary operators is NP-complete for all of\u0000these logics. On the other hand, when investigating the complexity of learning\u0000formulas with bounded amount of occurrences of binary operators, we exhibit\u0000discrepancies between the complexity of learning LTL, CTL and ATL formulas\u0000(with a varying number of agents).","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934534","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}
引用次数: 0
Recomposition: A New Technique for Efficient Compositional Verification 重组：高效组合验证的新技术
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-07 DOI: arxiv-2408.03488
Ian Dardik, April Porter, Eunsuk Kang
{"title":"Recomposition: A New Technique for Efficient Compositional Verification","authors":"Ian Dardik, April Porter, Eunsuk Kang","doi":"arxiv-2408.03488","DOIUrl":"https://doi.org/arxiv-2408.03488","url":null,"abstract":"Compositional verification algorithms are well-studied in the context of\u0000model checking. Properly selecting components for verification is important for\u0000efficiency, yet has received comparatively less attention. In this paper, we\u0000address this gap with a novel compositional verification framework that focuses\u0000on component selection as an explicit, first-class concept. The framework\u0000decomposes a system into components, which we then recompose into new\u0000components for efficient verification. At the heart of our technique is the\u0000recomposition map that determines how recomposition is performed; the component\u0000selection problem thus reduces to finding a good recomposition map. However,\u0000the space of possible recomposition maps can be large. We therefore propose\u0000heuristics to find a small portfolio of recomposition maps, which we then run\u0000in parallel. We implemented our techniques in a model checker for the TLA+\u0000language. In our experiments, we show that our tool achieves competitive\u0000performance with TLC-a well-known model checker for TLA+-on a benchmark suite\u0000of distributed protocols.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"86 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934535","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}
引用次数: 0
Modular assurance of an Autonomous Ferry using Contract-Based Design and Simulation-based Verification Principles 利用基于合同的设计和基于仿真的验证原则为自主渡轮提供模块化保证
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-06 DOI: arxiv-2408.03244
Jon Arne Glomsrud, Stephanie Kemna, Chanjei Vasanthan, Luman Zhao, Dag McGeorge, Tom Arne Pedersen, Tobias Rye Torben, Børge Rokseth, Dong Trong Nguyen
{"title":"Modular assurance of an Autonomous Ferry using Contract-Based Design and Simulation-based Verification Principles","authors":"Jon Arne Glomsrud, Stephanie Kemna, Chanjei Vasanthan, Luman Zhao, Dag McGeorge, Tom Arne Pedersen, Tobias Rye Torben, Børge Rokseth, Dong Trong Nguyen","doi":"arxiv-2408.03244","DOIUrl":"https://doi.org/arxiv-2408.03244","url":null,"abstract":"With the introduction of autonomous technology into our society, e.g.\u0000autonomous shipping, it is important to assess and assure the safety of\u0000autonomous systems in a real-world context. Simulation-based testing is a\u0000common approach to attempt to verify performance of autonomous systems, but\u0000assurance also requires formal evidence. This paper introduces the Assurance of\u0000Digital Assets (ADA) framework, a structured method for the assurance of\u0000digital assets, i.e. novel, complex, or intelligent systems enabled by digital\u0000technologies, using contract-based design. Results are shown for an autonomous\u0000ferry assurance case, focusing on collision avoidance during the ferry's\u0000transit. Further, we discuss the role of simulation-based testing in verifying\u0000compliance to contract specifications, to build the necessary evidence for an\u0000assurance case.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"131 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934536","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}
引用次数: 0
Extension preservation on dense graph classes 密集图类的扩展保持
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-05 DOI: arxiv-2408.02388
Ioannis Eleftheriadis
{"title":"Extension preservation on dense graph classes","authors":"Ioannis Eleftheriadis","doi":"arxiv-2408.02388","DOIUrl":"https://doi.org/arxiv-2408.02388","url":null,"abstract":"Preservation theorems provide a direct correspondence between the syntactic\u0000structure of first-order sentences and the closure properties of their\u0000respective classes of models. A line of work has explored preservation theorems\u0000relativised to combinatorially tame classes of sparse structures [Atserias et\u0000al., JACM 2006; Atserias et al., SiCOMP 2008; Dawar, JCSS 2010; Dawar and\u0000Eleftheriadis, 2024]. In this article we initiate the study of preservation\u0000theorems for dense graph classes. In contrast to the sparse setting, we show\u0000that extension preservation fails on most natural dense classes of low\u0000complexity. Nonetheless, we isolate a technical condition which is sufficient\u0000for extension preservation to hold, providing a dense analogue to a result of\u0000[Atserias et al., SiCOMP 2008].","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"193 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934537","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}
引用次数: 0
Towards an ontology of state actors in cyberspace 建立网络空间国家行为者本体论
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-03 DOI: arxiv-2408.01787
Giacomo De Colle
{"title":"Towards an ontology of state actors in cyberspace","authors":"Giacomo De Colle","doi":"arxiv-2408.01787","DOIUrl":"https://doi.org/arxiv-2408.01787","url":null,"abstract":"To improve cyber threat analysis practices in cybersecurity, I present a plan\u0000to build a formal ontological representation of state actors in cyberspace and\u0000of cyber operations. I argue that modelling these phenomena via ontologies\u0000allows for coherent integration of data coming from diverse sources, automated\u0000reasoning over such data, as well as intelligence extraction and reuse from and\u0000of them. Existing ontological tools in cybersecurity can be ameliorated by\u0000connecting them to neighboring domains such as law, regulations, governmental\u0000institutions, and documents. In this paper, I propose metrics to evaluate\u0000currently existing ontological tools to create formal representations in the\u0000cybersecurity domain, and I provide a plan to develop and extend them when they\u0000are lacking.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934538","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}
引用次数: 0
Characterizing Data Dependencies Then and Now 描述数据依赖关系的过去和现在
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-02 DOI: arxiv-2408.01109
Phokion G. Kolaitis, Andreas Pieris
{"title":"Characterizing Data Dependencies Then and Now","authors":"Phokion G. Kolaitis, Andreas Pieris","doi":"arxiv-2408.01109","DOIUrl":"https://doi.org/arxiv-2408.01109","url":null,"abstract":"Data dependencies are integrity constraints that the data of interest must\u0000obey. During the 1980s, Janos Makowsky made a number of contributions to the\u0000study of data dependencies; in particular, he was the first researcher to\u0000characterize data dependencies in terms of their structural properties. The\u0000goal of this article is to first present an overview of Makowsky's work on\u0000characterizing certain classes of data dependencies and then discuss recent\u0000developments concerning characterizations of broader classes of data\u0000dependencies.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934540","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}
引用次数: 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学术官方微信