2

A simple criterion for M,N-adhesivity

Adhesive categories, and variants such as M,N-adhesive ones, marked a watershed moment for the algebraic approaches to the rewriting of graph-like structures, since they provide an abstract framework where many general results (on e.g. parallelism) …

AI-enhanced blockchain technology: A review of advancements and opportunities

Blockchain technology has rapidly gained popularity, permeating various fields due to its inherent features of security, transparency, and decentralization. Blockchain-based applications, spanning from financial transactions to supply chain …

Behavioral equivalences for AbU: Verifying security and safety in distributed IoT systems

Attribute-based memory Updates ([Formula presented]in short) is an interaction mechanism recently introduced for adapting the Event-Condition-Action (ECA) programming paradigm to distributed reactive systems, such as autonomic and smart IoT device …

Cascade products and Wheeler automata

The Krohn-Rhodes Decomposition Theorem (KRDT) holds a central position in automata and semigroup theories. It asserts that any finite-state automaton can be broken down into a collection, a cascade, of automata of two simple types (reset and …

Compressing neural networks via formal methods

Advancements in Neural Networks have led to larger models, challenging implementation on embedded devices with memory, battery, and computational constraints. Consequently, network compression has flourished, offering solutions to reduce operations …

Efficient Algorithm for Proportional Lumpability and Its Application to Selfish Mining in Public Blockchains

This paper explores the concept of proportional lumpability as an extension of the original definition of lumpability, addressing the challenges posed by the state space explosion problem in computing performance indices for large stochastic models. …

Incremental NFA minimization

We tackle the (classic) problem of minimizing (non)deterministic finite automata. The algorithm we put forward has the peculiarity of being incremental, i.e., the minimization proceeds by successive iterations, each producing a partially minimized …

Quantum encoding of dynamic directed graphs

In application domains such as routing, network analysis, scheduling, and planning, directed graphs are widely used as both formal models and core data structures for the development of efficient algorithmic solutions. In these areas, graphs are …

Solving the medical student scheduling problem using simulated annealing

We consider the medical student scheduling (MSS) problem, which consists of assigning medical students to internships of different disciplines in various hospitals during the academic year to fulfill their educational and clinical training. The MSS …

AbU: A calculus for distributed event-driven programming with attribute-based interaction

In recent years, event-driven programming languages, in particular those based on Event Condition Action (ECA) rules, have emerged as a promising paradigm for implementing ubiquitous and pervasive systems. These implementations are mostly …