Philippe Darondeau

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