314 citations
- Université d'Évry Val-d'EssonneFR19 papers
- Centre National de la Recherche ScientifiqueFR15 papers
- Université Paris-SaclayFR12 papers
- LIP6FR10 papers
- Institut national de recherche en sciences et technologies du numériqueFR6 papers
- Sorbonne UniversitéFR6 papers
- Université Pierre-et-Marie-CurieFR5 papers
- Institut de Recherche en Informatique de ToulouseFR4 papers
- Institut Polytechnique de BordeauxFR3 papers
- Universidade Estadual de Campinas (UNICAMP)BR3 papers
- Université Gustave EiffelFR3 papers
- Université Paris CitéFR3 papers
4 papers · 1 filter
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…
P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks
Artiom Alhazov, Rudolf Freund, Sergiu Ivanov
Membrane computing and P systems are a paradigm of massively parallel natural computing introduced by Gheorghe Păun in 1999, inspired by the structure of the living cell and by its…
Boolean networks synchronism sensitivity and XOR circulant networks convergence time
Mathilde Noual, Damien Regnault, Sylvain Sené
In this paper are presented first results of a theoretical study on the role of non-monotone interactions in Boolean automata networks. We propose to analyse the contribution of no…
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…