Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Raymond R. Devillers
2010 – today
- 2013
[j29]Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers: A Petri Net Interpretation of Open Reconfigurable Systems. Fundam. Inform. 122(1-2): 85-117 (2013)- 2011
- [c24]Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers: A Petri Net Interpretation of Open Reconfigurable Systems. Petri Nets 2011: 208-227
- 2010
- [c23]Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers: A Decidable Characterization of a Graphical Pi-calculus with Iterators. INFINITY 2010: 47-61
2000 – 2009
- 2009
- [j28]Franck Pommereau, Raymond R. Devillers, Hanna Klaudel: Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters. Electr. Notes Theor. Comput. Sci. 239: 119-129 (2009)
- 2008
- [j27]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)
- [c22]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
- [c21]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
- 2007
- [j26]Anastasia Yartseva, Hanna Klaudel, Raymond R. Devillers, François Képès: Incremental and unifying modelling formalism for biological interaction networks. BMC Bioinformatics 8 (2007)
- [j25]Anastasia Yartseva, Raymond R. Devillers, Hanna Klaudel, François Képès: From MIN model to ordinary differential equations. J. Integrative Bioinformatics 4(3) (2007)
- [c20]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: Modelling Mobility in High-level Petri Nets. ACSD 2007: 110-119
- [c19]Vandy Berten, Raymond R. Devillers, Guy Louchard: FIFO Queuing of Constant Length Fully Synchronous Jobs. GSEM 2007: 81-95
- [i1]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
- [j24]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)
- [j23]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: Petri Net Semantics of the Finite pi-calculus Terms. Fundam. Inform. 70(3): 203-226 (2006)
- [j22]Raymond R. Devillers, Laurent Van Begin: Boundedness undecidability for synchronized nets. Inf. Process. Lett. 99(5): 208-214 (2006)
- [j21]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)
- [c18]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: A Petri Net Translation of pi-Calculus Terms. ICTAC 2006: 138-152
- 2005
- [j20]Raymond R. Devillers, Hanna Klaudel: Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets. Fundam. Inform. 66(3): 221-257 (2005)
- 2004
- [c17]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: Context-based Process Algebras for Mobility. ACSD 2004: 79-88
- [c16]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny: Petri Net Semantics of the Finite pi-Calculus. FORTE 2004: 309-325
- 2003
- [j19]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny, Franck Pommereau: Asynchronous Box Calculus. Fundam. Inform. 54(4): 295-344 (2003)
- [j18]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
- [j17]Eike Best, Raymond R. Devillers, Maciej Koutny: The Box Algebra = Petri Nets + Process Expressions. Inf. Comput. 178(1): 44-100 (2002)
- [c15]Raymond R. Devillers, Hanna Klaudel, Maciej Koutny, Franck Pommereau: An Algebra of Non-safe Petri Boxes. AMAST 2002: 192-207
- 2001
- [b1]Eike Best, Raymond R. Devillers, Maciej Koutny: Petri net algebra. Springer 2001, ISBN 978-3-540-67398-9, pp. I-XI, 1-378
- [j16]Eike Best, Raymond R. Devillers, Maciej Koutny: Recursion and Petri nets. Acta Inf. 37(11-12): 781-829 (2001)
- 2000
- [j15]Raymond R. Devillers, Joël Goossens: Liu and Layland's schedulability test revisited. Inf. Process. Lett. 73(5-6): 157-161 (2000)
- [j14]Raymond R. Devillers, Hanna Klaudel, Elisabeth Pelz: An Algebraic Box Calculus. Journal of Automata, Languages and Combinatorics 5(2): 81-108 (2000)
1990 – 1999
- 1999
- [j13]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)
- [c14]Eike Best, Raymond R. Devillers, Maciej Koutny: The Box Algebra - A Model of Nets and Process Expressions. ICATPN 1999: 344-363
- [c13]Joël Goossens, Raymond R. Devillers: Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines. RTCSA 1999: 54-61
- 1998
- [c12]
- 1997
- [j12]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)
- [c11]Raymond R. Devillers, Hanna Klaudel, Robert-C. Riemann: General Refinement for High Level Petri Nets. FSTTCS 1997: 297-311
- 1996
- [c10]Eike Best, Raymond R. Devillers, Maciej Koutny: Petri Nets, Process Algebras and Concurrent Programming Languages. Petri Nets (2) 1996: 1-84
- [c9]
- 1995
- [j11]Raymond R. Devillers: S-Invariant Analysis of General Recursive Petri Boxes. Acta Inf. 32(4): 313-345 (1995)
- 1993
- [j10]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)
- [c8]Raymond R. Devillers: Construction of S-invariants and S-components for Refined Petri Boxes. Application and Theory of Petri Nets 1993: 242-261
- [c7]Eike Best, Raymond R. Devillers, Javier Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. STACS 1993: 130-140
- 1992
- [j9]Raymond R. Devillers: Maximality Preserving Bisimulation. Theor. Comput. Sci. 102(1): 165-183 (1992)
- [c6]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
- [c5]Raymond R. Devillers: Maximality preservation and the ST-idea for action refinements. Advances in Petri Nets: The DEMON Project 1992: 108-151
- 1991
- [j8]Eike Best, Raymond R. Devillers, Astrid Kiehn, Lucia Pomello: Concurrent Bisimulations in Petri Nets. Acta Inf. 28(3): 231-264 (1991)
1980 – 1989
- 1988
- [c4]Raymond R. Devillers: The semantics of capacities in P/T nets. European Workshop on Applications and Theory in Petri Nets 1988: 128-150
- 1987
- [j7]Eike Best, Raymond R. Devillers: Sequential and Concurrent Behaviour in Petri Net Theory. Theor. Comput. Sci. 55(1): 87-136 (1987)
- 1986
- [j6]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
- [c3]Ryszard Janicki, Peter E. Lauer, Raymond R. Devillers: Maximally Concurrent Evolution of Non-sequential Systems. Seminar on Concurrency 1984: 268-280
- 1982
- [j5]J. J. Cocu, Raymond R. Devillers: On a Class of Allocation Strategies Inducing Bounded Delays Only. Comput. J. 25(1): 52-55 (1982)
- 1980
- [c2]Peter E. Lauer, Piero R. Torrigiani, Raymond R. Devillers: A Cosy Banker. Symposium on Programming 1980: 223-239
1970 – 1979
- 1978
- [j4]Raymond R. Devillers, Peter E. Lauer: A General Mechanism for Avoiding Starvation with Distributed Control. Inf. Process. Lett. 7(3): 156-158 (1978)
- 1977
- [j3]Raymond R. Devillers: Game Interpretation of the Deadlock Avoidance Problem. Commun. ACM 20(10): 741-745 (1977)
- [c1]Raymond R. Devillers, Guy Louchard: Using Auxiliary Variables in Parallel Programs Verification. International Computing Symposium 1977: 217-225
- 1976
- [j2]Raymond R. Devillers, Guy Louchard: Improvement of Parallelism in a Finite Buffer Sharing Policy. Comput. J. 19(3): 238-245 (1976)
- 1973
- [j1]Raymond R. Devillers, Guy Louchard: Realization of Petri Nets Without Conditional Statements. Inf. Process. Lett. 2(4): 105-107 (1973)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-09 22:08 CEST by the dblp team