Results 1  10
of
5,046
On the Completeness of the Equations for the Kleene Star in bisimulation
"... A classical result from Redko [14] says that there does not exist a complete finite equational axiomatization for the Kleene star modulo trace equivalence. Fokkink and Zantema [9] showed that there does exist a complete finite equational axiomatization for the Kleene star up to strong bisimulation e ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
A classical result from Redko [14] says that there does not exist a complete finite equational axiomatization for the Kleene star modulo trace equivalence. Fokkink and Zantema [9] showed that there does exist a complete finite equational axiomatization for the Kleene star up to strong bisimulation
Concatenation and Kleene Star on Deterministic Finite Automata
"... Abstract—This paper presents direct, explicit algebraic constructions of concatenation and Kleene star on deterministic finite automata (DFA), using the Booleanmatrix method of Zhang [5] and ideas of Kozen [2]. The consequence is trifold: (1) it provides an alternative proof of the classical Kleene ..."
Abstract
 Add to MetaCart
Abstract—This paper presents direct, explicit algebraic constructions of concatenation and Kleene star on deterministic finite automata (DFA), using the Booleanmatrix method of Zhang [5] and ideas of Kozen [2]. The consequence is trifold: (1) it provides an alternative proof of the classical
On visualisation scaling, subeigenvectors and Kleene stars in max algebra
, 2008
"... The purpose of this paper is to investigate the interplay arising between max algebra, convexity and scaling problems. The latter, which have been studied in nonnegative matrix theory, are strongly related to max algebra. One problem is strict visualisation scaling, which means finding, for a given ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and Kleene stars of nonnegative matrices as well as by some concepts of convex geometry. Three conjectures are stated concerning the matrix theoretic properties of Kleene stars.
On visualization scaling, subeigenvectors and Kleene stars in max algebra
 Linear Algebra Appl
"... The purpose of this paper is to investigate the interplay arising between max algebra, convexity and scaling problems. The latter, which have been studied in nonnegative matrix theory, are strongly related to max algebra. One problem is that of strict visualization scaling, defined as, for a given n ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
and Kleene stars of nonnegative matrices as well as by some concepts of convex geometry.
MULTIORDER, KLEENE STARS AND CYCLIC PROJECTORS IN THE GEOMETRY OF MAX CONES
, 2008
"... This paper summarizes results on some topics in the maxplus convex geometry, mainly concerning the role of multiorder, Kleene stars and cyclic projectors, and relates them to some topics in max algebra. The multiorder principle leads to maxplus analogues of some statements in the finitedimension ..."
Abstract
 Add to MetaCart
This paper summarizes results on some topics in the maxplus convex geometry, mainly concerning the role of multiorder, Kleene stars and cyclic projectors, and relates them to some topics in max algebra. The multiorder principle leads to maxplus analogues of some statements in the finite
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agents that communicate by placing, checking and instantiating constraints on shared variables. Such a view of computation is interesting in the context of programming languages because of the ability to represent and manipulate partial information about the domain of discourse, in the context of concurrency because of the use of constraints for communication and control, and in the context of AI because of the availability of simple yet powerful mechanisms for controlling inference, and the promise that very rich representational/programming languages, sharing the same set of abstract properties, may be possible. To reflect this view of computation, [Sar89] develops the cc family of languages. We present here one member of the family, CC(.L,+) (pronounced “cc with Ask and Choose”) which provides the basic operations of blocking Ask and atomic Tell and an algebra of behaviors closed under prefixing, indeterministic choice, interleaving, and hiding, and provides a mutual recursion operator. cc(.L,t) is (intentionally!) very similar to Milner’s CCS, but for the radically different underlying concept of communication, which, in fact, pro’ The class is founded on the notion of “constraint logic programming ” [JL87,Mah87], fundamentally generalizes concurrent logic programming, and is the subject of the first author’s dissertation [Sar89], on which this paper is substantially based.
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
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
A completeness theorem for Kleene algebras and the algebra of regular events
 Information and Computation
, 1994
"... We givea nitary axiomatization of the algebra of regular events involving only equations and equational implications. Unlike Salomaa's axiomatizations, the axiomatization given here is sound for all interpretations over Kleene algebras. 1 ..."
Abstract

Cited by 250 (28 self)
 Add to MetaCart
We givea nitary axiomatization of the algebra of regular events involving only equations and equational implications. Unlike Salomaa's axiomatizations, the axiomatization given here is sound for all interpretations over Kleene algebras. 1
Results 1  10
of
5,046