Heaps models are powerful models for concurrent timed discrete event systems. They admit linear description using dioid algebras. Inspired by supervisory control of logical discrete event systems we introduce parallel composition of heap models, called synchronous product, to formally describe the action of supervisor (represented by another heap model) on the system. This additional explicit c...

In software-defined networking (SDN), a controller program updates the forwarding rules installed on network packet-processing devices in response to events. Such programs are often physically distributed, running on several nodes of the network, and this distributed setting makes programming and debugging especially difficult. Furthermore, bugs in these programs can lead to serious problems su...

The algebraic specification and representation of networks agents have been greatly impacted by the study reversible phenomena: declensions calculus communicating systems (CCSK RCCS) offer new semantic models, finer congruence relations, original properties, revisits existing theories results in a light. But much remains to be done: concurrency, central notion establishing causal consistency–a ...