Realization of Petri Nets Without Conditional Statements. - Raymond Devillers; Guy Louchard (Inf. Process. Lett., 1973)

Improvement of Parallelism in a Finite Buffer Sharing Policy. - Raymond Devillers; Guy Louchard (Comput. J., 1976)

Using Auxiliary Variables in Parallel Programs Verification. - Raymond Devillers; Guy Louchard (International Computing Symposium, 1977)

Game Interpretation of the Deadlock Avoidance Problem. - Raymond Devillers (Commun. ACM, 1977)

A General Mechanism for Avoiding Starvation with Distributed Control. - Raymond E. Devillers; Peter E. Lauer (Inf. Process. Lett., 1978)

Specification of highly parallel and distributed resource management. - Peter E. Lauer; Piero R. Torrigiani; Raymond Devillers (Symposium on Programming, 1980)

On a Class of Allocation Strategies Inducing Bounded Delays Only. - J. J. Cocu; Raymond E. Devillers (Comput. J., 1982)

Maximally Concurrent Evolution of Non-sequential Systems. - Ryszard Janicki; Peter E. Lauer; Raymond Devillers (Seminar on Concurrency, 1984)

Concurrent and Maximally Concurrent Evolution of Nonsequential Systems. - Ryszard Janicki; Peter E. Lauer; Maciej Koutny; Raymond Devillers (Theor. Comput. Sci., 1986)

Interleaving and partial orders in concurrency: a formal comparison. - Eike Best; Raymond Devillers (Formal Description of Programming Concepts, 1987)

Sequential and Concurrent Behaviour in Petri Net Theory. - Eike Best; Raymond Devillers (Theor. Comput. Sci., 1987)

The semantics of capacities in P/T nets. - Raymond Devillers (European Workshop on Applications and Theory in Petri Nets, 1988)

Concurrent Bisimulations in Petri Nets. - Eike Best; Raymond Devillers; Astrid Kiehn; Lucia Pomello (Acta Informatica, 1991)

The box calculus: a new causal algebra with multi-label communication. - Eike Best; Raymond Devillers; Jon G. Hall (Advances in Petri Nets: The DEMON Project, 1992)

Maximality preservation and the ST-idea for action refinements. - Raymond Devillers (Advances in Petri Nets: The DEMON Project, 1992)

Maximality Preserving Bisimulation. - Raymond Devillers (Theor. Comput. Sci., 1992)

Construction of S-invariants and S-components for Refined Petri Boxes. - Raymond Devillers (Application and Theory of Petri Nets, 1993)

General Refinement and Recursion Operators for the Petri Box Calculus. - Eike Best; Raymond Devillers; Javier Esparza (STACS, 1993)

Equality of Agent Expressions is preserved Under an Extension of the Universe of Actions. - Thierry Massart; Raymond Devillers (Formal Aspects Comput., 1993)

CALIBAN - Esprit Basic Research WG 6067. - Eike Best; Raymond Devillers; Elisabeth Pelz; Arend Rensink; Manuel Silva 001; Enrique Teruel (STRICT, 1995)

Refinement and Recursion in a High Level Petri Box Calculus. - Raymond Devillers; Hanna Klaudel (STRICT, 1995)

S-Invariant Analysis of General Recursive Petri Boxes. - Raymond Devillers (Acta Informatica, 1995)

Petri Nets, Process Algebras and Concurrent Programming Languages. - Eike Best; Raymond Devillers; Maciej Koutny (Petri Nets (2), 1996)

Petri Boxes and Finite Precedence. - Raymond Devillers (CONCUR, 1996)

General Refinement for High Level Petri Nets. - Raymond Devillers; Hanna Klaudel; Robert-C. Riemann (FSTTCS, 1997)

The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems. - Joël Goossens; Raymond Devillers (Real Time Syst., 1997)

Recursive Nets in the Box Algebra. - Raymond Devillers; Maciej Koutny (ACSD, 1998)

The Box Algebra - A Model of Nets and Process Expressions. - Eike Best; Raymond Devillers; Maciej Koutny (ICATPN, 1999)

Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines. - Joël Goossens; Raymond Devillers (RTCSA, 1999)

General Response Time Computation for the Deadline Driven Scheduling of Periodic Tasks. - Raymond Devillers; Joël Goossens (Fundam. Informaticae, 1999)

Liu and Layland's schedulability test revisited. - Raymond Devillers; Joël Goossens (Inf. Process. Lett., 2000)

An Algebraic Box Calculus. - Raymond Devillers; Hanna Klaudel; Elisabeth Pelz (J. Autom. Lang. Comb., 2000)

Petri net algebra. - Eike Best; Raymond Devillers; Maciej Koutny (Springer, 2001)

A Unified Model for Nets and Process Algebras. - Eike Best; Raymond Devillers; Maciej Koutny (Handbook of Process Algebra, 2001)

Recursion and Petri nets. - Eike Best; Raymond Devillers; Maciej Koutny (Acta Informatica, 2001)

An Algebra of Non-safe Petri Boxes. - Raymond Devillers; Hanna Klaudel; Maciej Koutny; Franck Pommereau (AMAST, 2002)

The Box Algebra = Petri Nets + Process Expressions. - Eike Best; Raymond Devillers; Maciej Koutny (Inf. Comput., 2002)

Asynchronous Box Calculus. - Raymond Devillers; Hanna Klaudel; Maciej Koutny; Franck Pommereau (Fundam. Informaticae, 2003)

General parameterised refinement and recursion for the M-net calculus. - Raymond Devillers; Hanna Klaudel; Robert-C. Riemann (Theor. Comput. Sci., 2003)

Context-based Process Algebras for Mobility. - Raymond Devillers; Hanna Klaudel; Maciej Koutny (ACSD, 2004)

Petri Net Semantics of the Finite pi-Calculus. - Raymond Devillers; Hanna Klaudel; Maciej Koutny (FORTE, 2004)

A Petri Net Semantics of a Simple Process Algebra for Mobility. - Raymond Devillers; Hanna Klaudel; Maciej Koutny (EXPRESS, 2005)

Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets. - Raymond Devillers; Hanna Klaudel (Fundam. Informaticae, 2005)

A Petri Net Translation of pi-Calculus Terms. - Raymond Devillers; Hanna Klaudel; Maciej Koutny (ICTAC, 2006)

Petri Net Semantics of the Finite pi-calculus Terms. - Raymond Devillers; Hanna Klaudel; Maciej Koutny (Fundam. Informaticae, 2006)

Boundedness undecidability for synchronized nets. - Raymond Devillers; Laurent Van Begin (Inf. Process. Lett., 2006)

Joint garbage collection and hard real-time scheduling. - Maxime Van Assche; Joël Goossens; Raymond Devillers (J. Embed. Comput., 2006)

Modelling Mobility in High-level Petri Nets. - Raymond Devillers; Hanna Klaudel; Maciej Koutny (ACSD, 2007)

FIFO Queuing of Constant Length Fully Synchronous Jobs. - Vandy Berten; Raymond Devillers; Guy Louchard (GSEM, 2007)

Incremental and unifying modelling formalism for biological interaction networks. - Anastasia Yartseva; Hanna Klaudel; Raymond Devillers; François Képès (BMC Bioinform., 2007)

From MIN model to ordinary differential equations. - Anastasia Yartseva; Raymond Devillers; Hanna Klaudel; François Képès (J. Integr. Bioinform., 2007)

Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets. - Roland Bouroulet; Raymond Devillers; Hanna Klaudel; Elisabeth Pelz; Franck Pommereau (Petri Nets, 2008)

Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms. - Vincent Nélis; Joël Goossens; Raymond Devillers; Dragomir Milojevic; Nicolas Navet (SUTC, 2008)

A compositional Petri net translation of general pi -calculus terms. - Raymond Devillers; Hanna Klaudel; Maciej Koutny (Formal Aspects Comput., 2008)

Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters. - Franck Pommereau; Raymond Devillers; Hanna Klaudel (INFINITY, 2009)

A Decidable Characterization of a Graphical Pi-calculus with Iterators - Frédéric Peschanski; Hanna Klaudel; Raymond Devillers (INFINITY, 2010)

Implementing Timed Automata Specifications: The "Sandwich" Approach. - Raymond Devillers; Jean-Yves Didier; Hanna Klaudel (ACSD, 2013)

A Petri Net Interpretation of Open Reconfigurable Systems. - Frédéric Peschanski; Hanna Klaudel; Raymond Devillers (Fundam. Informaticae, 2013)

Synthesis of Persistent Systems. - Eike Best; Raymond Devillers (Petri Nets, 2014)

Deadlock and Temporal Properties Analysis in Mixed Reality Applications. - Raymond Devillers; Jean-Yves Didier; Hanna Klaudel; Johan Arcile (ISSRE, 2014)

Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. - Eike Best; Raymond Devillers (LATA, 2014)

Synthesis of Bounded Choice-Free Petri Nets. - Eike Best; Raymond Devillers (CONCUR, 2015)

Modelling and Analysing Mixed Reality Applications. - Johan Arcile; Tadeusz Czachórski; Raymond Devillers; Jean-Yves Didier; Hanna Klaudel; Artur Rataj (ICMMI, 2015)

Synthesis and reengineering of persistent systems. - Eike Best; Raymond Devillers (Acta Informatica, 2015)

State space axioms for T-systems. - Eike Best; Raymond Devillers (Acta Informatica, 2015)

Indefinite waitings in MIRELA systems. - Johan Arcile; Jean-Yves Didier; Hanna Klaudel; Raymond Devillers; Artur Rataj (ESSS, 2015)

Synthesis of Live and Bounded Persistent Systems. - Eike Best; Raymond Devillers (Fundam. Informaticae, 2015)

Products of Transition Systems and Additions of Petri Nets. - Raymond Devillers (ACSD, 2016)

The Power of Prime Cycles. - Eike Best; Raymond Devillers (Petri Nets, 2016)

Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata. - Raymond Devillers; Hanna Klaudel (FORMATS, 2016)

Minimal Elements for the Prime Numbers. - Curtis Bright; Raymond Devillers; Jeffrey O. Shallit (Exp. Math., 2016)

Preface. - Raymond Devillers; Antti Valmari; Wojciech Penczek (Fundam. Informaticae, 2016)

On Liveness and Deadlockability in Subclasses of Weighted Petri Nets. - Thomas Hujsa; Raymond Devillers (Petri Nets, 2017)

Modeling and checking robustness of communicating autonomous vehicles. - Johan Arcile; Raymond Devillers; Hanna Klaudel; Witold Klaudel; Bozena Wozna-Szczesniak (DCAI, 2017)

A Graph-Theoretical Characterisation of State Separation. - Eike Best; Raymond Devillers; Uli Schlachter (SOFSEM, 2017)

Characterisation of the state spaces of marked graph Petri nets. - Eike Best; Raymond Devillers (Inf. Comput., 2017)

Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems. - Raymond Devillers; Evgeny Erofeev; Thomas Hujsa (ATAED@Petri Nets/ACSD, 2018)

Analysis and Synthesis of Weighted Marked Graph Petri Nets. - Raymond Devillers; Thomas Hujsa (Petri Nets, 2018)

Factorisation of Petri Net Solvable Transition Systems. - Raymond Devillers; Uli Schlachter (Petri Nets, 2018)

Bounded choice-free Petri net synthesis: algorithmic issues. - Eike Best; Raymond Devillers; Uli Schlachter (Acta Informatica, 2018)

Factorisation of transition systems. - Raymond Devillers (Acta Informatica, 2018)

Simultaneous Petri Net Synthesis. - Eike Best; Raymond Devillers; Uli Schlachter; Harro Wimmel (Sci. Ann. Comput. Sci., 2018)

On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets. - Thomas Hujsa; Raymond Devillers (Fundam. Informaticae, 2018)

Pre-synthesis of Petri nets based on prime cycles and distance paths. - Eike Best; Raymond Devillers (Sci. Comput. Program., 2018)

Articulation of Transition Systems and Its Application to Petri Net Synthesis. - Raymond Devillers (Petri Nets, 2019)

Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems. - Raymond Devillers; Evgeny Erofeev; Thomas Hujsa (ATAED@Petri Nets/ACSD, 2019)

VerifCar: a framework for modeling and model checking communicating autonomous vehicles. - Johan Arcile; Raymond Devillers; Hanna Klaudel (Auton. Agents Multi Agent Syst., 2019)

Dynamic exploration of multi-agent systems with timed periodic tasks. - Johan Arcile; Raymond Devillers; Hanna Klaudel (CoRR, 2019)

Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods. - Raymond Devillers; Thomas Hujsa (Fundam. Informaticae, 2019)

Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. - Raymond Devillers; Evgeny Erofeev; Thomas Hujsa (Trans. Petri Nets Other Model. Concurr., 2019)

Models for Dynamic Exploration of the Statespaces of Autonomous Vehicles. - Johan Arcile; Raymond Devillers; Hanna Klaudel (PNSE@Petri Nets, 2020)

A New Property of Choice-Free Petri Net Systems. - Eike Best; Raymond Devillers; Evgeny Erofeev (Petri Nets, 2020)

Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks. - Johan Arcile; Raymond Devillers; Hanna Klaudel (Fundam. Informaticae, 2020)

Target-oriented Petri Net Synthesis. - Eike Best; Raymond Devillers; Evgeny Erofeev; Harro Wimmel (Fundam. Informaticae, 2020)

Synthesis of (Choice-Free) Reset Nets. - Raymond Devillers (Petri Nets, 2021)

Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis. - Raymond Devillers (Fundam. Informaticae, 2021)

Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond. - Raymond Devillers; Evgeny Erofeev; Thomas Hujsa (Trans. Petri Nets Other Model. Concurr., 2021)

Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues. - Raymond Devillers; Ronny Tredup (Petri Nets, 2022)

Complexity of Distributed Petri Net Synthesis. - Raymond Devillers; Ronny Tredup (TASE, 2022)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues. - Raymond Devillers; Ronny Tredup (Fundam. Informaticae, 2022)

Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues. - Raymond Devillers; Ronny Tredup (Fundam. Informaticae, 2022)

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. - Raymond Devillers; Ronny Tredup (Fundam. Informaticae, 2022)

On the Reversibility of Circular Conservative Petri Nets. - Raymond Devillers (Petri Nets, 2023)

Factorization of the State Space Construction for Cyclic Systems with Data. - Johan Arcile; Raymond Devillers; Hanna Klaudel (VECoS, 2023)

An Efficient State Space Construction for a Class of Timed Automata. - Johan Arcile; Raymond Devillers; Hanna Klaudel (Trans. Petri Nets Other Model. Concurr., 2023)

Petri Net Primer - A Compendium on the Core Model, Analysis, and Synthesis - Eike Best; Raymond Devillers (Springer, 2024)

Petri Net Synthesis from a Reachability Set. - Eike Best; Raymond Devillers (Petri Nets, 2024)

Coverability in Well-Formed Free-Choice Petri Nets. - Eike Best; Raymond Devillers (Taming the Infinities of Concurrency, 2024)

Persistent Permutations, Fairness, Asymmetric Choice Petri Nets, and Ochmański's Conjecture. - Eike Best; Raymond Devillers (Petri Nets, 2025)

Coverability in Well-Formed Free-Choice Nets. - Eike Best; Raymond Devillers; Petr Jancar (Petri Nets, 2025)