A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages
[article]

2017
*
arXiv
*
pre-print

We present

arXiv:1704.07199v2
fatcat:exs6e3u5gzf4zg5rtt77einbsa
*a*new automaton model and*a**Kleene*-like*theorem*that relates*a*relaxed version of CKA to series-parallel*pomset**languages*, which are*a*natural candidate*for*the free model. ...*Concurrent**Kleene*Algebra (CKA) is*a*mathematical formalism to study programs that exhibit*concurrent*behaviour. ... Acknowledgements We thank the anonymous reviewers*for*their insightful comments. This work was partially supported by the ERC Starting Grant ProFoundNet (grant code 679127). ...##
###
Brzozowski Goes Concurrent-A Kleene Theorem for Pomset Languages *

unpublished

We present

fatcat:kzabgvys4vb6vehzesexluhfyy
*a*new automaton model and*a**Kleene*-like*theorem*that relates*a*relaxed version of CKA to series-parallel*pomset**languages*, which are*a*natural candidate*for*the free model. ...*Concurrent**Kleene*Algebra (CKA) is*a*mathematical formalism to study programs that exhibit*concurrent*behaviour. ... We thank the anonymous reviewers*for*their insightful comments. ...##
###
Completeness and Incompleteness of Synchronous Kleene Algebra
[chapter]

2019
*
Lecture Notes in Computer Science
*

Synchronous

doi:10.1007/978-3-030-33636-3_14
fatcat:bwa44fghl5cifdzjbbvkrjvflm
*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 then propose an alternative set of axioms*for*SKA, based on Salomaa's axiomatisation of regular*languages*, and show that these provide*a*sound and complete characterisation w.r.t. the original*language*... Acknowledgements The first author is grateful*for*discussions with Hans-Dieter Hiep and Benjamin Lion. ...##
###
Algebraic recognizability of languages
[article]

2006
*
arXiv
*
pre-print

Recognizable

arXiv:cs/0609110v1
fatcat:2fnhr3gu5rdbbdugq76cqfvl4y
*languages*of finite words are part of every computer science cursus, and they are routinely described as*a*cornerstone*for*applications and*for*theory. ... We would like to briefly explore why that is, and how this word-related notion extends to more complex models, such as those developed*for*modeling distributed or timed behaviors. ... To*a*formula ϕ in this*language*, one associates the set L(ϕ) of all words which satisfy ϕ, that is L(ϕ) is the*language*of the finite models of ϕ. The*Kleene*-Nerode-Myhill-Büchi*Theorem*. ...##
###
Algebraic Recognizability of Languages
[chapter]

2004
*
Lecture Notes in Computer Science
*

The notion of recognizable

doi:10.1007/978-3-540-28629-5_8
fatcat:5el7wd3umvgdzhw4dxukeugoci
*languages*is*a*familiar one, associated with classical*theorems*by*Kleene*, Myhill, Nerode, Elgot, Büchi, Schützenberger, etc. ... Recognizable*languages*of finite words are part of every computer science cursus, and they are routinely described as*a*cornerstone*for*applications and*for*theory. ... To*a*formula ϕ in this*language*, one associates the set L(ϕ) of all words which satisfy ϕ, that is L(ϕ) is the*language*of the finite models of ϕ. The*Kleene*-Nerode-Myhill-Büchi*Theorem*. ...##
###
LIPIcs-Leibniz International Proceedings in Informatics

*
28th International Conference on Concurrency Theory CONCUR 2017
*
unpublished

*Goes*

*Concurrent*-

*A*

*Kleene*

*Theorem*

*for*

*Pomset*

*Languages*Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, and Fabio Zanasi . . . . . . . 25:1-25:16 Algebraic Laws

*for*Weak Consistency Andrea ... CONCUR is

*a*forum

*for*the development and dissemination of leading research in

*concurrency*theory and its applications. ...