Filters








198 Hits in 2.7 sec

Completeness and Incompleteness of Synchronous Kleene Algebra [chapter]

Jana Wagemaker, Marcello Bonsangue, Tobias Kappé, Jurriaan Rot, Alexandra Silva
2019 Lecture Notes in Computer Science  
Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lock-step.  ...  We provide a countermodel witnessing that the axioms of SKA are incomplete w.r.t. its language semantics, by exploiting a lack of interaction between the synchronous product operator and the Kleene star  ...  Acknowledgements The first author is grateful for discussions with Hans-Dieter Hiep and Benjamin Lion.  ... 
doi:10.1007/978-3-030-33636-3_14 fatcat:bwa44fghl5cifdzjbbvkrjvflm

Synchronous Kleene algebra

Cristian Prisacariu
2010 The Journal of Logic and Algebraic Programming  
The resulting algebraic structure is called synchronous Kleene algebra. Models are given in terms of sets of synchronous strings and finite automata accepting synchronous strings.  ...  The extension of synchronous Kleene algebra with Boolean tests is presented together with models on sets of guarded synchronous strings and the associated automata on guarded synchronous strings.  ...  Several reviewers of earlier drafts of this paper have contributed with useful comments; special thanks go to the careful and meticulous JLAP reviewers.  ... 
doi:10.1016/j.jlap.2010.07.009 fatcat:osi22hgbefcrfleg2vmlbl7dr4

Expressive Completeness of an Event-Pattern Reactive Programming Language [chapter]

César Sánchez, Matteo Slanina, Henny B. Sipma, Zohar Manna
2005 Lecture Notes in Computer Science  
Despite its simplicity and deterministic nature, PAR is expressively complete in the following sense: every event-pattern reactive system that can be described and implemented using finite memory can also  ...  The declarative language PAR allows the expression of complex event-pattern reactions.  ...  First, the semantic domain is more complex since output, completion and synchronization with the input have to be considered.  ... 
doi:10.1007/11562436_39 fatcat:dkntx7bjvvbm5lmpi2p2uu5miy

Book announcements

1984 Discrete Applied Mathematics  
Reif On the power of probabilistic choice in synchronous parallel computations. C. Reutenzuer: Biprefix codes and semisimple algebras. A. Sulwicki: Algorithmic theories of data structures. D.  ...  Koubek: A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties. J. V. Guttag, D. Kapur and D.R.  ... 
doi:10.1016/0166-218x(84)90070-2 fatcat:75txrigmzzaw5ef5itdxwfbdea

Concurrent Kleene Algebra with Observations: from Hypotheses to Completeness [article]

Tobias Kappé and Paul Brunet and Alexandra Silva and Jana Wagemaker and Fabio Zanasi
2020 arXiv   pre-print
In this paper we provide a solution in the form of Concurrent Kleene Algebra with Observations (CKAO). Our main contribution is a completeness theorem for CKAO.  ...  Concurrent Kleene Algebra (CKA) extends basic Kleene algebra with a parallel composition operator, which enables reasoning about concurrent programs.  ...  Jana Wagemaker, Marcello Bonsangue, Tobias Kapp, Jurriaan Rot, and Alexandra Silva. Completeness and incompleteness of synchronous Kleene algebra. In MPC, 2019. doi:10.1007/978-3-030-33636-3_14.  ... 
arXiv:2002.09682v1 fatcat:uv4z53k755hd7kiubof4ijoazi

Polymorphic Iterable Sequential Effect Systems [article]

Colin S. Gordon
2020 arXiv   pre-print
Finally, we consider the relationship between sequential effects and Kleene Algebras, where the latter may be used as instances of the former.  ...  By contrast, sequential effect systems -- where the order of effects is important -- lack an established algebraic structure on effects.  ...  ACKNOWLEDGMENTS We thank the anonymous TOPLAS reviewers for remarkably careful, thorough, and constructive feedback on both presentation and technical developments in earlier drafts of this paper.  ... 
arXiv:1808.02010v5 fatcat:bkel27dtkffujjumvlnfkcwway

On incomplete and synchronizing finite sets [article]

Arturo Carpi, Flavio D'Alessandro
2016 arXiv   pre-print
This paper situates itself in the theory of variable length codes and of finite automata where the concepts of completeness and synchronization play a central role.  ...  In this theoretical setting, we investigate the problem of finding upper bounds to the minimal length of synchronizing words and incompletable words of a finite language X in terms of the length of the  ...  Let X be a set of words on an alphabet A and let X * be its Kleene closure. The set X is complete if any word on the alphabet A is a factor of some word belonging to X * , otherwise it is incomplete.  ... 
arXiv:1612.07881v1 fatcat:dkcru6rhbrh2tid5tlubold32u

Degrees of Unsolvability [chapter]

Klaus Ambos-Spies, Peter A. Fejer
2014 Handbook of the History of Logic  
We finish our history by quoting Gerald Sacks, who through his own work and the work of his students (including, Harrington, Robinson, Shore, Simpson, Slaman, and Thomason) shaped degree theory throughout  ...  a good part of its existence: "Farewell to higher recursion theory, but not to recursion theory; there is no way to say good-bye to recursion theory" ( [Sacks, 1999] ).  ...  completely is in Kleene's Introduction to Metamathematics [Kleene, 1952] .  ... 
doi:10.1016/b978-0-444-51624-4.50010-1 fatcat:clf7varewrh6lc4jq2c2sp6pgy

On complexity and optimization of expensive queries in complex event processing

Haopeng Zhang, Yanlei Diao, Neil Immerman
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
A thorough case study on Hadoop cluster monitoring further demonstrates the efficiency and effectiveness of our proposed techniques.  ...  strategies, and events with imprecise timestamps.  ...  of events; and Kleene closure for collecting a finite yet unbounded number of events.  ... 
doi:10.1145/2588555.2593671 dblp:conf/sigmod/ZhangDI14 fatcat:3gx55ealy5cflbd2lrp4eew7ji

Computing Models for Distributed Autonomic Clouds and Grids in the Context of the DIME Network Architecture

Eugene Eberbach, Rao Mikkilineni, Giovanni Morana
2012 2012 IEEE 21st International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises  
This paper presents an overview of computing models for a very important class of distributed systems: autonomic grids and clouds.  ...  We present the DIME network architecture as a representative of this still relatively new class of computing. We attempt to capture its potentials by formal modeling and emerging properties.  ...  Like the majority of process algebras, the ʌ-calculus uses a synchronous message-passing by handshaking and allows to model dynamic mobile networks by re-configurable communication channels.  ... 
doi:10.1109/wetice.2012.10 dblp:conf/wetice/EberbachMM12 fatcat:dufoixhztfc3ncz2vkiczof5gu

Master index volumes 131–140

1995 Theoretical Computer Science  
BernBtsky, Equational properties of Kleene algebras of relations with conversion Hansen, M.R., P.K. Pandya and Z. Chaochen, Finite divergence Harju, T., H.C.M. Kleijn, M. Latteux and A.  ...  Lakshmanan, Intuitionistic interpretation of deductive databases with incomplete information 133 (2) (1994) 267-306 Dougherty, D.J. and P.  ... 
doi:10.1016/0304-3975(95)90075-6 fatcat:dziab64mwne4bbzkayoezzm4gy

Subject index volumes 1–200

1999 Theoretical Computer Science  
algebraic laws, 3432 inference rules for order dependency, 524 sound and complete sets of inference rules, 1167 simple loop check, 1605 sound and complete tableau proof system, 1779 sound and complete  ...  Rosenkrantz and -, 656 and Riguet's relational algebra, 307 classical representation theorem, 3499 fixed point theorem, 3023 Tarski's proof, 482 of lattice completeness, 482 Tarski's ,3340 explicit -,  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

A Process Algebra for Supervisory Coordination

Jos Baeten, Bert van Beek, Allan van Hulst, Jasen Markovski
2011 Electronic Proceedings in Theoretical Computer Science  
We model both event-based and state-based observations using process algebra and bisimulation-based semantics.  ...  A supervisory controller controls and coordinates the behavior of different components of a complex machine by observing their discrete behaviour.  ...  complete history of observed events.  ... 
doi:10.4204/eptcs.60.3 fatcat:4im6fplfibb7pnrywdeuxzvhca

Theses for Computation and Recursion on Concrete and Abstract Structures [chapter]

Solomon Feferman
2015 Turing's Revolution  
The main aim of this article is to examine proposed theses for computation and recursion on concrete and abstract structures.  ...  Informal and principled arguments for CT on concrete structures are reviewed.  ...  (Tucker and Zucker (2000) , p. 494, italics in the original.) In other words, these authors and I are in complete agreement with the view asserted at the end of the preceding section.  ... 
doi:10.1007/978-3-319-22156-4_4 fatcat:enmthkhf65gefgall34djoykxy

Reference list of indexed articles

1999 Theoretical Computer Science  
Tang, Kleene chain completeness and tixedpoint properties 23 (3) (1983) 317-331 483. H. Volger.  ...  A simple proof for the completeness of Floyd's method 35 (2-3) (1985) 345-348 M. Broy, On the Herbrand-Kleene universe for nondeterministic computations 36 (1) (1985) I-19 J.  ... 
doi:10.1016/s0304-3975(98)00320-x fatcat:bdgg2ekzdjahdo7g2gtwbdye6m
« Previous Showing results 1 — 15 out of 198 results