Raymond R. Devillers

ORCID

Publication Activity (10 Years)

Years Active: 1973-2024
Publications (10 Years): 47

Top Venues

Publications

Eike Best, Raymond R. Devillers
Coverability in Well-Formed Free-Choice Petri Nets. Taming the Infinities of Concurrency (2024)
Eike Best, Raymond R. Devillers
Petri Net Synthesis from a Reachability Set. Petri Nets (2024)
Johan Arcile, Raymond R. Devillers, Hanna Klaudel
Factorization of the State Space Construction for Cyclic Systems with Data. VECoS (2023)
Johan Arcile, Raymond R. Devillers, Hanna Klaudel
An Efficient State Space Construction for a Class of Timed Automata. Trans. Petri Nets Other Model. Concurr. 17 (2023)
Raymond R. Devillers
On the Reversibility of Circular Conservative Petri Nets. Petri Nets (2023)
Raymond R. Devillers, Ronny Tredup
Complexity of Distributed Petri Net Synthesis. TASE (2022)
Raymond R. Devillers, Ronny Tredup
Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues. Petri Nets (2022)
Raymond R. Devillers, Ronny Tredup
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. CoRR (2022)
Raymond R. Devillers, Ronny Tredup
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues. Fundam. Informaticae 187 (2-4) (2022)
Raymond R. Devillers, Ronny Tredup
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. Fundam. Informaticae 189 (3-4) (2022)
Raymond R. Devillers, Ronny Tredup
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues. Fundam. Informaticae 187 (2-4) (2022)
Raymond R. Devillers
Synthesis of (Choice-Free) Reset Nets. Petri Nets (2021)
Raymond R. Devillers
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis. Fundam. Informaticae 183 (1-2) (2021)
Raymond R. Devillers, Ronny Tredup
Some Basic Techniques allowing Petri Net Synthesis: Complexity and Algorithmic Issues. CoRR (2021)
Raymond R. Devillers
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis. CoRR (2021)
Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond. Trans. Petri Nets Other Model. Concurr. 15 (2021)
Raymond R. Devillers, Ronny Tredup
Synthesis of Pure and Impure Petri nets With Restricted Place-environments: Complexity Issues. CoRR (2021)
Johan Arcile, Raymond R. Devillers, Hanna Klaudel
Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks. Fundam. Informaticae 175 (1-4) (2020)
Eike Best, Raymond R. Devillers, Evgeny Erofeev, Harro Wimmel
Target-oriented Petri Net Synthesis. Fundam. Informaticae 175 (1-4) (2020)
Johan Arcile, Raymond R. Devillers, Hanna Klaudel
VERIFCAR: A Framework for Modeling and Model checking Communicating Autonomous Vehicles. AAMAS (2020)
Eike Best, Raymond R. Devillers, Evgeny Erofeev
A New Property of Choice-Free Petri Net Systems. Petri Nets (2020)
Johan Arcile, Raymond R. Devillers, Hanna Klaudel
Models for Dynamic Exploration of the Statespaces of Autonomous Vehicles. PNSE@Petri Nets (2020)
Johan Arcile, Raymond R. Devillers, Hanna Klaudel
VerifCar: a framework for modeling and model checking communicating autonomous vehicles. Auton. Agents Multi Agent Syst. 33 (3) (2019)
Johan Arcile, Raymond R. Devillers, Hanna Klaudel
Dynamic exploration of multi-agent systems with timed periodic tasks. CoRR (2019)
Raymond R. Devillers, Thomas Hujsa
Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods. Fundam. Informaticae 169 (1-2) (2019)
Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond. CoRR (2019)
Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. CoRR (2019)
Raymond R. Devillers
Articulation of Transition Systems and Its Application to Petri Net Synthesis. Petri Nets (2019)
Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa
Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems. ATAED@Petri Nets/ACSD (2019)
Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. Trans. Petri Nets Other Model. Concurr. 14 (2019)
Thomas Hujsa, Raymond R. Devillers
On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets. Fundam. Informaticae 161 (4) (2018)
Eike Best, Raymond R. Devillers
Pre-synthesis of Petri nets based on prime cycles and distance paths. Sci. Comput. Program. 157 (2018)
Eike Best, Raymond R. Devillers, Uli Schlachter
Bounded choice-free Petri net synthesis: algorithmic issues. Acta Informatica 55 (7) (2018)
Raymond R. Devillers, Uli Schlachter
Factorisation of Petri Net Solvable Transition Systems. Petri Nets (2018)
Eike Best, Raymond R. Devillers, Uli Schlachter, Harro Wimmel
Simultaneous Petri Net Synthesis. Sci. Ann. Comput. Sci. 28 (2) (2018)
Raymond R. Devillers, Thomas Hujsa
Analysis and Synthesis of Weighted Marked Graph Petri Nets. Petri Nets (2018)
Raymond R. Devillers
Factorisation of transition systems. Acta Informatica 55 (4) (2018)
Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems. ATAED@Petri Nets/ACSD (2018)
Eike Best, Raymond R. Devillers, Uli Schlachter
A Graph-Theoretical Characterisation of State Separation. SOFSEM (2017)
Thomas Hujsa, Raymond R. Devillers
On Liveness and Deadlockability in Subclasses of Weighted Petri Nets. Petri Nets (2017)
Johan Arcile, Raymond R. Devillers, Hanna Klaudel, Witold Klaudel, Bozena Wozna-Szczesniak
Modeling and checking robustness of communicating autonomous vehicles. DCAI (2017)
Eike Best, Raymond R. Devillers
Characterisation of the state spaces of marked graph Petri nets. Inf. Comput. 253 (2017)
Curtis Bright, Raymond R. Devillers, Jeffrey O. Shallit
Minimal Elements for the Prime Numbers. Exp. Math. 25 (3) (2016)
Raymond R. Devillers
Products of Transition Systems and Additions of Petri Nets. ACSD (2016)
Raymond R. Devillers, Antti Valmari, Wojciech Penczek
Preface. Fundam. Informaticae 146 (1) (2016)
Raymond R. Devillers, Hanna Klaudel
Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata. FORMATS (2016)
Eike Best, Raymond R. Devillers
The Power of Prime Cycles. Petri Nets (2016)
Eike Best, Raymond R. Devillers
Synthesis of Live and Bounded Persistent Systems. Fundam. Informaticae 140 (1) (2015)
Eike Best, Raymond R. Devillers
State space axioms for T-systems. Acta Informatica 52 (2-3) (2015)
Johan Arcile, Tadeusz Czachórski, Raymond R. Devillers, Jean-Yves Didier, Hanna Klaudel, Artur Rataj
Modelling and Analysing Mixed Reality Applications. ICMMI (2015)
Eike Best, Raymond R. Devillers
Synthesis and reengineering of persistent systems. Acta Informatica 52 (1) (2015)
Johan Arcile, Jean-Yves Didier, Hanna Klaudel, Raymond R. Devillers, Artur Rataj
Indefinite waitings in MIRELA systems. ESSS (2015)
Eike Best, Raymond R. Devillers
Synthesis of Bounded Choice-Free Petri Nets. CONCUR (2015)
Raymond R. Devillers, Jean-Yves Didier, Hanna Klaudel, Johan Arcile
Deadlock and Temporal Properties Analysis in Mixed Reality Applications. ISSRE (2014)
Eike Best, Raymond R. Devillers
Synthesis of Persistent Systems. Petri Nets (2014)
Eike Best, Raymond R. Devillers
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. LATA (2014)
Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers
A Petri Net Interpretation of Open Reconfigurable Systems. Fundam. Informaticae 122 (1-2) (2013)
Raymond R. Devillers, Jean-Yves Didier, Hanna Klaudel
Implementing Timed Automata Specifications: The "Sandwich" Approach. ACSD (2013)
Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers
A Petri Net Interpretation of Open Reconfigurable Systems. Petri Nets (2011)
Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers
A Decidable Characterization of a Graphical Pi-calculus with Iterators INFINITY (2010)
Franck Pommereau, Raymond R. Devillers, Hanna Klaudel
Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters. INFINITY (2009)
Roland Bouroulet, Raymond R. Devillers, Hanna Klaudel, Elisabeth Pelz, Franck Pommereau
Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets. Petri Nets (2008)
Raymond R. Devillers, Hanna Klaudel, Maciej Koutny
-calculus terms. Formal Aspects Comput. 20 (4-5) (2008)
Vincent Nélis, Joël Goossens, Raymond R. Devillers, Dragomir Milojevic, Nicolas Navet
Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms. SUTC (2008)
Anastasia Yartseva, Raymond R. Devillers, Hanna Klaudel, François Képès
From MIN model to ordinary differential equations. J. Integr. Bioinform. 4 (3) (2007)
Anastasia Yartseva, Hanna Klaudel, Raymond R. Devillers, François Képès
Incremental and unifying modelling formalism for biological interaction networks. BMC Bioinform. 8 (2007)
Vandy Berten, Raymond R. Devillers, Guy Louchard
FIFO Queuing of Constant Length Fully Synchronous Jobs. GSEM (2007)
Raymond R. Devillers, Hanna Klaudel, Maciej Koutny
Modelling Mobility in High-level Petri Nets. ACSD (2007)
Vincent Nélis, Joël Goossens, Nicolas Navet, Raymond R. Devillers, Dragomir Milojevic
Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms CoRR (2007)
Raymond R. Devillers, Laurent Van Begin
Boundedness undecidability for synchronized nets. Inf. Process. Lett. 99 (5) (2006)
Raymond R. Devillers, Hanna Klaudel, Maciej Koutny
-Calculus Terms. ICTAC (2006)
Raymond R. Devillers, Hanna Klaudel, Maciej Koutny
Petri Net Semantics of the Finite pi-calculus Terms. Fundam. Informaticae 70 (3) (2006)
Maxime Van Assche, Joël Goossens, Raymond R. Devillers
Joint garbage collection and hard real-time scheduling. J. Embed. Comput. 2 (3-4) (2006)
Raymond R. Devillers, Hanna Klaudel
Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets. Fundam. Informaticae 66 (3) (2005)
Raymond R. Devillers, Hanna Klaudel, Maciej Koutny
A Petri Net Semantics of a Simple Process Algebra for Mobility. EXPRESS (2005)
Raymond R. Devillers, Hanna Klaudel, Maciej Koutny
Context-based Process Algebras for Mobility. ACSD (2004)
Raymond R. Devillers, Hanna Klaudel, Maciej Koutny
Petri Net Semantics of the Finite pi-Calculus. FORTE (2004)
Raymond R. Devillers, Hanna Klaudel, Maciej Koutny, Franck Pommereau
Asynchronous Box Calculus. Fundam. Informaticae 54 (4) (2003)
Raymond R. Devillers, Hanna Klaudel, Robert-C. Riemann
General parameterised refinement and recursion for the M-net calculus. Theor. Comput. Sci. 300 (1-3) (2003)
Eike Best, Raymond R. Devillers, Maciej Koutny
The Box Algebra = Petri Nets + Process Expressions. Inf. Comput. 178 (1) (2002)
Raymond R. Devillers, Hanna Klaudel, Maciej Koutny, Franck Pommereau
An Algebra of Non-safe Petri Boxes. AMAST (2002)
Eike Best, Raymond R. Devillers, Maciej Koutny
Recursion and Petri nets. Acta Informatica 37 (11-12) (2001)
Raymond R. Devillers, Hanna Klaudel, Elisabeth Pelz
An Algebraic Box Calculus. J. Autom. Lang. Comb. 5 (2) (2000)
Raymond R. Devillers, Joël Goossens
Liu and Layland's schedulability test revisited. Inf. Process. Lett. 73 (5-6) (2000)
Raymond R. Devillers, Joël Goossens
General Response Time Computation for the Deadline Driven Scheduling of Periodic Tasks. Fundam. Informaticae 40 (2-3) (1999)
Joël Goossens, Raymond R. Devillers
Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines. RTCSA (1999)
Eike Best, Raymond R. Devillers, Maciej Koutny
The Box Algebra - A Model of Nets and Process Expressions. ICATPN (1999)
Raymond R. Devillers, Maciej Koutny
Recursive Nets in the Box Algebra. ACSD (1998)
Raymond R. Devillers, Hanna Klaudel, Robert-C. Riemann
General Refinement for High Level Petri Nets. FSTTCS (1997)
Joël Goossens, Raymond R. Devillers
The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems. Real Time Syst. 13 (2) (1997)
Eike Best, Raymond R. Devillers, Maciej Koutny
Petri Nets, Process Algebras and Concurrent Programming Languages. Petri Nets (2) (1996)
Raymond R. Devillers
Petri Boxes and Finite Precedence. CONCUR (1996)
Eike Best, Raymond R. Devillers, Elisabeth Pelz, Arend Rensink, Manuel Silva, Enrique Teruel
CALIBAN - Esprit Basic Research WG 6067. STRICT (1995)
Raymond R. Devillers, Hanna Klaudel
Refinement and Recursion in a High Level Petri Box Calculus. STRICT (1995)
Raymond R. Devillers
S-Invariant Analysis of General Recursive Petri Boxes. Acta Informatica 32 (4) (1995)
Thierry Massart, Raymond R. Devillers
Equality of Agent Expressions is preserved Under an Extension of the Universe of Actions. Formal Aspects Comput. 5 (1) (1993)
Raymond R. Devillers
Construction of S-invariants and S-components for Refined Petri Boxes. Application and Theory of Petri Nets (1993)
Eike Best, Raymond R. Devillers, Javier Esparza
General Refinement and Recursion Operators for the Petri Box Calculus. STACS (1993)
Raymond R. Devillers
Maximality Preserving Bisimulation. Theor. Comput. Sci. 102 (1) (1992)
Eike Best, Raymond R. Devillers, Astrid Kiehn, Lucia Pomello
Concurrent Bisimulations in Petri Nets. Acta Informatica 28 (3) (1991)

Raymond R. Devillers.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Raymond R. Devillers