Results 1  10
of
181,767
Foundations of Concurrent Kleene Algebra
"... A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent execution [10]. In this paper we investigate the abstract background of this law in terms of independence relations on which a concrete trace model of the algebra is b ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent execution [10]. In this paper we investigate the abstract background of this law in terms of independence relations on which a concrete trace model of the algebra
Foundations of Concurrent Kleene Algebra
, 2009
"... Abstract. A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent execution [9]. In this paper we investigate the abstract background of this law in terms of independence relations on which a concrete trace model of the alge ..."
Abstract
 Add to MetaCart
Abstract. A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent execution [9]. In this paper we investigate the abstract background of this law in terms of independence relations on which a concrete trace model
On the elimination of hypotheses in Kleene algebra with tests
, 2002
"... The validity problem for certain universal Horn formulas of Kleene algebra with tests (KAT) can be efficiently reduced to the equational theory. This reduction is known as elimination of hypotheses. Hypotheses are used to describe the interaction of atomic programs and tests and are an essential com ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
The validity problem for certain universal Horn formulas of Kleene algebra with tests (KAT) can be efficiently reduced to the equational theory. This reduction is known as elimination of hypotheses. Hypotheses are used to describe the interaction of atomic programs and tests and are an essential
Hypotheses in Kleene Algebra
, 1994
"... Kleene algebra (an Horn axiomatization of Kleene's algebra of regular events) has proved to be an effective tool for reasoning about programs. Within the algebra, we can reason succinctly about both ordinary safety properties and important program transformations such as loop unwinding, change ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
of data representation, and refinement of atomicity. One of the nice properties of Kleene algebra is that its equational theory has a simple decision procedure. However, to use it for programming applications, we need to reason in the presence of hypotheses stating the equality of certain programs
Universität Augsburg Concurrent Kleene Algebra
, 2009
"... Abstract. A concurrent Kleene algebra offers, next to choice and iteration, two composition operators, one that stands for sequential execution and the other for concurrent execution. They are related by an inequational form of the exchange law. We show the applicability of the algebra to a partiall ..."
Abstract
 Add to MetaCart
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, two composition operators, one that stands for sequential execution and the other for concurrent execution. They are related by an inequational form of the exchange law. We show the applicability of the algebra to a
Probabilistic concurrent kleene algebra
 Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems
, 2013
"... We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automata modulo probabilistic simulation. We use the resu ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automata modulo probabilistic simulation. We use
Synchronous Kleene Algebra vs. Concurrent Kleene Algebra
"... Abstract. In this year’s CONCUR conference Concurrent Kleene Algebra (CKA) is presented as a general formalism for reasoning about concurrent programs. Also recently Synchronous Kleene Algebra (SKA) was investigated by this author with the purpose of representing and reasoning about actions/program ..."
Abstract
 Add to MetaCart
Abstract. In this year’s CONCUR conference Concurrent Kleene Algebra (CKA) is presented as a general formalism for reasoning about concurrent programs. Also recently Synchronous Kleene Algebra (SKA) was investigated by this author with the purpose of representing and reasoning about actions
Kleene algebra with tests: Completeness and decidability
 IN PROC. OF 10TH INTERNATIONAL WORKSHOP ON COMPUTER SCIENCE LOGIC (CSL’96
, 1996
"... Kleene algebras with tests provide a rigorous framework for equational specification and verification. They have been used successfully in basic safety analysis, sourcetosource program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra w ..."
Abstract

Cited by 35 (15 self)
 Add to MetaCart
Kleene algebras with tests provide a rigorous framework for equational specification and verification. They have been used successfully in basic safety analysis, sourcetosource program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra
Semantic foundations of concurrent constraint programming
, 1990
"... Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of storeasconstraint and process as information transducer. The storeasvaluation conception of von Neumann computing is replaced by the notion that the store is a constr ..."
Abstract

Cited by 276 (27 self)
 Add to MetaCart
contribution is to give a simple and general formulation of the notion that a constraint system is a system of partial information (a la the information systems of Scott). Parameter passing and hiding is handled by borrowing ideas from the cylindric algebras of Henkin, Monk and Tarski to introduce
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Results 1  10
of
181,767