Paul Ruet

Chargé de recherche en mathématiques au CNRS

Adresse : IRIF, Université Paris Diderot - Paris 7, Case 7014, 75205 Paris Cedex 13
Email : nomdefamille arobase irif point fr
Bureau : 3023, bâtiment Sophie Germain, 8 place Aurélie Nemours, 75013 Paris

Recherche - Enseignement

Negative local feedbacks in Boolean networks, Paul Ruet (Discrete Applied Mathematics 221: 1-17, 2017)
Local cycles and dynamical properties of Boolean networks, Paul Ruet (Mathematical Structures in Computer Science 26(4): 702-718, 2016)
Asynchronous Boolean networks and hereditarily bijective maps, Paul Ruet (Natural Computing 14(4): 545-553, 2015)
Geometric characterization of hereditarily bijective Boolean networks, Paul Ruet (Asynchronous Cellular Automata and Asynchronous Discrete Models, Springer LNCS 8751: 536-545, 2014)
From kernels in directed graphs to fixed points and negative cycles in Boolean networks, Adrien Richard, Paul Ruet (Discrete Applied Mathematics 161: 1106-1117, 2013)
From minimal signed circuits to the dynamics of Boolean regulatory networks, Elisabeth Remy, Paul Ruet (Bioinformatics 24: i220-i226, 2008)
Spatial differentiation and positive circuits in a discrete framework, Anne Crumière, Paul Ruet (Development of Computational Models, ENTCS 192: 85-100, 2008)
Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework, Elisabeth Remy, Paul Ruet, Denis Thieffry (Advances in Applied Mathematics 41(3): 335-350, 2008)
Cyclic extensions of order varieties, Pierre Ille, Paul Ruet (Foundations of Informatics, Computing and Software, ENTCS 212: 119-132, 2008)
On differentiation and homeostatic behaviours of Boolean dynamical systems, Elisabeth Remy, Paul Ruet (Transactions on Computational Systems Biology VIII, Springer LNCS 4780: 92-101, 2007)
Non-commutative proof construction: a constraint-based approach, Jean-Marc Andreoli, Roberto Maieli, Paul Ruet (Annals of Pure and Applied Logic 142(1-3): 212-244, 2006)
Positive or negative regulatory circuit inference from multilevel dynamics, Elisabeth Remy, Paul Ruet, Denis Thieffry (Positive Systems: Theory and Applications, Springer LNCIS 341: 263-270, 2006)
From logical regulatory graphs to standard Petri nets: dynamical roles and functionality of feedback circuits, Elisabeth Remy, Paul Ruet, Luis Mendoza, Denis Thieffry, Claudine Chaouiya (Transactions on Computational Systems Biology VII, Springer LNCS 4230: 56-72, 2006)
Permutative logic, Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet (Computer Science Logic, Springer LNCS 3634: 184-199, 2005)
Linear logic in computer science, édité par Thomas Ehrhard, Jean-Yves Girard, Paul Ruet, Phil Scott (London Mathematical Society Lecture Note Series 316, Cambridge U. P., 2004)
Qualitative modelling of genetic networks: from logical regulatory graphs to standard Petri nets, Claudine Chaouiya, Elisabeth Remy, Paul Ruet, Denis Thieffry (Application and Theory of Petri Nets, Springer LNCS 3099: 137-156, 2004)
Non-commutative logic III: focusing proofs, Roberto Maieli, Paul Ruet (Information and Computation 185(2): 233-262, 2003)
Entropic Hopf algebras and models of non-commutative logic, Rick Blute, François Lamarche, Paul Ruet (Theory and Applications of Categories 10(17): 424-460, 2002)
Self-adjoint negation, Paul Ruet (Prépublication IML 2002-23, 2001)
Linear concurrent constraint programming: operational and phase semantics, François Fages, Paul Ruet, Sylvain Soliman (Information and Computation 165(1): 14-41, 2001)
Non-commutative logic II: sequent calculus and phase semantics, Paul Ruet (Mathematical Structures in Computer Science 10(2): 277-312, 2000)
Non-commutative logic I: the multiplicative fragment, V. Michele Abrusci, Paul Ruet (Annals of Pure and Applied Logic 101(1): 29-64, 2000)
Phase semantics and verification of concurrent constraint programs, François Fages, Paul Ruet, Sylvain Soliman (Logic in Computer Science, IEEE, 1998)
Concurrent constraint programming and non-commutative logic, Paul Ruet, François Fages (Computer Science Logic 1997, Springer LNCS 1414: 406-423, 1998)
Logique non-commutative et programmation concurrente par contraintes, Paul Ruet (Thèse de doctorat, Université Paris 7, LIENS-97-18, 1997)
Non-commutative linear logic with mobilities, Paul Ruet (Bulletin of Symbolic Logic 3(2): 274-275, 1997)
Combining explicit negation and negation by failure via Belnap's logic, Paul Ruet, François Fages (Theoretical Computer Science 171: 61-75, 1997)
Logical semantics of concurrent constraint programming, Paul Ruet (Constraint Programming, Springer LNCS 1118: 397-409, 1996)