# Asynchronous l-Complete Approximations

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

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Feb 2014.

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

- [Data-driven abstractions via adaptive refinements and a Kantorovich metric [extended version]](https://mlsanity.com/paper/2303.17618/) (2023)
- [Reinforcement Learning for Robust Ageing-Aware Control of Li-ion Battery Systems with Data-Driven Formal Verification](https://mlsanity.com/paper/2509.04288/) (2025)

## Abstract (arXiv)

This paper extends the l-complete approximation method developed for time invariant systems to a larger system class, ensuring that the resulting approximation can be realized by a finite state machine. To derive the new abstraction method, called asynchronous l-complete approximation, an asynchronous version of the well-known concepts of state property, memory span and l-completeness is introduced, extending the behavioral systems theory in a consistent way.