35 citations · 102 across the 18 of their papers we have counts for
22 papers
Population Protocols over Ordered Agents
Michael Blondin, Michaël Cadilhac, Benjamin Courchesne +3
Population protocols are a distributed computation model in which a collection of anonymous, finite-state agents interact in randomly chosen pairs and update their states according…
Soundness of reset workflow nets
Michael Blondin, Alain Finkel, Piotr Hofman +2
Workflow nets are a well-established variant of Petri nets for the modeling of process activities such as business processes. The standard correctness notion of workflow nets is so…
Weakly acyclic diagrams: A data structure for infinite-state symbolic verification
Michael Blondin, Michaël Cadilhac, Xin-Yi Cui +3
Ordered binary decision diagrams (OBDDs) are a fundamental data structure for the manipulation of Boolean functions, with strong applications to finite-state symbolic model checkin…
Population Protocols with Unordered Data
Michael Blondin, François Ladouceur
Population protocols form a well-established model of computation of passively mobile anonymous agents with constant-size memory. It is well known that population protocols compute…
Verifying linear temporal specifications of constant-rate multi-mode systems
Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan
Constant-rate multi-mode systems (MMS) are hybrid systems with finitely many modes and real-valued variables that evolve over continuous time according to mode-specific constant ra…
Separators in Continuous Petri Nets
Michael Blondin, Javier Esparza
Leroux has proved that unreachability in Petri nets can be witnessed by a Presburger separator, i.e. if a marking cannot reach a marking ,…