( en | de | ru )

 

Disambiguation of "Devillers, Raymond R."

Author of the publication

copydeleteadd this publication to your clipboard
Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems.

, , and . ATAED@Petri Nets/ACSD, volume 2371 of CEUR Workshop Proceedings, page 6-22. CEUR-WS.org, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Bertrand Devillers

Olivier Devillers

Raymond Hoheisel

Raymond Freymann

Raymond Ellul

 

Other publications of authors with the same name

Refinement and Recursion in a High Level Petri Box Calculus., and . STRICT, page 144-159. Springer, (1995)The semantics of capacities in P/T nets.. European Workshop on Applications and Theory in Petri Nets, volume 424 of Lecture Notes in Computer Science, page 128-150. Springer, (1988)On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets., and . Fundam. Informaticae, 189 (3-4): 261-296 (2022)On the Reversibility of Circular Conservative Petri Nets.. Petri Nets, volume 13929 of Lecture Notes in Computer Science, page 307-323. Springer, (2023)Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues., and . Petri Nets, volume 13288 of Lecture Notes in Computer Science, page 213-235. Springer, (2022)Equality of Agent Expressions is preserved Under an Extension of the Universe of Actions., and . Formal Aspects Comput., 5 (1): 79-88 (1993)Recursive Nets in the Box Algebra., and . ACSD, page 239-249. IEEE Computer Society, (1998)Maximality preservation and the ST-idea for action refinements.. Advances in Petri Nets: The DEMON Project, volume 609 of Lecture Notes in Computer Science, Springer, (1992)Interleaving and partial orders in concurrency: a formal comparison., and . Formal Description of Programming Concepts, page 299-324. North-Holland, (1987)A New Property of Choice-Free Petri Net Systems., , and . Petri Nets, volume 12152 of Lecture Notes in Computer Science, page 89-108. Springer, (2020)