Philippe Darondeau

According to our database1, Philippe Darondeau authored at least 70 papers between 1974 and 2015.

Collaborative distances:



In proceedings 
PhD thesis 




Petri Net Synthesis
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-47967-4, 2015

Enforcing opacity of regular predicates on modal transition systems.
Discrete Event Dynamic Systems, 2015

Distributed Control of Discrete-Event Systems: A First Step.
Trans. Petri Nets and Other Models of Concurrency, 2012

Petri Net Reachability Graphs: Decidability Status of First Order Properties
Logical Methods in Computer Science, 2012

Enforcing opacity of regular predicates on modal transition systems.
Proceedings of the 11th International Workshop on Discrete Event Systems, 2012

Deciding Selective Declassification of Petri Nets.
Proceedings of the Principles of Security and Trust - First International Conference, 2012

Petri Net Reachability Graphs: Decidability Status of FO Properties.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Petri Net Distributability.
Proceedings of the Perspectives of Systems Informatics, 2011

Residuation of tropical series: Rationality issues.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

Assembling Sessions.
Proceedings of the Automated Technology for Verification and Analysis, 2011

Towards Distributed Control of Discrete-Event Systems.
Proceedings of the Workshop Applications of Region Theory 2011, 2011

Supervisory Control for Opacity.
IEEE Trans. Automat. Contr., 2010

On the Decidability of Non Interference over Unbounded Petri Nets
Proceedings of the Proceedings 8th International Workshop on Security Issues in Concurrency, 2010

Supervisory control for modal specifications of services.
Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

Separability in Persistent Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 2010

A decomposition theorem for finite persistent transition systems.
Acta Inf., 2009

Products of Message Sequence Charts.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Quasi-Static Scheduling of Communicating Tasks.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

On the Synthesis of Zero-Safe Nets.
Proceedings of the Concurrency, 2008

Synthesis of Nets with Step Firing Policies.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

Decomposition Theorems for Bounded Persistent Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

Making Petri Nets Safe and Free of Internal Transitions.
Fundam. Inform., 2007

Concurrent Secrets.
Discrete Event Dynamic Systems, 2007

Synthesis and Control of Asynchronous and Distributed Systems.
Proceedings of the Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 2007

Transition systems without transitions.
Theor. Comput. Sci., 2005

Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets.
Inf. Process. Lett., 2005

Discrete Event Dynamic Systems, 2005

The synthesis of Petri nets from path-automatic specifications.
Inf. Comput., 2004

Linear control of live marked graphs.
Automatica, 2003

Unbounded Petri Net Synthesis.
Proceedings of the Lectures on Concurrency and Petri Nets, 2003

Distributing Finite Automata Through Petri Net Synthesis.
Formal Asp. Comput., 2002

On the Petri net realization of context-free graphs.
Theor. Comput. Sci., 2001

Generalized Automata and Their Net Representations.
Proceedings of the Unifying Petri Nets, Advances in Petri Nets, 2001

HMSCs as Partial Specifications ... with PNs as Completions.
Proceedings of the Modeling and Verification of Parallel Processes, 4th Summer School, 2000

Region Based Synthesis of P/T-Nets and Its Potential Applications.
ICATPN, 2000

Modelling Dynamic Agent Systems with Cooperating Automata.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Deriving Unbounded Petri Nets from Formal Languages.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

The Synthesis Problem for Elementary Net Systems is NP-Complete.
Theor. Comput. Sci., 1997

Stratified Petri Nets.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Theory of Regions.
Proceedings of the Lectures on Petri Nets I: Basic Models, 1996

Trace Nets and Process Automata.
Acta Inf., 1995

Polynomial Algorithms for the Synthesis of Bounded Nets.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Dualities Between Nets and Automata Induced by Schizophrenic Objects.
Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

Context-Free Event Domains are Recognizable.
Proceedings of the Algebraic Methodology and Software Technology, 1995

Refinement of Actions in Event Structures and Causal Trees.
Theor. Comput. Sci., 1993

Proof Systems for Infinite Behaviours
Inf. Comput., August, 1992

Fairness, Distances and Degrees.
Theor. Comput. Sci., 1992

Trace Nets.
Proceedings of the Sematics: Foundations and Applications, 1992

Structural Operational Specifications and the Trace Automata.
Proceedings of the CONCUR '92, 1992

On Guarded Recursion.
Theor. Comput. Sci., 1991

About semantic action refinement.
Fundam. Inform., 1991

Recursive Graphs are not Stable under Maximal Reduction.
Bulletin of the EATCS, 1991

Event Structures, Causal Trees, and Refinements.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Causal Trees: Interleaving + Causality.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

Concurrency and Computability.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

Bisimulation and Effectiveness.
Inf. Process. Lett., 1989

Causal Trees.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

A Fullt Observational Model for Infinite Behaviours of Communicating Systems.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

Une Critique de La Notion de Test de Processus Fondée Sur La Non Séparabilité de Certaines Classes de Langages.
ITA, 1986

Separating and Testing.
Proceedings of the STACS 86, 1986

About Fair Asynchrony.
Theor. Comput. Sci., 1985

Towards a Formal Proof System for omega-Rational Expressions.
Inf. Process. Lett., 1984

A formal proof system for infinitary rational expressions.
Proceedings of the Automata on Infinite Words, 1984

A Fully Abstract Model of Fair Asynchrony.
Proceedings of the Seminar on Concurrency, 1984

On the Observational Semantics of Fair Parallelism.
Proceedings of the Automata, 1983

An enlarged definition and complete axiomatization of observational congruence of finite processes.
Proceedings of the International Symposium on Programming, 1982

Types in a Mixed Language System.
BIT, 1981

Processus non-séquentiels et leurs observations en univers non-centralisé.
Proceedings of the International Symposium on Programming, 1980

Application de la strucuturation des systéme à la conception interne du système GEMAU.
Proceedings of the Programming Symposium, 1974

A Formal Model for System Oriented Architecture.
IFIP Congress, 1974