David Delfieu

dblp:124/4449 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 since 2021Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2022 Pomset bisimulation and unfolding for reset Petri nets
Thomas Chatain, Maurice Comlan, David Delfieu, Loïg Jezequel, Olivier H. Roux
Inf. Comput.3
2018 Pomsets and Unfolding of Reset Petri Nets
Thomas Chatain, Maurice Comlan, David Delfieu, Loïg Jezequel, Olivier H. Roux
LATA3
2017 Embedding time Petri nets
abstract
This paper presents a tool (PN2A) which embeds Time Petri Nets (TPN) to Arduino micro-controller architecture. PN2A imports TPN and generates Arduino sketches, which can be then compiled and uploaded to a micro-controller architecture. Some transitions (resp. places) of the transition set (resp. place set) can be assigned to pins of the micro-controller. Theses two types of transitions generates a new firing semantics combining weak and strong semantics. Embedded, the TPN becomes partially non-autonomous and can be defined as a microcontroller Synchronised Time Petri net (mSTPN).
Maurice Comlan, David Delfieu, Médésu Sogbohossou, Antoine Vianou
CoDIT2
2001 Discrete time approach of time Petri nets for real-time systems analysis
abstract
In order to establish the temporal properties of real-time systems, we consider the timed Petri net (TPN) model. First, we prove that properties like the minimal (or maximal) firing time and the minimal (or maximal) time interval between the firing of two transitions can be established with a discrete analysis of a TPN. Then we propose to express the entire discrete execution sequence of the TPN by an automaton which considers the discrete passing of time as the occurrence of a dedicated event. The advantage is that this automaton can be efficiently analysed by using binary decision diagrams (BDDs). We have implemented every step of this approach.
Olivier H. Roux, David Delfieu, Pierre Molinaro
ETFA (2)2