Electronic Notes in Theoretical Computer Science最新文献_第2页

Energy Consumption by Servers under Unknown Service Demand 未知服务需求下服务器的能耗

Electronic Notes in Theoretical Computer Science Pub Date : 2020-11-01 DOI: 10.1016/j.entcs.2020.09.017

Ali Alssaiari, Nigel Thomas

引用次数: 1

Performance Modelling of the Impact of Cyber Attacks on a Web-based Sales System 网络攻击对基于网络的销售系统影响的性能建模

Electronic Notes in Theoretical Computer Science Pub Date : 2020-11-01 DOI: 10.1016/j.entcs.2020.09.016

Ohud Almutairi, Nigel Thomas

引用次数: 1

Compositional Model Checking and Model Repair for a Class of Product Form Models 一类产品形态模型的成分模型检验与模型修复

Electronic Notes in Theoretical Computer Science Pub Date : 2020-11-01 DOI: 10.1016/j.entcs.2020.09.021

Amin Soltanieh, Markus Siegle

引用次数: 0

Stochastic Bounds for the Max Flow in a Network with Discrete Random Capacities 离散随机容量网络中最大流量的随机边界

Electronic Notes in Theoretical Computer Science Pub Date : 2020-11-01 DOI: 10.1016/j.entcs.2020.10.014

L. Echabbi , J.M. Fourneau , O. Gacem , H. Lotfi , N. Pekergin

引用次数: 1

Eilenberg-Kelly Reloaded Eilenberg-Kelly重新加载

Electronic Notes in Theoretical Computer Science Pub Date : 2020-10-01 DOI: 10.1016/j.entcs.2020.09.012

Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger

{"title":"Eilenberg-Kelly Reloaded","authors":"Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger","doi":"10.1016/j.entcs.2020.09.012","DOIUrl":"10.1016/j.entcs.2020.09.012","url":null,"abstract":"<div><p>The Eilenberg-Kelly theorem states that a category <span><math><mi>C</mi></math></span> with an object <strong>I</strong> and two functors <span><math><mo>⊗</mo><mo>:</mo><mi>C</mi><mo>×</mo><mi>C</mi><mo>→</mo><mi>C</mi></math></span> and <span><math><mo>⊸</mo><mo>:</mo><msup><mrow><mi>C</mi></mrow><mrow><mi>op</mi></mrow></msup><mo>×</mo><mi>C</mi><mo>→</mo><mi>C</mi></math></span> related by an adjunction <span><math><mo>−</mo><mo>⊗</mo><mi>B</mi><mo>⊣</mo><mi>B</mi><mo>⊸</mo><mo>−</mo></math></span> natural in <em>B</em> is monoidal iff it is closed and moreover the adjunction holds internally. We dissect the proof of this theorem and observe that the necessity for a side condition on closedness arises because the standard definition of closed category is left-skew in regards to associativity. We analyze Street's observation that left-skew monoidality is equivalent to left-skew closedness and establish that monoidality is equivalent to closedness unconditionally under an adjusted definition of closedness that requires normal associativity. We also work out a definition of right-skew closedness equivalent to right-skew monoidality. We give examples of each type of structure; in particular, we look at the Kleisli category of a left-strong monad on a left-skew closed category and the Kleisli category of a lax closed monad on a right-skew closed category. We also view skew and normal monoidal and closed categories as special cases of skew and normal promonoidal categories and take a brief look at left-skew prounital-closed categories.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"352 ","pages":"Pages 233-256"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.09.012","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122656840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Bifibrations of Polycategories and Classical Linear Logic 多范畴的振动与经典线性逻辑

Electronic Notes in Theoretical Computer Science Pub Date : 2020-10-01 DOI: 10.1016/j.entcs.2020.09.003

Nicolas Blanco, Noam Zeilberger

{"title":"Bifibrations of Polycategories and Classical Linear Logic","authors":"Nicolas Blanco, Noam Zeilberger","doi":"10.1016/j.entcs.2020.09.003","DOIUrl":"10.1016/j.entcs.2020.09.003","url":null,"abstract":"<div><p>The main goal of this article is to expose and relate different ways of interpreting the multiplicative fragment of classical linear logic in polycategories. Polycategories are known to give rise to models of classical linear logic in so-called representable polycategories with duals, which ask for the existence of various polymaps satisfying the different universal properties needed to define tensor, par, and negation. We begin by explaining how these different universal properties can all be seen as instances of a single notion of universality of a polymap parameterised by an input or output object, which also generalises the classical notion of universal multimap in a multicategory. We then proceed to introduce a definition of in-cartesian and out-cartesian polymaps relative to a refinement system (= strict functor) of polycategories, in such a way that universal polymaps can be understood as a special case. In particular, we obtain that a polycategory is a representable polycategory with duals if and only if it is bifibred over the terminal polycategory <span><math><mn>1</mn></math></span>. Finally, we present a Grothendieck correspondence between bifibrations of polycategories and pseudofunctors into <strong>MAdj</strong>, the (weak) 2-polycategory of multivariable adjunctions. When restricted to bifibrations over <span><math><mn>1</mn></math></span> we get back the correspondence between *-autonomous categories and Frobenius pseudomonoids in <strong>MAdj</strong> that was recently observed by Shulman.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"352 ","pages":"Pages 29-52"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.09.003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117079878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Parametrized Fixed Points and Their Applications to Session Types 参数化不动点及其在会话类型中的应用

Electronic Notes in Theoretical Computer Science Pub Date : 2020-10-01 DOI: 10.1016/j.entcs.2020.09.008

Ryan Kavanagh

{"title":"Parametrized Fixed Points and Their Applications to Session Types","authors":"Ryan Kavanagh","doi":"10.1016/j.entcs.2020.09.008","DOIUrl":"10.1016/j.entcs.2020.09.008","url":null,"abstract":"<div><p>Parametrized fixed points are of particular interest to denotational semantics and are often given by “dagger operations” [Stephen L. Bloom and Zoltán Ésik, Fixed-Point Operations on ccc's. Part I, Theoretical Computer Science (ISSN 0304-3975) 155 (1996), 1–38, <span>https://doi.org/10.1016/0304-3975(95)00010-0</span><svg><path></path></svg>; Stephen L. Bloom and Zoltán Ésik, Iteration Theories. The Equational Logic of Iterative Processes, in: EATCS Monographs on Theoretical Computer Science, Springer-Verlag Berlin Heidelberg, ISBN 978-3-642-78034-9, 1993, xv+630 pp., <span>https://doi.org/10.1007/978-3-642-78034-9</span><svg><path></path></svg>; Stephen L. Bloom and Zoltán Ésik, Some Equational Laws of Initiality in 2CCC's, International Journal of Foundations of Computer Science 6 (1995) 95–118, <span>https://doi.org/10.1142/S0129054195000081</span><svg><path></path></svg>.]. Dagger operations that satisfy the Conway identities [Stephen L. Bloom and Zoltán Ésik, Fixed-Point Operations on ccc's. Part I, Theoretical Computer Science (ISSN 0304-3975) 155 (1996), 1–38, doi: <span>https://doi.org/10.1016/0304-3975(95)00010-0</span><svg><path></path></svg>.] are particularly useful, because these identities imply a large class of identities used in semantic reasoning. We generalize existing techniques to define dagger operations on <em>ω</em>-categories and on <strong>O</strong>-categories. These operations enjoy a 2-categorical structure that implies the Conway identities. We illustrate these operators by considering applications to the semantics of session-typed languages.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"352 ","pages":"Pages 149-172"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.09.008","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125710648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Domain Theoretic Second-Order Euler's Method for Solving Initial Value Problems 初值问题的域论二阶欧拉解法

Electronic Notes in Theoretical Computer Science Pub Date : 2020-10-01 DOI: 10.1016/j.entcs.2020.09.006

Abbas Edalat , Amin Farjudian , Mina Mohammadian , Dirk Pattinson

{"title":"Domain Theoretic Second-Order Euler's Method for Solving Initial Value Problems","authors":"Abbas Edalat , Amin Farjudian , Mina Mohammadian , Dirk Pattinson","doi":"10.1016/j.entcs.2020.09.006","DOIUrl":"10.1016/j.entcs.2020.09.006","url":null,"abstract":"<div><p>A domain-theoretic method for solving initial value problems (IVPs) is presented, together with proofs of soundness, completeness, and some results on the algebraic complexity of the method. While the common fixed-precision interval arithmetic methods are restricted by the precision of the underlying machine architecture, domain-theoretic methods may be complete, i.e., the result may be obtained to any degree of accuracy. Furthermore, unlike methods based on interval arithmetic which require access to the syntactic representation of the vector field, domain-theoretic methods only deal with the semantics of the field, in the sense that the field is assumed to be given via finitely-representable approximations, to within any required accuracy.</p><p>In contrast to the domain-theoretic first-order Euler method, the second-order method uses the local Lipschitz properties of the field. This is achieved by using a domain for Lipschitz functions, whose elements are consistent pairs that provide approximations of the field and its local Lipschitz properties. In the special case where the field is differentiable, the local Lipschitz properties are exactly the local differential properties of the field. In solving IVPs, Lipschitz continuity of the field is a common assumption, as a sufficient condition for uniqueness of the solution. While the validated methods for solving IVPs commonly impose further restrictions on the vector field, the second-order Euler method requires no further condition. In this sense, the method may be seen as the most general of its kind.</p><p>To avoid complicated notations and lengthy arguments, the results of the paper are stated for the second-order Euler method. Nonetheless, the framework, and the results, may be extended to any higher-order Euler method, in a straightforward way.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"352 ","pages":"Pages 105-128"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.09.006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134102167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

A Complete Equational Axiomatisation of Partial Differentiation 偏微分的完全等式公理化

Electronic Notes in Theoretical Computer Science Pub Date : 2020-10-01 DOI: 10.1016/j.entcs.2020.09.011

Gordon D. Plotkin

引用次数: 1

Towards a Classification of Behavioural Equivalences in Continuous-time Markov Processes 连续时间马尔可夫过程中行为等价的分类

Electronic Notes in Theoretical Computer Science Pub Date : 2020-10-01 DOI: 10.1016/j.entcs.2020.09.004

Linan Chen , Florence Clerc , Prakash Panangaden

引用次数: 1