Supported by current socio-scientific trends, programming the global behaviour of whole
computational collectives makes for great opportunities, but also significant challenges …

Runtime Verification can be defined as a collection of formal methods for studying the
dynamic evaluation of execution traces against formal specifications. Aside from creating a …

Distributed collective systems are systems formed by homogeneous dynamic collections of
devices acting in a shared environment to pursue a joint task or goal. Typical applications …

Programming distributed systems is notoriously hard due to–among the others–concurrency,
asynchronous execution, message loss, and device failures. Homogeneous distributed …

Recent trends in the engineering of software-intensive systems increasingly promote the
adoption of computation at the edge of the network, in the proximity of where sensing and …

The notion of bisimilarity plays an important role in concurrency theory. It provides formal
support to the idea of processes having “equivalent behaviour” and is a powerful tool for …

Field-based coordination is a model for expressing the coordination logic of large-scale
adaptive systems, composing functional blocks from a global perspective. As for any …

Research and technology developments on autonomous agents and autonomic computing
promote a vision of artificial systems that are able to resiliently manage themselves and …

The advent of highly distributed systems, such as the Internet of Things, has led to the
development of distributed systems that require efficient and resilient runtime monitoring …

Traditional multi-agent planning addresses the coordination of multiple agents towards
common goals, by producing an integrated plan of actions for each of those agents. For …