Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

An approximate characterisation of the set of feasible trajectories for constrained flat systems

Autor: Luca Greco, Hugues Mounier, Maria Bekcheva

[This is an EXTENDED VERSION of the Automatica paper]We study differentially flat systems, subject to constraints on the input, the state and their derivatives. We are interested in providing an approximate characterisation of the set of trajectories

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::77797907aa77185bfe67855c82e174ce
https://hal-centralesupelec.archives-ouvertes.fr/hal-03692611

Flat Petri Nets (Invited Talk)

Autor: Jérôme Leroux

Publikováno v: Application and Theory of Petri Nets and Concurrency
Application and Theory of Petri Nets and Concurrency-42nd International Conference, {PETRI} {NETS} 2021
Application and Theory of Petri Nets and Concurrency-42nd International Conference, 2021, Jun 2021, Virtual Event, France. ⟨10.1007/978-3-030-76983-3_2⟩
Application and Theory of Petri Nets and Concurrency ISBN: 9783030769826
Petri Nets

International audience; Vector addition systems with states (VASS for short), or equivalently Petri nets are one of the most popular formal methods for the representation and the analysis of parallel processes. The central algorithmic problem is reac

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4679535103ca02db3d1e2780c253a636
https://hal.archives-ouvertes.fr/hal-03436231

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

On flat lossy channel machines

Autor: Schnoebelen, Philippe

Publikováno v: 29th EACSL Conference on Computer Science Logic
29th EACSL Conference on Computer Science Logic, Jan 2021, Ljubljana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.37⟩

We show that reachability, repeated reachability, nontermination and unboundedness are NP-complete for Lossy Channel Machines that are flat, i.e., with no nested cycles in the control graph. The upper complexity bound relies on a fine analysis of ite

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42011142028f10abda96c2dd040afc1b
https://hal.archives-ouvertes.fr/hal-03441933/document