Steps and Traces

Item does not contain fulltextCoalgebraic Methods in Computer Science: 14th IFIP WG 1.3 International Workshop, CMCS 2018, Colocated with ETAPS 2018, Thessaloniki, Greece, April 14–15, 201

Extending paradigm with data

\u3cp\u3eWe discuss an extension of the coordination modeling language Paradigm. The extension is geared towards data-dependent interaction among components, where the coordination is influenced by possibly distributed data. The approach is illustrated by the well-known example of a bakery where tickets are issued to serve clients in order. Also, it is described how to encode Paradigm models with data in the process language of the mCRL2 toolset for further analysis of the coordination.\u3c/p\u3

A coalgebraic approach to unification semantics of logic programming

In the version of logic programming (LP) based on interpretations where variables occur in atoms, a goal reduction via unification can be seen as a transition labelled by the most general unifier. Categorically, it is thus natural to model a logic program as a coalgebra. In the paper we represent: (i) goals as the substitutive monoid freely generated by the predicate symbols; (ii) the LTS as the structured coalgebra defined by the SOS rules implicit in the LP semantics; (iii) the bisimulation semantics of a logic program as its image on the final coalgebra

Duality of Equations and Coequations via Contravariant Adjunctions

International audienceIn this paper we show duality results between categories of equations and categories of coequations. These dualities are obtained as restrictions of dualities between categories of algebras and coalgebras, which arise by lifting contravariant adjunctions on the base categories. By extending this approach to (co)algebras for (co)monads, we retrieve the duality between equations and coequations for automata proved by Ballester-Bolinches, Cosme-Llópez and Rutten, and generalize it to dynamical systems

Developing Object-based Distributed Systems

: The OO-action systems formalism is a recent extension of action systems towards object-orientation. An OO-action system models an objectoriented system with active objects. In this paper we make the notion of a distributed object clear within this framework. Moreover, we show how objectbased distributed systems are designed stepwise within a formal framework, the refinement calculus. INTRODUCTION The term distributed object can be understood in two ways: (1) a distributed object is an object that resides in some node of a network, or (2) it is an object which is itself distributed among a set of nodes in a network. Typically, the former interpretation is used and hence, a distributed object [25] is an object that can live anywhere in a network. Distributed objects are independent of each other and they communicate via method invocations. The latter approach gives an interesting and novel interpretation of a distributed object. In this paper we study a framework that supports b..