Results 1  10
of
84
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 37 (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
Synchronous Kleene Algebra
, 2009
"... 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

Cited by 4 (2 self)
 Add to MetaCart
. Decidability follows from completeness. Kleene algebra with synchrony should be included in the class of true concurrency models. In this direction, a comparison with Mazurkiewicz traces is made which yields their incomparability with synchronous Kleene algebras (one cannot simulate the other). On the other
On the relation between Concurrent Separation Logic and Concurrent Kleene Algebra
"... We investigate the connection between a general form of Concurrent Separation Logic (CSL), a logic for modular reasoning about concurrent programs, and Concurrent Kleene Algebra (CKA), which provides an axiomatic approach to models of concurrency. We show how the proof theory of a general form of CS ..."
Abstract
 Add to MetaCart
We investigate the connection between a general form of Concurrent Separation Logic (CSL), a logic for modular reasoning about concurrent programs, and Concurrent Kleene Algebra (CKA), which provides an axiomatic approach to models of concurrency. We show how the proof theory of a general form
Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time
 In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP99
, 1999
"... . Efficient reasoning about temporal constraints over nonlinear time models is vital in numerous application areas, such as planning, distributed systems and cooperating agents. We identify all tractable subclasses of the point algebra for partiallyordered time and examine one large, nontrivial ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
or time points. Typical reasoning tasks include determining the satisfiability of such collections and deducing new relations from those that are known. Research on automated reasoning about temporal constraints has largely concentrated on simple, linear models of time. However, it has been observed over
Deriving Labels and Bisimilarity for Concurrent Constraint Programming
, 2010
"... Abstract. Concurrent constraint programming (ccp) is a wellestablished model for concurrency that builds upon operational and algebraic notions from process calculi and firstorder logic. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
Abstract. Concurrent constraint programming (ccp) is a wellestablished model for concurrency that builds upon operational and algebraic notions from process calculi and firstorder logic. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition
Contents
, 2008
"... The work reported here investigates the introduction of synchrony into Kleene algebra. The resulting algebraic structure is called synchronous Kleene algebra. Models are given in terms of regular sets of concurrent strings and finite automata accepting concurrent strings. The extension of synchrono ..."
Abstract
 Add to MetaCart
of synchronous Kleene algebra with Boolean tests is presented together with models on regular sets of guarded concurrent strings and the associated automata on guarded concurrent strings. Completeness w.r.t. the standard interpretations is given in each case. Decidability follows from completeness. A comparison
Algebraic Approach to Operational Semantics and ObservationOriented Semantics for a Timed SharedVariable Language with Probability ∗
"... Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formalize languages comprising all these features. We have proposed a language, which integrates probability with time and shared ..."
Abstract
 Add to MetaCart
and the derivation strategy. This indicates the completeness of our operational semantics from the viewpoint of algebraic semantics. Meanwhile, we also investigate the observationoriented semantic model and its derivation from algebraic semantics. 1
Results 1  10
of
84