2008 |
48 | EE | 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: 72-91 |
47 | EE | Vincent Nélis,
Joël Goossens,
Raymond R. Devillers,
Dragomir Milojevic,
Nicolas Navet:
Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms.
SUTC 2008: 209-216 |
46 | EE | Raymond R. Devillers,
Hanna Klaudel,
Maciej Koutny:
A compositional Petri net translation of general pi -calculus terms.
Formal Asp. Comput. 20(4-5): 429-450 (2008) |
2007 |
45 | EE | Raymond R. Devillers,
Hanna Klaudel,
Maciej Koutny:
Modelling Mobility in High-level Petri Nets.
ACSD 2007: 110-119 |
44 | | Vandy Berten,
Raymond R. Devillers,
Guy Louchard:
FIFO Queuing of Constant Length Fully Synchronous Jobs.
GSEM 2007: 81-95 |
43 | EE | Vincent Nélis,
Joël Goossens,
Nicolas Navet,
Raymond R. Devillers,
Dragomir Milojevic:
Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms
CoRR abs/0712.2958: (2007) |
2006 |
42 | EE | Raymond R. Devillers,
Hanna Klaudel,
Maciej Koutny:
A Petri Net Translation of pi-Calculus Terms.
ICTAC 2006: 138-152 |
41 | EE | Raymond R. Devillers,
Hanna Klaudel,
Maciej Koutny:
A Petri Net Semantics of a Simple Process Algebra for Mobility.
Electr. Notes Theor. Comput. Sci. 154(3): 71-94 (2006) |
40 | EE | Raymond R. Devillers,
Hanna Klaudel,
Maciej Koutny:
Petri Net Semantics of the Finite pi-calculus Terms.
Fundam. Inform. 70(3): 203-226 (2006) |
39 | EE | Raymond R. Devillers,
Laurent Van Begin:
Boundedness undecidability for synchronized nets.
Inf. Process. Lett. 99(5): 208-214 (2006) |
38 | EE | Maxime Van Assche,
Joël Goossens,
Raymond R. Devillers:
Joint garbage collection and hard real-time scheduling.
J. Embedded Computing 2(3-4): 313-326 (2006) |
2005 |
37 | EE | Raymond R. Devillers,
Hanna Klaudel:
Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets.
Fundam. Inform. 66(3): 221-257 (2005) |
2004 |
36 | EE | Raymond R. Devillers,
Hanna Klaudel,
Maciej Koutny:
Context-based Process Algebras for Mobility.
ACSD 2004: 79-88 |
35 | EE | Raymond R. Devillers,
Hanna Klaudel,
Maciej Koutny:
Petri Net Semantics of the Finite pi-Calculus.
FORTE 2004: 309-325 |
2003 |
34 | EE | Raymond R. Devillers,
Hanna Klaudel,
Maciej Koutny,
Franck Pommereau:
Asynchronous Box Calculus.
Fundam. Inform. 54(4): 295-344 (2003) |
33 | EE | Raymond R. Devillers,
Hanna Klaudel,
Robert-C. Riemann:
General parameterised refinement and recursion for the M-net calculus.
Theor. Comput. Sci. 300(1-3): 259-300 (2003) |
2002 |
32 | EE | Raymond R. Devillers,
Hanna Klaudel,
Maciej Koutny,
Franck Pommereau:
An Algebra of Non-safe Petri Boxes.
AMAST 2002: 192-207 |
31 | EE | Eike Best,
Raymond R. Devillers,
Maciej Koutny:
The Box Algebra = Petri Nets + Process Expressions.
Inf. Comput. 178(1): 44-100 (2002) |
2001 |
30 | EE | Eike Best,
Raymond R. Devillers,
Maciej Koutny:
Recursion and Petri nets.
Acta Inf. 37(11-12): 781-829 (2001) |
2000 |
29 | EE | Raymond R. Devillers,
Joël Goossens:
Liu and Layland's schedulability test revisited.
Inf. Process. Lett. 73(5-6): 157-161 (2000) |
28 | | Raymond R. Devillers,
Hanna Klaudel,
Elisabeth Pelz:
An Algebraic Box Calculus.
Journal of Automata, Languages and Combinatorics 5(2): 81-108 (2000) |
1999 |
27 | EE | Eike Best,
Raymond R. Devillers,
Maciej Koutny:
The Box Algebra - A Model of Nets and Process Expressions.
ICATPN 1999: 344-363 |
26 | EE | Joël Goossens,
Raymond R. Devillers:
Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines.
RTCSA 1999: 54-61 |
25 | | Raymond R. Devillers,
Joël Goossens:
General Response Time Computation for the Deadline Driven Scheduling of Periodic Tasks.
Fundam. Inform. 40(2-3): 199-219 (1999) |
1998 |
24 | EE | Raymond R. Devillers,
Maciej Koutny:
Recursive Nets in the Box Algebra.
ACSD 1998: 239-249 |
1997 |
23 | EE | Raymond R. Devillers,
Hanna Klaudel,
Robert-C. Riemann:
General Refinement for High Level Petri Nets.
FSTTCS 1997: 297-311 |
22 | | Joël Goossens,
Raymond R. Devillers:
The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems.
Real-Time Systems 13(2): 107-126 (1997) |
1996 |
21 | | Raymond R. Devillers:
Petri Boxes and Finite Precedence.
CONCUR 1996: 465-480 |
20 | | Eike Best,
Raymond R. Devillers,
Maciej Koutny:
Petri Nets, Process Algebras and Concurrent Programming Languages.
Petri Nets (2) 1996: 1-84 |
1995 |
19 | | Raymond R. Devillers:
S-Invariant Analysis of General Recursive Petri Boxes
Acta Inf. 32(4): 313-345 (1995) |
1993 |
18 | | Raymond R. Devillers:
Construction of S-invariants and S-components for Refined Petri Boxes.
Application and Theory of Petri Nets 1993: 242-261 |
17 | | Eike Best,
Raymond R. Devillers,
Javier Esparza:
General Refinement and Recursion Operators for the Petri Box Calculus.
STACS 1993: 130-140 |
16 | | Thierry Massart,
Raymond R. Devillers:
Equality of Agent Expressions is preserved Under an Extension of the Universe of Actions.
Formal Asp. Comput. 5(1): 79-88 (1993) |
1992 |
15 | | Raymond R. Devillers:
Maximality preservation and the ST-idea for action refinements.
Advances in Petri Nets: The DEMON Project 1992: 108-151 |
14 | | Eike Best,
Raymond R. Devillers,
Jon G. Hall:
The box calculus: a new causal algebra with multi-label communication.
Advances in Petri Nets: The DEMON Project 1992: 21-69 |
13 | | Raymond R. Devillers:
Maximality Preserving Bisimulation.
Theor. Comput. Sci. 102(1): 165-183 (1992) |
1991 |
12 | | Eike Best,
Raymond R. Devillers,
Astrid Kiehn,
Lucia Pomello:
Concurrent Bisimulations in Petri Nets.
Acta Inf. 28(3): 231-264 (1991) |
1988 |
11 | | Raymond R. Devillers:
The semantics of capacities in P/T nets.
European Workshop on Applications and Theory in Petri Nets 1988: 128-150 |
1987 |
10 | | Eike Best,
Raymond R. Devillers:
Sequential and Concurrent Behaviour in Petri Net Theory.
Theor. Comput. Sci. 55(1): 87-136 (1987) |
1986 |
9 | | Ryszard Janicki,
Peter E. Lauer,
Maciej Koutny,
Raymond R. Devillers:
Concurrent and Maximally Concurrent Evolution of Nonsequential Systems.
Theor. Comput. Sci. 43: 213-238 (1986) |
1984 |
8 | | Ryszard Janicki,
Peter E. Lauer,
Raymond R. Devillers:
Maximally Concurrent Evolution of Non-sequential Systems.
Seminar on Concurrency 1984: 268-280 |
1982 |
7 | | J. J. Cocu,
Raymond R. Devillers:
On a Class of Allocation Strategies Inducing Bounded Delays Only.
Comput. J. 25(1): 52-55 (1982) |
1980 |
6 | | Peter E. Lauer,
Piero R. Torrigiani,
Raymond R. Devillers:
A Cosy Banker.
Symposium on Programming 1980: 223-239 |
1978 |
5 | | Raymond R. Devillers,
Peter E. Lauer:
A General Mechanism for Avoiding Starvation with Distributed Control.
Inf. Process. Lett. 7(3): 156-158 (1978) |
1977 |
4 | | Raymond R. Devillers,
Guy Louchard:
Using Auxiliary Variables in Parallel Programs Verification.
International Computing Symposium 1977: 217-225 |
3 | | Raymond R. Devillers:
Game Interpretation of the Deadlock Avoidance Problem.
Commun. ACM 20(10): 741-745 (1977) |
1976 |
2 | | Raymond R. Devillers,
Guy Louchard:
Improvement of Parallelism in a Finite Buffer Sharing Policy.
Comput. J. 19(3): 238-245 (1976) |
1973 |
1 | | Raymond R. Devillers,
Guy Louchard:
Realization of Petri Nets Without Conditional Statements.
Inf. Process. Lett. 2(4): 105-107 (1973) |