# Scalable Traffic Models for Scheduling of Linear Periodic Event-Triggered Controllers

arXiv: https://arxiv.org/abs/2003.07642 · HTML: https://mlsanity.com/paper/2003.07642/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Mar 2020.

## Built on by (most cited first, 1 of 1)

- [Data-driven Abstractions with Probabilistic Guarantees for Linear PETC Systems](https://mlsanity.com/paper/2203.05522/) (2022)

## Abstract (arXiv)

This paper addresses the problem of modeling and scheduling the transmissions generated by multiple event-triggered control (ETC) loops sharing a network. We present a method to build a symbolic traffic model of periodic ETC (PETC), which by construction provides an exact simulation of such traffic. The model is made in such a way as to avoid the combinatorial explosion that is typical of symbolic models in many applications. It is augmented with early triggering actions that can be used by a scheduler to mitigate communication conflicts. The complete networked control system is then modeled as a network of timed game automata, for which existing tools can generate a strategy that avoids communication conflicts, while keeping early triggers to a minimum. By construction, our proposed symbolic model is a quotient model of the PETC. It is relatively fast to build, and it generates few to no spurious transitions. We finally demonstrate modeling and scheduling for a numerical example.