2016/12/30 by María-del-Mar Gallardo, Leticia Lavado, Laura Panizo · 2 citations
Computer Science · #Constraint (computer-aided design) #Constraint Satisfaction and Optimization #Constraint programming #Constraint satisfaction problem #Execution model #Interpreter #Model-Driven Software Engineering Techniques #Modular design #Multi-Agent Systems and Negotiation #Set (abstract data type) #Solver #cs.PL #cs.SE
paper · pdf · doi:10.4204/eptcs.234.9
published in Electronic Proceedings in Theoretical Computer Science 234, 120-134 (Open Publishing Association) · In Proceedings WLP'15/'16/WFLP'16, arXiv:1701.00148
openalex publication_date 2016/12/30 · arxiv created 2017/01/03 · arxiv updated 2017/01/04 · openalex created_date 2017/01/06 · openalex updated_date 2026/08/05
The Timed Concurrent Constraint Language tccp is a declarative synchronous concurrent language, particularly suitable for modelling reactive systems. In tccp, agents communicate and synchronise through a global constraint store. It supports a notion of discrete time that allows all non-blocked agents to proceed with their execution simultaneously. In this paper, we present a modular architecture for the simulation of tccp programs. The tool comprises three main components. First, a set of basic abstract instructions able to model the tccp agent behaviour, the memory model needed to manage the active agents and the state of the store during the execution. Second, the agent interpreter that executes the instructions of the current agent iteratively and calculates the new agents to be executed at the next time instant. Finally, the constraint solver components which are the modules that deal with constraints. In this paper, we describe the implementation of these components and present an example of a real system modelled in tccp.