Journal of Logical and Algebraic Methods in Programming最新文献_第4页

Advancing orchestration synthesis for contract automata 推进合约自动机的协调合成

IF 0.7 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-06-15 DOI: 10.1016/j.jlamp.2024.100998

Davide Basile, Maurice H. ter Beek

{"title":"Advancing orchestration synthesis for contract automata","authors":"Davide Basile, Maurice H. ter Beek","doi":"10.1016/j.jlamp.2024.100998","DOIUrl":"10.1016/j.jlamp.2024.100998","url":null,"abstract":"<div><p>Contract automata allow to formally define the behaviour of service contracts in terms of service offers and requests, some of which are moreover optional and some of which are necessary. A composition of contracts is said to be in agreement if all service requests are matched by corresponding offers. Whenever a composition of contracts is not in agreement, it can be refined to reach an agreement using the orchestration synthesis algorithm. This algorithm is a variant of the synthesis algorithm used in supervisory control theory and it is based on the fact that optional transitions are controllable, whereas necessary transitions are at most semi-controllable and cannot always be controlled. In this paper, we present advancements of the orchestration synthesis for contract automata. Notably, we identify the existing limits of the orchestration synthesis and propose a novel orchestration synthesis along with additional constructs to enhance the expressiveness and scalability of contract automata. The proposed advancements have been implemented and experimented on two case studies, one of which originates from the railway domain and the other is a card game.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"141 ","pages":"Article 100998"},"PeriodicalIF":0.7,"publicationDate":"2024-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141398517","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 logical approach to graph databases 图形数据库的逻辑方法

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-06-13 DOI: 10.1016/j.jlamp.2024.100997

Elvira Pino, Fernando Orejas, Nikos Mylonakis, Edelmira Pasarella

{"title":"A logical approach to graph databases","authors":"Elvira Pino, Fernando Orejas, Nikos Mylonakis, Edelmira Pasarella","doi":"10.1016/j.jlamp.2024.100997","DOIUrl":"10.1016/j.jlamp.2024.100997","url":null,"abstract":"<div><p>Graph databases are now playing an important role because they allow us to overcome some limitations of relational databases. In particular, in graph databases we are interested not only on the data contained but also on its topology. As a consequence, most graph database queries are navigational, asking whether some nodes are connected by edges or paths.</p><p>Up to now, most foundational work has concentrated on the study of computational models and query languages, analyzing their expressivity, computability, and complexity. However, in our work we address a different kind of foundational work. We are not concerned with expressibility, efficiency or feasibility issues, but with correctness. More precisely, given an algorithm or an implementation for solving queries, how can we be sure that the answers obtained are correct (soundness) and that all possible correct answers are obtained by our implementation (completeness).</p><p>In this sense, in this paper we first present a core query language, similar to Cypher or G-Core. Then, we define a simple logic whose formulas are precisely the database queries, and whose satisfaction relation defines what is a correct answer. Finally, we define an operational semantics, which could be seen as an abstract implementation of our language, showing that the semantics is correct, i.e. sound and complete with respect to our logic.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"141 ","pages":"Article 100997"},"PeriodicalIF":0.9,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141404297","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

Optimizing term rewriting with creeper trace transducers 利用爬行跟踪转换器优化术语重写

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-05-31 DOI: 10.1016/j.jlamp.2024.100987

Rick Erkens

引用次数: 0

A logical account of subtyping for session types 会话类型子类型的逻辑说明

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-05-28 DOI: 10.1016/j.jlamp.2024.100986

Ross Horne , Luca Padovani

引用次数: 0

Controlling stormwater detention ponds under partial observability 在部分可观测条件下控制暴雨蓄水池

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-05-21 DOI: 10.1016/j.jlamp.2024.100979

Esther H. Kim, Martijn A. Goorden, Kim G. Larsen, Thomas D. Nielsen

{"title":"Controlling stormwater detention ponds under partial observability","authors":"Esther H. Kim, Martijn A. Goorden, Kim G. Larsen, Thomas D. Nielsen","doi":"10.1016/j.jlamp.2024.100979","DOIUrl":"10.1016/j.jlamp.2024.100979","url":null,"abstract":"<div><p>Stormwater detention ponds play an important role in urban water management for collecting and conveying rainfall runoff from urban catchment areas to nearby streams. Their purpose is not only to avoid flooding but also to reduce stream erosion and degradation caused by the direct discharge of pollutants to the stream. We model the problem of controlling the discharge rate of water from the ponds as a partially observable hybrid Markov decision process and subsequently use <span>Uppaal Stratego</span> for synthesizing safe and near optimal control strategies. The generated strategies are based on noisy sensor measurements of the water height in the pond, hence the underlying system is only partially observable. We present results analyzing how sensitive the synthesized strategies are with respect to the accuracy of the measurement sensors in both offline and online settings. These types of analyses not only provide insight into the robustness of the generated strategies, but they can also be used for deciding on which measurement sensors to use, thereby balancing sensor cost and accuracy.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"141 ","pages":"Article 100979"},"PeriodicalIF":0.9,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352220824000336/pdfft?md5=9bbbbf2738bc98b9610d871cccaf8c97&pid=1-s2.0-S2352220824000336-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141144083","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}

引用次数: 0

Bunch theory: Axioms, logic, applications and model 束理论：公理、逻辑、应用和模型

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-05-15 DOI: 10.1016/j.jlamp.2024.100977

Bill Stoddart , Steve Dunne , Chunyan Mu , Frank Zeyda

{"title":"Bunch theory: Axioms, logic, applications and model","authors":"Bill Stoddart , Steve Dunne , Chunyan Mu , Frank Zeyda","doi":"10.1016/j.jlamp.2024.100977","DOIUrl":"10.1016/j.jlamp.2024.100977","url":null,"abstract":"<div><p>In his book <em>A practical theory of programming</em> <span>[10]</span>, <span>[12]</span>, Eric Hehner proposes and applies a radical reformulation of set theory in which the collection and packaging of elements are seen as separate activities. This provides for unpackaged collections, referred to as “bunches”. Bunches allow us to reason about non-determinism at the level of terms, and, very remarkably, allow us to reason about the conceptual entity “nothing”, which is just an empty bunch (and very different from an empty set). This eliminates mathematical “gaps” caused by undefined terms. We have made use of bunches in a number of papers that develop a refinement calculus for backtracking programs. We formulate our bunch theory as an extension of the set theory used in the B-Method, and provide a denotational model to give this formulation a sound mathematical basis. We replace the classical logic that underpins B with a version that is still able to prove the laws of our logic toolkit, but is unable to prove the property, derivable in classical logic, that every term denotes an element, which for us is pathological since we hold that terms such as 1/0 simply denote “nothing”. This change facilitates our ability to reason about partial functions and backtracking programs. We include a section on our backtracking program calculus, showing how it is derived from WP and how bunch theory simplifies its formulation. We illustrate its use with two small case studies.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"140 ","pages":"Article 100977"},"PeriodicalIF":0.9,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352220824000312/pdfft?md5=ca874c97c090c6c332b31c73bdbde60a&pid=1-s2.0-S2352220824000312-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141035057","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}

引用次数: 0

Succinct ordering and aggregation constraints in algebraic array theories 代数阵列理论中的简洁排序和聚合约束

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-05-14 DOI: 10.1016/j.jlamp.2024.100978

Rodrigo Raya , Viktor Kunčak

引用次数: 0

Realizability modulo theories 可实现性模态理论

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-05-09 DOI: 10.1016/j.jlamp.2024.100971

Andoni Rodríguez , César Sánchez

{"title":"Realizability modulo theories","authors":"Andoni Rodríguez , César Sánchez","doi":"10.1016/j.jlamp.2024.100971","DOIUrl":"10.1016/j.jlamp.2024.100971","url":null,"abstract":"<div><p>In this paper we study the problem of realizability of reactive specifications written in <span><math><msub><mrow><mi>LTL</mi></mrow><mrow><mi>T</mi></mrow></msub></math></span>, which is the extension of LTL where atomic propositions can be literals from a first-order theory, including arithmetic theories. We present a solution based on transforming <span><math><msub><mrow><mi>LTL</mi></mrow><mrow><mi>T</mi></mrow></msub></math></span> specifications into purely Boolean specifications by (1) substituting theory literals by Boolean variables, and (2) computing an additional Boolean formula that captures the dependencies between the new variables imposed by the literals. We prove that the resulting specification is realizable if and only if the original specification is realizable. Moreover, the resulting specification can be passed to existing Boolean off-the-shelf synthesis and realizability tools, which can handle only Boolean LTL specifications.</p><p>A second contribution is to prove that <span><math><msub><mrow><mi>LTL</mi></mrow><mrow><mi>T</mi></mrow></msub></math></span> realizability of theories with a decidable <span><math><msup><mrow><mo>∃</mo></mrow><mrow><mo>⁎</mo></mrow></msup><msup><mrow><mo>∀</mo></mrow><mrow><mo>⁎</mo></mrow></msup></math></span> fragment is decidable for all combinations of LTL temporal modalities. We present a simple version of our method, which relies on SMT solving, and performs a brute-force search to construct the “extra requirement”. A third contribution is an algorithm that checks whether a candidate is a correct <em>Booleanization</em> in non-Boolean LTL realizability.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"140 ","pages":"Article 100971"},"PeriodicalIF":0.9,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141054141","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

Determinism of multirelations 多重关系的决定论

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-05-08 DOI: 10.1016/j.jlamp.2024.100976

Hitoshi Furusawa , Walter Guttmann , Georg Struth

{"title":"Determinism of multirelations","authors":"Hitoshi Furusawa , Walter Guttmann , Georg Struth","doi":"10.1016/j.jlamp.2024.100976","DOIUrl":"10.1016/j.jlamp.2024.100976","url":null,"abstract":"<div><p>Binary multirelations allow modelling alternating nondeterminism, for instance, in games or nondeterministically evolving systems interacting with an environment. Such systems can show partial or total functional behaviour at both levels of alternation, so that nondeterministic behaviour may occur only at one level or both levels, or not at all. We study classes of inner and outer partial and total functional multirelations in a multirelational language based on relation algebra and power allegories. While it is known that general multirelations do not form a category, we show in the multirelational language that the classes of deterministic multirelations mentioned form categories with respect to Peleg composition from concurrent dynamic logic, and sometimes quantaloids. Some of these categories are isomorphic to the category of binary relations. We also introduce determinisation maps that approximate multirelations either by binary relations or by deterministic multirelations. Such maps are useful for defining modal operators on multirelations.</p></div>","PeriodicalId":48797,"journal":{"name":"Journal of Logical and Algebraic Methods in Programming","volume":"139 ","pages":"Article 100976"},"PeriodicalIF":0.9,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352220824000300/pdfft?md5=b0bbae83b171bd8e2197a34c294926eb&pid=1-s2.0-S2352220824000300-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141060560","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}

引用次数: 0

The generalised distribution semantics and projective families of distributions 广义分布语义和分布的投影族

IF 0.9 4区数学

Journal of Logical and Algebraic Methods in Programming Pub Date : 2024-05-07 DOI: 10.1016/j.jlamp.2024.100975

Felix Weitkämper

引用次数: 0