default search action
Philippe Darondeau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [b1]Éric Badouel, Luca Bernardinello, Philippe Darondeau:
Petri Net Synthesis. Texts in Theoretical Computer Science. An EATCS Series, Springer 2015, ISBN 978-3-662-47966-7, pp. 1-325 - [j31]Philippe Darondeau, Hervé Marchand, S. Laurie Ricker:
Enforcing opacity of regular predicates on modal transition systems. Discret. Event Dyn. Syst. 25(1-2): 251-270 (2015) - 2012
- [j30]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) - [j29]Philippe Darondeau, S. Laurie Ricker:
Distributed Control of Discrete-Event Systems: A First Step. Trans. Petri Nets Other Model. Concurr. 6: 24-45 (2012) - [c44]Eike Best, Philippe Darondeau:
Deciding Selective Declassification of Petri Nets. POST 2012: 290-308 - [c43]Philippe Darondeau:
Enforcing opacity of regular predicates on modal transition systems. WODES 2012: 331-336 - 2011
- [j28]Eike Best, Philippe Darondeau:
Separability in Persistent Petri Nets. Fundam. Informaticae 113(3-4): 179-203 (2011) - [c42]Philippe Darondeau, S. Laurie Ricker:
Towards Distributed Control of Discrete-Event Systems. ART @ Petri Nets 2011: 63-78 - [c41]Philippe Darondeau, Loïc Hélouët, Madhavan Mukund:
Assembling Sessions. ATVA 2011: 259-274 - [c40]Éric Badouel, Anne Bouillard, Philippe Darondeau, Jan Komenda:
Residuation of tropical series: Rationality issues. CDC/ECC 2011: 3855-3861 - [c39]Eike Best, Philippe Darondeau:
Petri Net Distributability. Ershov Memorial Conference 2011: 1-18 - [c38]Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan:
Petri Net Reachability Graphs: Decidability Status of FO Properties. FSTTCS 2011: 140-151 - 2010
- [j27]Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang:
Quasi-static scheduling of communicating tasks. Inf. Comput. 208(10): 1154-1168 (2010) - [j26]Jérémy Dubreil, Philippe Darondeau, Hervé Marchand:
Supervisory Control for Opacity. IEEE Trans. Autom. Control. 55(5): 1089-1100 (2010) - [c37]Eike Best, Philippe Darondeau:
Separability in Persistent Petri Nets. Petri Nets 2010: 246-266 - [c36]Philippe Darondeau, Jérémy Dubreil, Hervé Marchand:
Supervisory control for modal specifications of services. WODES 2010: 418-425 - [c35]Eike Best, Philippe Darondeau, Roberto Gorrieri:
On the Decidability of Non Interference over Unbounded Petri Nets. SecCo 2010: 16-33
2000 – 2009
- 2009
- [j25]Eike Best, Philippe Darondeau:
A decomposition theorem for finite persistent transition systems. Acta Informatica 46(3): 237-254 (2009) - [j24]Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alexandre Yakovlev
:
Synthesis of Nets with Step Firing Policies. Fundam. Informaticae 94(3-4): 275-303 (2009) - 2008
- [c34]Eike Best, Philippe Darondeau:
Decomposition Theorems for Bounded Persistent Petri Nets. Petri Nets 2008: 33-51 - [c33]Philippe Darondeau, Maciej Koutny, Marta Pietkiewicz-Koutny, Alexandre Yakovlev
Synthesis of Nets with Step Firing Policies. Petri Nets 2008: 112-131 - [c32]Philippe Darondeau:
On the Synthesis of Zero-Safe Nets. Concurrency, Graphs and Models 2008: 409-426 - [c31]Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang:
Quasi-Static Scheduling of Communicating Tasks. CONCUR 2008: 310-324 - [c30]Philippe Darondeau, Blaise Genest, Loïc Hélouët:
Products of Message Sequence Charts. FoSSaCS 2008: 458-473 - 2007
- [j23]Éric Badouel, Marek A. Bednarczyk, Andrzej M. Borzyszkowski
Concurrent Secrets. Discret. Event Dyn. Syst. 17(4): 425-446 (2007) - [j22]Eike Best, Philippe Darondeau, Harro Wimmel:
Making Petri Nets Safe and Free of Internal Transitions. Fundam. Informaticae 80(1-3): 75-90 (2007) - [c29]Philippe Darondeau:
Synthesis and Control of Asynchronous and Distributed Systems. ACSD 2007: 13-22 - 2005
- [j21]René K. Boel, Philippe Darondeau, Sadatoshi Kumagai:
Foreword. Discret. Event Dyn. Syst. 15(1): 5-6 (2005) - [j20]Philippe Darondeau:
Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets. Inf. Process. Lett. 94(6): 241-245 (2005) - [j19]Andrzej M. Borzyszkowski
Transition systems without transitions. Theor. Comput. Sci. 338(1-3): 1-16 (2005) - [c28]Philippe Darondeau:
Distributed implementations of Ramadge-Wonham supervisory control with Petri nets. CDC/ECC 2005: 2107-2112 - [e1]Gianfranco Ciardo, Philippe Darondeau:
Applications and Theory of Petri Nets 2005, 26th International Conference, ICATPN 2005, Miami, USA, June 20-25, 2005, Proceedings. Lecture Notes in Computer Science 3536, Springer 2005, ISBN 3-540-26301-2 [contents] - 2004
- [j18]Éric Badouel, Philippe Darondeau:
The synthesis of Petri nets from path-automatic specifications. Inf. Comput. 193(2): 117-135 (2004) - 2003
- [j17]Philippe Darondeau, X. Xie:
Linear control of live marked graphs. Autom. 39(3): 429-440 (2003) - [c27]Philippe Darondeau:
Unbounded Petri Net Synthesis. Lectures on Concurrency and Petri Nets 2003: 413-438 - 2002
- [j16]Éric Badouel, Benoît Caillaud, Philippe Darondeau:
Distributing Finite Automata Through Petri Net Synthesis. Formal Aspects Comput. 13(6): 447-470 (2002) - 2001
- [j15]Philippe Darondeau:
On the Petri net realization of context-free graphs. Theor. Comput. Sci. 258(1-2): 573-598 (2001) - [c26]Éric Badouel, Marek A. Bednarczyk, Philippe Darondeau:
Generalized Automata and Their Net Representations. Unifying Petri Nets 2001: 304-345 - 2000
- [c25]Philippe Darondeau:
Region Based Synthesis of P/T-Nets and Its Potential Applications. ICATPN 2000: 16-23 - [c24]Benoît Caillaud, Philippe Darondeau, Loïc Hélouët, Gilles Lesventes:
HMSCs as Partial Specifications ... with PNs as Completions. MOVEP 2000: 125-152
1990 – 1999
- 1999
- [j14]Éric Badouel, Philippe Darondeau, Jean-Claude Raoult:
Context-Free Event Domains are Recognizable. Inf. Comput. 149(2): 134-172 (1999) - [c23]Éric Badouel, Philippe Darondeau, Andrew Tokmakoff:
Modelling Dynamic Agent Systems with Cooperating Automata. PDPTA 1999: 11-17 - 1998
- [c22]Philippe Darondeau:
Deriving Unbounded Petri Nets from Formal Languages. CONCUR 1998: 533-548 - 1997
- [j13]Éric Badouel, Luca Bernardinello, Philippe Darondeau:
The Synthesis Problem for Elementary Net Systems is NP-Complete. Theor. Comput. Sci. 186(1-2): 107-134 (1997) - [c21]Éric Badouel, Philippe Darondeau:
Stratified Petri Nets. FCT 1997: 117-128 - 1996
- [c20]Éric Badouel, Philippe Darondeau:
Theory of Regions. Petri Nets 1996: 529-586 - 1995
- [j12]Éric Badouel, Philippe Darondeau:
Trace Nets and Process Automata. Acta Informatica 32(7): 647-679 (1995) - [c19]Éric Badouel, Philippe Darondeau, Jean-Claude Raoult:
Context-Free Event Domains are Recognizable. AMAST 1995: 214-229 - [c18]Éric Badouel, Philippe Darondeau:
Dualities Between Nets and Automata Induced by Schizophrenic Objects. Category Theory and Computer Science 1995: 24-43 - [c17]Éric Badouel, Luca Bernardinello, Philippe Darondeau:
Polynomial Algorithms for the Synthesis of Bounded Nets. TAPSOFT 1995: 364-378 - 1993
- [j11]Philippe Darondeau, Pierpaolo Degano:
Refinement of Actions in Event Structures and Causal Trees. Theor. Comput. Sci. 118(1): 21-48 (1993) - 1992
- [j10]Philippe Darondeau, Serge Yoccoz:
Proof Systems for Infinite Behaviours. Inf. Comput. 99(2): 178-191 (1992) - [j9]Philippe Darondeau, Doris Nolte, Lutz Priese, Serge Yoccoz:
Fairness, Distances and Degrees. Theor. Comput. Sci. 97(1): 131-142 (1992) - [c16]Éric Badouel, Philippe Darondeau:
Structural Operational Specifications and the Trace Automata. CONCUR 1992: 302-316 - [c15]Éric Badouel, Philippe Darondeau:
Trace Nets. REX Workshop 1992: 21-50 - 1991
- [j8]Philippe Darondeau:
Recursive Graphs are not Stable under Maximal Reduction. Bull. EATCS 44: 186-189 (1991) - [j7]Philippe Darondeau, Pierpaolo Degano:
About semantic action refinement. Fundam. Informaticae 14(2): 221-234 (1991) - [j6]Éric Badouel, Philippe Darondeau:
On Guarded Recursion. Theor. Comput. Sci. 82(2): 403-408 (1991) - 1990
- [c14]Philippe Darondeau:
Concurrency and Computability. Semantics of Systems of Concurrent Processes 1990: 223-238 - [c13]Philippe Darondeau, Pierpaolo Degano:
Causal Trees: Interleaving + Causality. Semantics of Systems of Concurrent Processes 1990: 239-255 - [c12]Philippe Darondeau, Pierpaolo Degano:
Event Structures, Causal Trees, and Refinements. MFCS 1990: 239-245
1980 – 1989
- 1989
- [j5]Philippe Darondeau:
Bisimulation and Effectiveness. Inf. Process. Lett. 30(1): 19-20 (1989) - [c11]Philippe Darondeau, Pierpaolo Degano:
Causal Trees. ICALP 1989: 234-248 - 1987
- [c10]Philippe Darondeau, B. Gamatie:
A Fullt Observational Model for Infinite Behaviours of Communicating Systems. TAPSOFT, Vol.1 1987: 153-168 - 1986
- [j4]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): 291-317 (1986) - [c9]Philippe Darondeau:
Separating and Testing. STACS 1986: 203-212 - 1985
- [j3]Philippe Darondeau:
About Fair Asynchrony. Theor. Comput. Sci. 37: 305-336 (1985) - 1984
- [j2]Philippe Darondeau, Laurent Kott:
Towards a Formal Proof System for omega-Rational Expressions. Inf. Process. Lett. 19(4): 173-177 (1984) - [c8]Philippe Darondeau:
A Fully Abstract Model of Fair Asynchrony. Seminar on Concurrency 1984: 458-466 - [c7]Philippe Darondeau, Laurent Kott:
A formal proof system for infinitary rational expressions. Automata on Infinite Words 1984: 68-80 - [c6]Philippe Darondeau:
About Fair Asynchrony. Logics and Models of Concurrent Systems 1984: 343-368 - 1983
- [c5]Philippe Darondeau, Laurent Kott:
On the Observational Semantics of Fair Parallelism. ICALP 1983: 147-159 - 1982
- [c4]Philippe Darondeau:
An enlarged definition and complete axiomatization of observational congruence of finite processes. Symposium on Programming 1982: 47-62 - 1981
- [j1]Philippe Darondeau, Paul Le Guernic, Michel Raynal:
Types in a Mixed Language System. BIT 21(3): 245-254 (1981) - 1980
- [c3]Philippe Darondeau:
Processus non-séquentiels et leurs observations en univers non-centralisé. Symposium on Programming 1980: 92-107
1970 – 1979
- 1974
- [c2]Philippe Darondeau, Serge Guiboud-Ribaud, Claude Otrage:
A Formal Model for System Oriented Architecture. IFIP Congress 1974: 71-75 - [c1]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: 280-297
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: