Philippe Darondeau

Publication Activity (10 Years)

Years Active: 1974-2015
Publications (10 Years): 1

Top Topics

Timed Petri Nets

Transition Systems

Top Venues

Trans. Petri Nets Other Model. Concurr.

Discret. Event Dyn. Syst.

Log. Methods Comput. Sci.

Publications

Philippe Darondeau, Hervé Marchand, S. Laurie Ricker
Enforcing opacity of regular predicates on modal transition systems. Discret. Event Dyn. Syst. 25 (1-2) (2015)
Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan
Petri Net Reachability Graphs: Decidability Status of First Order Properties Log. Methods Comput. Sci. 8 (4) (2012)
Philippe Darondeau
Enforcing opacity of regular predicates on modal transition systems. WODES (2012)
Eike Best, Philippe Darondeau
Deciding Selective Declassification of Petri Nets. POST (2012)
Philippe Darondeau, S. Laurie Ricker
Distributed Control of Discrete-Event Systems: A First Step. Trans. Petri Nets Other Model. Concurr. 6 (2012)
Philippe Darondeau, Loïc Hélouët, Madhavan Mukund
Assembling Sessions. ATVA (2011)
Eike Best, Philippe Darondeau
Petri Net Distributability. Ershov Memorial Conference (2011)
Philippe Darondeau, S. Laurie Ricker
Towards Distributed Control of Discrete-Event Systems. ART @ Petri Nets (2011)
Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan
Petri Net Reachability Graphs: Decidability Status of FO Properties. FSTTCS (2011)
Eike Best, Philippe Darondeau
Separability in Persistent Petri Nets. Fundam. Informaticae 113 (3-4) (2011)
Éric Badouel, Anne Bouillard, Philippe Darondeau, Jan Komenda
Residuation of tropical series: Rationality issues. CDC/ECC (2011)
Jérémy Dubreil, Philippe Darondeau, Hervé Marchand
Supervisory Control for Opacity. IEEE Trans. Autom. Control. 55 (5) (2010)
Eike Best, Philippe Darondeau
Separability in Persistent Petri Nets. Petri Nets (2010)
Philippe Darondeau, Jérémy Dubreil, Hervé Marchand
Supervisory control for modal specifications of services. WODES (2010)
Eike Best, Philippe Darondeau, Roberto Gorrieri
On the Decidability of Non Interference over Unbounded Petri Nets SecCo (2010)
Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang
Quasi-static scheduling of communicating tasks. Inf. Comput. 208 (10) (2010)
Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alexandre Yakovlev
Synthesis of Nets with Step Firing Policies. Fundam. Informaticae 94 (3-4) (2009)
Eike Best, Philippe Darondeau
A decomposition theorem for finite persistent transition systems. Acta Informatica 46 (3) (2009)
Eike Best, Philippe Darondeau
Decomposition Theorems for Bounded Persistent Petri Nets. Petri Nets (2008)
Philippe Darondeau, Blaise Genest, Loïc Hélouët
Products of Message Sequence Charts. FoSSaCS (2008)
Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alexandre Yakovlev
Synthesis of Nets with Step Firing Policies. Petri Nets (2008)
Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang
Quasi-Static Scheduling of Communicating Tasks. CONCUR (2008)
Philippe Darondeau
On the Synthesis of Zero-Safe Nets. Concurrency, Graphs and Models (2008)
Eike Best, Philippe Darondeau, Harro Wimmel
Making Petri Nets Safe and Free of Internal Transitions. Fundam. Informaticae 80 (1-3) (2007)
Philippe Darondeau
Synthesis and Control of Asynchronous and Distributed Systems. ACSD (2007)
Éric Badouel, Marek A. Bednarczyk, Andrzej M. Borzyszkowski, Benoît Caillaud, Philippe Darondeau
Concurrent Secrets. Discret. Event Dyn. Syst. 17 (4) (2007)
Philippe Darondeau
Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets. Inf. Process. Lett. 94 (6) (2005)
Philippe Darondeau
Distributed implementations of Ramadge-Wonham supervisory control with Petri nets. CDC/ECC (2005)
René K. Boel, Philippe Darondeau, Sadatoshi Kumagai
Foreword. Discret. Event Dyn. Syst. 15 (1) (2005)
Andrzej M. Borzyszkowski, Philippe Darondeau
Transition systems without transitions. Theor. Comput. Sci. 338 (1-3) (2005)
Éric Badouel, Philippe Darondeau
The synthesis of Petri nets from path-automatic specifications. Inf. Comput. 193 (2) (2004)
Philippe Darondeau, X. Xie
Linear control of live marked graphs. Autom. 39 (3) (2003)
Philippe Darondeau
Unbounded Petri Net Synthesis. Lectures on Concurrency and Petri Nets (2003)
Éric Badouel, Benoît Caillaud, Philippe Darondeau
Distributing Finite Automata Through Petri Net Synthesis. Formal Aspects Comput. 13 (6) (2002)
Philippe Darondeau
On the Petri net realization of context-free graphs. Theor. Comput. Sci. 258 (1-2) (2001)
Éric Badouel, Marek A. Bednarczyk, Philippe Darondeau
Generalized Automata and Their Net Representations. Unifying Petri Nets (2001)
Benoît Caillaud, Philippe Darondeau, Loïc Hélouët, Gilles Lesventes
HMSCs as Partial Specifications ... with PNs as Completions. MOVEP (2000)
Philippe Darondeau
Region Based Synthesis of P/T-Nets and Its Potential Applications. ICATPN (2000)
Éric Badouel, Philippe Darondeau, Jean-Claude Raoult
Context-Free Event Domains are Recognizable. Inf. Comput. 149 (2) (1999)
Éric Badouel, Philippe Darondeau, Andrew Tokmakoff
Modelling Dynamic Agent Systems with Cooperating Automata. PDPTA (1999)
Philippe Darondeau
Deriving Unbounded Petri Nets from Formal Languages. CONCUR (1998)
Éric Badouel, Philippe Darondeau
Stratified Petri Nets. FCT (1997)
Éric Badouel, Luca Bernardinello, Philippe Darondeau
The Synthesis Problem for Elementary Net Systems is NP-Complete. Theor. Comput. Sci. 186 (1-2) (1997)
Éric Badouel, Philippe Darondeau
Theory of Regions. Petri Nets (1996)
Éric Badouel, Philippe Darondeau
Dualities Between Nets and Automata Induced by Schizophrenic Objects. Category Theory and Computer Science (1995)
Éric Badouel, Luca Bernardinello, Philippe Darondeau
Polynomial Algorithms for the Synthesis of Bounded Nets. TAPSOFT (1995)
Éric Badouel, Philippe Darondeau
Trace Nets and Process Automata. Acta Informatica 32 (7) (1995)
Éric Badouel, Philippe Darondeau, Jean-Claude Raoult
Context-Free Event Domains are Recognizable. AMAST (1995)
Philippe Darondeau, Pierpaolo Degano
Refinement of Actions in Event Structures and Causal Trees. Theor. Comput. Sci. 118 (1) (1993)
Philippe Darondeau, Doris Nolte, Lutz Priese, Serge Yoccoz
Fairness, Distances and Degrees. Theor. Comput. Sci. 97 (1) (1992)
Éric Badouel, Philippe Darondeau
Trace Nets. REX Workshop (1992)
Éric Badouel, Philippe Darondeau
Structural Operational Specifications and the Trace Automata. CONCUR (1992)
Philippe Darondeau, Serge Yoccoz
Proof Systems for Infinite Behaviours Inf. Comput. 99 (2) (1992)
Éric Badouel, Philippe Darondeau
On Guarded Recursion. Theor. Comput. Sci. 82 (2) (1991)
Philippe Darondeau, Pierpaolo Degano
About semantic action refinement. Fundam. Informaticae 14 (2) (1991)
Philippe Darondeau
Recursive Graphs are not Stable under Maximal Reduction. Bull. EATCS 44 (1991)
Philippe Darondeau, Pierpaolo Degano
Causal Trees: Interleaving + Causality. Semantics of Systems of Concurrent Processes (1990)
Philippe Darondeau
Concurrency and Computability. Semantics of Systems of Concurrent Processes (1990)
Philippe Darondeau, Pierpaolo Degano
Event Structures, Causal Trees, and Refinements. MFCS (1990)
Philippe Darondeau, Pierpaolo Degano
Causal Trees. ICALP (1989)
Philippe Darondeau
Bisimulation and Effectiveness. Inf. Process. Lett. 30 (1) (1989)
Philippe Darondeau, B. Gamatie
A Fullt Observational Model for Infinite Behaviours of Communicating Systems. TAPSOFT, Vol.1 (1987)
Philippe Darondeau
Separating and Testing. STACS (1986)
Philippe Darondeau
Une Critique de La Notion de Test de Processus Fondée Sur La Non Séparabilité de Certaines Classes de Langages. RAIRO Theor. Informatics Appl. 20 (3) (1986)
Philippe Darondeau
About Fair Asynchrony. Theor. Comput. Sci. 37 (1985)
Philippe Darondeau, Laurent Kott
A formal proof system for infinitary rational expressions. Automata on Infinite Words (1984)
Philippe Darondeau
A Fully Abstract Model of Fair Asynchrony. Seminar on Concurrency (1984)
Philippe Darondeau, Laurent Kott
Towards a Formal Proof System for omega-Rational Expressions. Inf. Process. Lett. 19 (4) (1984)
Philippe Darondeau
About Fair Asynchrony. Logics and Models of Concurrent Systems (1984)
Philippe Darondeau, Laurent Kott
On the Observational Semantics of Fair Parallelism. ICALP (1983)
Philippe Darondeau
An enlarged definition and complete axiomatization of observational congruence of finite processes. Symposium on Programming (1982)
Philippe Darondeau, Paul Le Guernic, Michel Raynal
Types in a Mixed Language System. BIT 21 (3) (1981)
Philippe Darondeau
Processus non-séquentiels et leurs observations en univers non-centralisé. Symposium on Programming (1980)
Philippe Darondeau, Serge Guiboud-Ribaud, Claude Otrage
Application de la strucuturation des systéme à la conception interne du système GEMAU. Symposium on Programming (1974)
Philippe Darondeau, Serge Guiboud-Ribaud, Claude Otrage
A Formal Model for System Oriented Architecture. IFIP Congress (1974)