Results 1  10
of
11
A Universal Interpreter for Nondeterministic Concurrent Programming Languages
, 1996
"... Nondeterministic concurrent programming languages (ncpl) are languages which contain as primitive constructs nondeterministic choice and concurrent composition (interleaving) . The best known are the languages based on CCS of Milner which are used as mathematical model of communication of concurrent ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Nondeterministic concurrent programming languages (ncpl) are languages which contain as primitive constructs nondeterministic choice and concurrent composition (interleaving) . The best known are the languages based on CCS of Milner which are used as mathematical model of communication of concurrent processes. Concurrent constraint programming languages have been intensively studied during the last decade and reflect the efforts directed to extend the constraint logic programming paradigm and also may be characterised as a subclass of ncpl. The universal interpreter for ncp languages under development is considered as a new unified approach for the definition of the operational semantics of these languages, their comparative study and the development of prototypes for new applications. This interpreter is a generic program which may be used as a mathematical model for different classes of programs. Several applications of universal interpreter for the study of ncpl languages have been ...
Toward an Implementation Theory of Nondeterministic Concurrent Languages
, 1996
"... Nondeterministic concurrent programming languages (ncpl) are languages which contain as primitive constructs nondeterministic choice and concurrent composition (interleaving) . The best known are the languages based on CCS of Milner which are used as mathematical models of communication of concurren ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Nondeterministic concurrent programming languages (ncpl) are languages which contain as primitive constructs nondeterministic choice and concurrent composition (interleaving) . The best known are the languages based on CCS of Milner which are used as mathematical models of communication of concurrent processes. Concurrent constraint programming languages have been intensively studied during the last decade, reflecting the efforts directed to extend the constraint logic programming paradigm, and also may be characterized as a subclass of ncpl. The universal generator of histories for ncp languages under development is considered as a new unified approach for the definition of the operational semantics of these languages, their comparative studies and the development of prototypes for new applications. This generator is a generic program which may be used as a mathematical model for different classes of programs. The universal generator has been used to checking the operational semantics...
Programming in concurrent logic languages
 IEEE Software
, 1995
"... Coordination using a SingleWriter MultipleReader ..."
MultiAgent Systems as Concurrent Constraint Processes
, 2001
"... We present a language Scc for a specification of the direct exchange and/or the global sharing of information in multiagent systems. Scc is based on concurrent constraint programming paradigm which we modify in such a way that agents can (i) maintain its local private store, (ii) share (read/write) ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a language Scc for a specification of the direct exchange and/or the global sharing of information in multiagent systems. Scc is based on concurrent constraint programming paradigm which we modify in such a way that agents can (i) maintain its local private store, (ii) share (read/write) the information in the global store and (iii) communicate with other agents (via multiparty or handshake). To justify our proposal we compare Scc to a recently proposed language for the exchange of information in multiagent systems. Also we provide an operational semantics of Scc. The full semantic treatment is sketched only and done elsewhere.
A Generic Tool for Modelling and Simulating the Behaviour of Concurrent Systems
, 1998
"... This report summarises the development of a portable, persistent and generic tool for modelling, exploring and analysing the behaviour of concurrent systems. The design is based on the general Action language theory for nondeterministic concurrent programming languages, and hence the tool is called ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This report summarises the development of a portable, persistent and generic tool for modelling, exploring and analysing the behaviour of concurrent systems. The design is based on the general Action language theory for nondeterministic concurrent programming languages, and hence the tool is called the Action language workbench. It has been developed using an algebraic style and implemented in the algebraic programming system APS. The generic algebraicbased approach enables workbench to be applied to many languages by means of rapid prototyping and generation of action languages. A number of applications of the workbench to concurrent constraint and coordination languages, as well as its probabilistic extension are reported. Currently the functionality of the tool is restricted to simulation. Further development of both the underlying theory and the tool is planned regarding the description of distributed systems and the ehnancement of the kinds of analyses which can be performed. 1 I...
Failure Semantics for the Exchange of Information in MultiAgent Systems
 In Palamidessi, C
, 2000
"... In this paper, we present a semantic theory for the exchange of information in multiagent systems. We define a concurrent programming language for systems of agents that maintain their own private stores of information and that interact with each other by means of a synchronous communication mechan ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we present a semantic theory for the exchange of information in multiagent systems. We define a concurrent programming language for systems of agents that maintain their own private stores of information and that interact with each other by means of a synchronous communication mechanism that allows for the exchange of information. The semantics of the language, which is based on a generalisation of traditional failure semantics, is shown to be fullyabstract with respect to observing of each terminating computation its final global store of information.
Complexity Issues of the Pattern Equations in Idempotent Semigroups
, 1999
"... A pattern equation is a word equation of the form X = A where X is a sequence of variables and A is a sequence of constants. The problem whether X = A has a solution in a free idempotent semigroup (free band) is shown to be NPcomplete. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A pattern equation is a word equation of the form X = A where X is a sequence of variables and A is a sequence of constants. The problem whether X = A has a solution in a free idempotent semigroup (free band) is shown to be NPcomplete.
On the Pattern Equations
, 1999
"... . Word equation in a special form X = A, where X is a sequence of variables and A is a sequence of constants, is considered. The problem whether X = A has a solution over a free monoid (PATTERNEQUATION problem) is shown to be NP#complete. It is also shown that disjunction of a special type equation ..."
Abstract
 Add to MetaCart
. Word equation in a special form X = A, where X is a sequence of variables and A is a sequence of constants, is considered. The problem whether X = A has a solution over a free monoid (PATTERNEQUATION problem) is shown to be NP#complete. It is also shown that disjunction of a special type equation systems and conjunction of the general ones can be eliminated. Finally, the case of stuttering equations where the word identity is read modulo x 2 = x is mentioned. 1 Introduction In computer science many natural problems lead to solving equations. It is the main topic in several \Thetaelds such as logic programming and automated theorem proving where especially uni\Thetacation plays a very important role. A number of problems also exploit semantic uni\Thetacation, which is in fact solving word equations in some variety. A very famous result by Makanin (see [10]) shows that the question whether an equation over a free monoid has a solution is decidable. It can be even generalized in the...
Temporal Synchronous Concurrent Constraint Programming
"... Concurrent constraint programming is a declarative formalism with elegant semantics; recently several attempts have been made to enrich this paradigm so that it can describe realtime systems. We propose an extension of the ccp paradigm in a way which overcomes some of the disadvantages of some of ..."
Abstract
 Add to MetaCart
Concurrent constraint programming is a declarative formalism with elegant semantics; recently several attempts have been made to enrich this paradigm so that it can describe realtime systems. We propose an extension of the ccp paradigm in a way which overcomes some of the disadvantages of some of the previous approaches and makes the paradigm suitable for specifying and analysing the "actual" time component of timecritical and and realtime systems. Our extension is based on allowing processes to progress in time by performing time actions which can be quantified by time elements chosen from a suitable time domain. Keywords: concurrent constraint programming, realtime systems, synchrony. 1 Introduction A significant amount of research effort has been spent on the development of formal methods for realtime and timecritical systems. In the context of ccp, Saraswat et al. have proposed timed default concurrent constraint programming [22], which uniformly extends Default cc ac...
A Fully Abstract Semantics for a Version of Synchronous Concurrent Constraint Programming
, 1999
"... Concurrent constraint programming is classically based on asynchronous communication via a shared store. In previous work ([1, 2]), we presented a new version of the ask and tell primitives which features synchronicity, our approach being based on the idea of telling new information just in the case ..."
Abstract
 Add to MetaCart
Concurrent constraint programming is classically based on asynchronous communication via a shared store. In previous work ([1, 2]), we presented a new version of the ask and tell primitives which features synchronicity, our approach being based on the idea of telling new information just in the case that a concurrent...