Philippe Darondeau

Luca Bernardinello

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.

[BibT_eX]

[DOI]

Hervé Marchand

S. Laurie Ricker

Discret. Event Dyn. Syst., 2015

2012

Distributed Control of Discrete-Event Systems: A First Step.

[BibT_eX]

[DOI]

S. Laurie Ricker

Trans. Petri Nets Other Model. Concurr., 2012

Petri Net Reachability Graphs: Decidability Status of First Order Properties

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Enforcing opacity of regular predicates on modal transition systems.

[BibT_eX]

[DOI]

Proceedings of the 11th International Workshop on Discrete Event Systems, 2012

Deciding Selective Declassification of Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Principles of Security and Trust - First International Conference, 2012

2011

Separability in Persistent Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Petri Net Reachability Graphs: Decidability Status of FO Properties.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Petri Net Distributability.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of Systems Informatics, 2011

Residuation of tropical series: Rationality issues.

[BibT_eX]

[DOI]

Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

Assembling Sessions.

[BibT_eX]

[DOI]

Loïc Hélouët

Madhavan Mukund

Proceedings of the Automated Technology for Verification and Analysis, 2011

Towards Distributed Control of Discrete-Event Systems.

[BibT_eX]

[DOI]

S. Laurie Ricker

Proceedings of the Workshop Applications of Region Theory 2011, 2011

2010

Supervisory Control for Opacity.

[BibT_eX]

[DOI]

Jérémy Dubreil

Hervé Marchand

IEEE Trans. Autom. Control., 2010

Quasi-static scheduling of communicating tasks.

[BibT_eX]

[DOI]

Inf. Comput., 2010

On the Decidability of Non Interference over Unbounded Petri Nets

[BibT_eX]

[DOI]

Roberto Gorrieri

Proceedings of the Proceedings 8th International Workshop on Security Issues in Concurrency, 2010

Supervisory control for modal specifications of services.

[BibT_eX]

[DOI]

Jérémy Dubreil

Hervé Marchand

Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

2009

Synthesis of Nets with Step Firing Policies.

[BibT_eX]

[DOI]

Maciej Koutny

Marta Pietkiewicz-Koutny

Alexandre Yakovlev

Fundam. Informaticae, 2009

A decomposition theorem for finite persistent transition systems.

[BibT_eX]

[DOI]

Acta Informatica, 2009

2008

Products of Message Sequence Charts.

[BibT_eX]

[DOI]

Blaise Genest

Loïc Hélouët

Proceedings of the Foundations of Software Science and Computational Structures, 2008

On the Synthesis of Zero-Safe Nets.

[BibT_eX]

[DOI]

Proceedings of the Concurrency, 2008

Decomposition Theorems for Bounded Persistent Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

2007

Making Petri Nets Safe and Free of Internal Transitions.

[BibT_eX]

[DOI]

Harro Wimmel

Fundam. Informaticae, 2007

Concurrent Secrets.

[BibT_eX]

[DOI]

Marek A. Bednarczyk

Andrzej M. Borzyszkowski

Benoît Caillaud

Discret. Event Dyn. Syst., 2007

Synthesis and Control of Asynchronous and Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 2007

2005

Transition systems without transitions.

[BibT_eX]

[DOI]

Andrzej M. Borzyszkowski

Theor. Comput. Sci., 2005

Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Foreword.

[BibT_eX]

[DOI]

René K. Boel

Sadatoshi Kumagai

Discret. Event Dyn. Syst., 2005

Distributed implementations of Ramadge-Wonham supervisory control with Petri nets.

[BibT_eX]

[DOI]

Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

2004

The synthesis of Petri nets from path-automatic specifications.

[BibT_eX]

[DOI]

Inf. Comput., 2004

2003

Linear control of live marked graphs.

[BibT_eX]

[DOI]

X. Xie

Autom., 2003

Unbounded Petri Net Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Lectures on Concurrency and Petri Nets, 2003

2002

Distributing Finite Automata Through Petri Net Synthesis.

[BibT_eX]

[DOI]

Benoît Caillaud

Formal Aspects Comput., 2002

2001

On the Petri net realization of context-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Generalized Automata and Their Net Representations.

[BibT_eX]

[DOI]

Marek A. Bednarczyk

Proceedings of the Unifying Petri Nets, Advances in Petri Nets, 2001

2000

HMSCs as Partial Specifications ... with PNs as Completions.

[BibT_eX]

[DOI]

Proceedings of the Modeling and Verification of Parallel Processes, 4th Summer School, 2000

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

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 2000, 2000

1999

Context-Free Event Domains are Recognizable.

[BibT_eX]

[DOI]

Jean-Claude Raoult

Inf. Comput., 1999

Modelling Dynamic Agent Systems with Cooperating Automata.

[BibT_eX]

Andrew Tokmakoff

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

1998

Deriving Unbounded Petri Nets from Formal Languages.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997

The Synthesis Problem for Elementary Net Systems is NP-Complete.

[BibT_eX]

[DOI]

Luca Bernardinello

Theor. Comput. Sci., 1997

Stratified Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996

Theory of Regions.

[BibT_eX]

[DOI]

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

1995

Trace Nets and Process Automata.

[BibT_eX]

[DOI]

Acta Informatica, 1995

Polynomial Algorithms for the Synthesis of Bounded Nets.

[BibT_eX]

[DOI]

Luca Bernardinello

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Dualities Between Nets and Automata Induced by Schizophrenic Objects.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1993

Refinement of Actions in Event Structures and Causal Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

1992

Proof Systems for Infinite Behaviours

[BibT_eX]

[DOI]

Serge Yoccoz

Inf. Comput., August, 1992

Fairness, Distances and Degrees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Trace Nets.

[BibT_eX]

[DOI]

Proceedings of the Sematics: Foundations and Applications, 1992

Structural Operational Specifications and the Trace Automata.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '92, 1992

1991

On Guarded Recursion.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

About semantic action refinement.

[BibT_eX]

Fundam. Informaticae, 1991

Recursive Graphs are not Stable under Maximal Reduction.

[BibT_eX]

Bull. EATCS, 1991

1990

Event Structures, Causal Trees, and Refinements.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Causal Trees: Interleaving + Causality.

[BibT_eX]

[DOI]

Proceedings of the Semantics of Systems of Concurrent Processes, 1990

Concurrency and Computability.

[BibT_eX]

[DOI]

Proceedings of the Semantics of Systems of Concurrent Processes, 1990

1989

Bisimulation and Effectiveness.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Causal Trees.

[BibT_eX]

[DOI]

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

1987

A Fullt Observational Model for Infinite Behaviours of Communicating Systems.

[BibT_eX]

[DOI]

B. Gamatie

Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1986

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1986

Separating and Testing.

[BibT_eX]

[DOI]

Proceedings of the STACS 86, 1986

1985

About Fair Asynchrony.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

1984

Towards a Formal Proof System for omega-Rational Expressions.

[BibT_eX]

[DOI]

Laurent Kott

Inf. Process. Lett., 1984

A formal proof system for infinitary rational expressions.

[BibT_eX]

[DOI]

Laurent Kott

Proceedings of the Automata on Infinite Words, 1984

A Fully Abstract Model of Fair Asynchrony.

[BibT_eX]

[DOI]

Proceedings of the Seminar on Concurrency, 1984

1983

On the Observational Semantics of Fair Parallelism.

[BibT_eX]

[DOI]

Laurent Kott

Proceedings of the Automata, 1983

1982

An enlarged definition and complete axiomatization of observational congruence of finite processes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Programming, 1982

1981

Types in a Mixed Language System.

[BibT_eX]

[DOI]

Paul Le Guernic

Michel Raynal

BIT, 1981

1980

Processus non-séquentiels et leurs observations en univers non-centralisé.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Programming, 1980

1974

Application de la strucuturation des systéme à la conception interne du système GEMAU.

[BibT_eX]

[DOI]

Serge Guiboud-Ribaud

Claude Otrage

Proceedings of the Programming Symposium, 1974

A Formal Model for System Oriented Architecture.

[BibT_eX]