1

Computing Embeddings of Directed Bigraphs

Directed bigraphs are a meta-model which generalises Milner’s bigraphs by taking into account the request flow between controls and names. A key problem about these bigraphs is that of bigraph embedding, i.e., finding the embeddings of a bigraph …

EFP 2.0: A multi-agent epistemic solver with multiple E-state representations

Multi-agent systems have been employed to model, simulate and explore a variety of real-world scenarios. It is becoming more and more important to investigate formalisms and tools that would allow us to exploit automated reasoning in these domains. …

Extending Information Agreement by Continuity

Agreement measures are useful metrics to both compare different evaluations of the same diagnostic outcomes and validate new rating systems or devices. While many of them have been proposed in the literature so far, Cohen's. is still the de facto …

GPU-Based Parallelism for ASP-Solving

Answer Set Programming (ASP) has become the paradigm of choice in the field of logic programming and non-monotonic reasoning. With the design of new and efficient solvers, ASP has been successfully adopted in a wide range of application domains. …

Optimization and multistage systems. The thawing case

Multistage systems are systems characterized by n stages, where each stage has a precise parametric evolution law. We propose a procedure to reduce the optimal parameter synthesis on a multistage system to the optimal control design on an automaton …

Regular languages meet prefix sorting

Indexing strings via prefix (or suffix) sorting is, arguably, one of the most successful algorithmic techniques developed in the last decades. Can indexing be extended to languages? The main contribution of this paper is to initiate the study of the …

Securing the art market with distributed public ledgers

The art market is an important scenario where many players (artists, buyers, sellers, brokers, etc.) act in a context with partial trust, and still it is crucial to ensure authentication and provenance of artworks. In this paper, we propose to store …

Software transactional memory with interactions

Software Transactional memory (STM) is an emerging abstraction for concurrent programming alternative to lock-based synchronizations. Most STM models admit only isolated transactions, which are not adequate in multithreaded programming where …

Towards a formal model for composable container systems

In modern cloud-based architectures, containers play a central role: they provide powerful isolation mechanisms such that developers can focus on the logic and dependencies of applications while system administrators can focus on deployment and …

A process algebra for (delimited) persistent stochastic non-interference