6 citations · 14 across the 7 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2023
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata
Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel +1
We study the complexity relationship between three models of unbounded memory automata: nu-automata (-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). Thes…
cs.FL2010★ 2 cited
A Decidable Characterization of a Graphical Pi-calculus with Iterators
Frédéric Peschanski, Hanna Klaudel, Raymond Devillers
This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to…