Results 1  10
of
634
THE EQUATIONAL THEORY OF KLEENE LATTICES
"... Abstract. Languages and families of binary relations are standard interpretations of Kleene algebras. It is known that the equational theories of these interpretations coincide and that the free Kleene algebra is representable both as a relational and as a language algebra. We investigate the ide ..."
Abstract
 Add to MetaCart
Abstract. Languages and families of binary relations are standard interpretations of Kleene algebras. It is known that the equational theories of these interpretations coincide and that the free Kleene algebra is representable both as a relational and as a language algebra. We investigate
Peter Jipsen From Semirings to Residuated Kleene Lattices
"... Abstract. We consider various classes of algebras obtained by expanding idempotent semirings with meet, residuals and Kleene∗. An investigation of congruence properties (epermutability, eregularity, congruence distributivity) is followed by a section on algebraic Gentzen systems for proving inequa ..."
Abstract
 Add to MetaCart
inequalities in idempotent semirings, in residuated lattices, and in (residuated) Kleene lattices (with cut). Finally we define (onesorted) residuated Kleene lattices with tests to complement twosorted Kleene algebras with tests.
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
Kleene theorems for product systems
"... We prove Kleene theorems for two subclasses of labelled product systems which are inspired from wellstudied subclasses of 1bounded Petri nets. For product Tsystems we define a corresponding class of expressions. The algorithms from systems to expressions and in the reverse direction are both pol ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from wellstudied subclasses of 1bounded Petri nets. For product Tsystems we define a corresponding class of expressions. The algorithms from systems to expressions and in the reverse direction are both
*Manuscript (PDF) THE EQUATIONAL THEORY OF KLEENE LATTICES
"... Abstract. Languages and families of binary relations are standard interpretations of Kleene algebras. It is known that the equational theories of these interpretations coincide and that the free Kleene algebra is representable both as a relational and as a language algebra. We investigate the identi ..."
Abstract
 Add to MetaCart
Abstract. Languages and families of binary relations are standard interpretations of Kleene algebras. It is known that the equational theories of these interpretations coincide and that the free Kleene algebra is representable both as a relational and as a language algebra. We investigate
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
Invariance principle for reversible Markov processes with application to diffusion in the percolation regime
, 1985
"... We present an invariance principle for antisymmetric functions of a reversible Markov process which immediately implies convergence to Brownian motion for a wide class of random motions in random environments. We apply it to establish convergence to Brownian motion (i) for a walker moving in the inf ..."
Abstract

Cited by 129 (5 self)
 Add to MetaCart
We present an invariance principle for antisymmetric functions of a reversible Markov process which immediately implies convergence to Brownian motion for a wide class of random motions in random environments. We apply it to establish convergence to Brownian motion (i) for a walker moving
A Singular Loop Transformation Framework Based on Nonsingular Matrices
, 1992
"... In this paper, we discuss a loop transformation framework that is based on integer nonsingular matrices. The transformations included in this framework are called transformations and include permutation, skewing and reversal, as well as a transformation called loop scaling. This framework is mo ..."
Abstract

Cited by 130 (8 self)
 Add to MetaCart
In this paper, we discuss a loop transformation framework that is based on integer nonsingular matrices. The transformations included in this framework are called transformations and include permutation, skewing and reversal, as well as a transformation called loop scaling. This framework
Construction of Reversible Lattice Molecular Automata
, 802
"... Several cellular automata (CA) models have been developed to simulate selforganization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction of a reversible lattice molecular automata (RLMA) model, wh ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Several cellular automata (CA) models have been developed to simulate selforganization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction of a reversible lattice molecular automata (RLMA) model
Reverse Mathematics on Lattice Ordered Groups
, 2007
"... Several theorems about latticeordered groups are analyzed. RCA0 is sufficient to prove the induced order on a quotient of ℓgroups and the Riesz Decomposition Theorem. WKL0 is equivalent to the statement “An abelian group G is torsion free if and only if it is latticeorderable. ” ACA0 is equivalen ..."
Abstract
 Add to MetaCart
Several theorems about latticeordered groups are analyzed. RCA0 is sufficient to prove the induced order on a quotient of ℓgroups and the Riesz Decomposition Theorem. WKL0 is equivalent to the statement “An abelian group G is torsion free if and only if it is latticeorderable. ” ACA0
Results 1  10
of
634