Results 1  10
of
6,864
Kleene algebra with tests
 Transactions on Programming Languages and Systems
, 1997
"... Abstract. We investigate conditions under which a given Kleene algebra with tests is isomorphic to an algebra of binary relations. Two simple separation properties are identified that, along with starcontinuity, are sufficient for nonstandard relational representation. An algebraic condition is ide ..."
Abstract

Cited by 153 (29 self)
 Add to MetaCart
Abstract. We investigate conditions under which a given Kleene algebra with tests is isomorphic to an algebra of binary relations. Two simple separation properties are identified that, along with starcontinuity, are sufficient for nonstandard relational representation. An algebraic condition
On Kleene Algebras and Closed Semirings
, 1990
"... Kleene algebras are an important class of algebraic structures that arise in diverse areas of computer science: program logic and semantics, relational algebra, automata theory, and the design and analysis of algorithms. The literature contains several inequivalent definitions of Kleene algebras and ..."
Abstract

Cited by 55 (6 self)
 Add to MetaCart
Kleene algebras are an important class of algebraic structures that arise in diverse areas of computer science: program logic and semantics, relational algebra, automata theory, and the design and analysis of algorithms. The literature contains several inequivalent definitions of Kleene algebras
On partially additive Kleene algebras
 In Proc. 8th Int. Conf. Relational Methods in Computer Science (RelMiCS 8
, 2005
"... We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of examples that cannot be handled directly by Kleene algebras. We relate partially additive Kleene algebras to existing al ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of examples that cannot be handled directly by Kleene algebras. We relate partially additive Kleene algebras to existing
Kleene Algebra with Domain
, 2003
"... We propose Kleene algebra with domain (KAD), an extension of Kleene algebra with two equational axioms for a domain and a codomain operation, respectively. KAD considerably augments the expressibility of Kleene algebra, in particular for the specification and analysis of state transition systems. We ..."
Abstract

Cited by 53 (32 self)
 Add to MetaCart
We propose Kleene algebra with domain (KAD), an extension of Kleene algebra with two equational axioms for a domain and a codomain operation, respectively. KAD considerably augments the expressibility of Kleene algebra, in particular for the specification and analysis of state transition systems
Typed Kleene algebra
, 1998
"... In previous work we havefound it necessary to argue that certain theorems of Kleene algebra hold even when the symbols are interpreted as nonsquare matrices. In this note we de ne and investigate typed Kleene algebra, a typed version of Kleene algebra in which objects have types s! t. Although nonsq ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
In previous work we havefound it necessary to argue that certain theorems of Kleene algebra hold even when the symbols are interpreted as nonsquare matrices. In this note we de ne and investigate typed Kleene algebra, a typed version of Kleene algebra in which objects have types s! t. Although
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
, 2004
"... In semantics and logics of programs, Kleene algebra forms an essential component of Propositional Dynamic Logic (PDL) [6], in which it is mixed with Boolean algebra and modal logic ..."
Abstract
 Add to MetaCart
In semantics and logics of programs, Kleene algebra forms an essential component of Propositional Dynamic Logic (PDL) [6], in which it is mixed with Boolean algebra and modal logic
Modal Kleene Algebra and Partial Correctness
 INSTITUT FÜR INFORMATIK, UNIVERSITÄT AUGSBURG
, 2003
"... We enrich Kleene algebra by domain and codomain operators. These ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
We enrich Kleene algebra by domain and codomain operators. These
Synchronous Kleene AlgebraI
"... The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner’s SCCS calculus. The resulting algebraic structure is called synchronous Kleene algebra. Models are given in terms of sets of synchronous strings and finite automata accepting s ..."
Abstract
 Add to MetaCart
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner’s SCCS calculus. The resulting algebraic structure is called synchronous Kleene algebra. Models are given in terms of sets of synchronous strings and finite automata accepting
On the Complexity of Reasoning in Kleene Algebra
 Information and Computation
, 1997
"... We study the complexity of reasoning in Kleene algebra and *continuous Kleene algebra in the presence of extra equational assumptions E; that is, the complexity of deciding the validity of universal Horn formulas E ! s = t, where E is a finite set of equations. We obtain various levels of complexi ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
We study the complexity of reasoning in Kleene algebra and *continuous Kleene algebra in the presence of extra equational assumptions E; that is, the complexity of deciding the validity of universal Horn formulas E ! s = t, where E is a finite set of equations. We obtain various levels
Results 1  10
of
6,864