A process algebra for synchronous concurrent constraint programming

Concurrent constraint programming is classically based on asynchronous communication via a shared store. This paper presents new version of the ask and tell primitives which features synchronicity. Our approach is based on the idea of telling new information just in the case that a concurrently running process is asking for it. An operational and an algebraic semantics are defined. The algebraic semantics is proved to be sound and complete with respect to a compositional operational semantics which is also presented in the paper

Multi-agent systems as concurrent constraint processes

We present a language Scc for a specication of the direct exchange and/or the global sharing of information in multi-agent 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 multi-party or hand-shake). To justify our proposal we compare Scc to a recently proposed language for the exchange of information in multi-agent systems. Also we provide an operational semantics of Scc. The full semantic treatment is sketched only and done elsewher

On the Expressive Power of Extended Process Rewrite Systems

We provide a unified view on three extensions of Process rewrite systems (PRS) and compare their and PRS's expressive power

Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games

We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of all satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. While the proposed algorithm guarantees progress and soundness in every iteration, it is computationally demanding. We offer an alternative, more efficient solution for the reachability properties that decomposes the problem into a series of smaller problems of the same type. All algorithms are demonstrated on an illustrative case study

Diario de Córdoba de comercio, industria, administración, noticias y avisos: Año XIII Número 3502 - 1862 abril 13

Copia digital. Madrid : Ministerio de Cultura. Subdirección General de Coordinación Bibliotecaria, 200

Parsing strategies: A concise survey

After the introduction of context-free grammars and the use of BNF rules, compilers have been built in which we can distinguish methods of syntax-analysis. While initially sometimes many different ideas were used to do syntax-analysis for a given programming language and grammar, later formalizations of these ideas have led to many different parsing methods. Each of these methods can be shown to be suitable for a certain subclass of the context-free grammars