Bibliography

Major publications by the team in recent years

• 1S. Akshay, B. Genest, L. Hélouët, S. Yang.
  
  Regular Set of Representatives for Time-Constrained MSC Graphs, in: Information Processing Letters, 2012, vol. 112, n^o 14-15, pp. 592-598.
  
  http://hal.inria.fr/hal-00879825
• 2E. Badouel, M. A. Bednarczyk, A. M. Borzyszkowski, B. Caillaud, P. Darondeau.
  
  Concurrent Secrets, in: Discrete Event Dynamic Systems, 2007, vol. 17, n^o 4, pp. 425-446.
• 3E. Badouel, L. Bernardinello, P. Darondeau.
  
  Petri Net Synthesis, Springer, 2015.
  
  http://dx.doi.org/10.1007/978-3-662-47967-4
• 4A. Benveniste, E. Fabre, S. Haar, C. Jard.
  
  Diagnosis of Asynchronous Discrete Event Systems: A Net Unfolding Approach, in: IEEE Transactions on Automatic Control, November 2003, vol. 48, n^o 5, pp. 714-727, RNRT project MAGDA. [ DOI : 10.1109/TAC.2003.811249 ]
  
  http://hal.inria.fr/inria-00638224
• 5N. Bertrand, B. Genest, H. Gimbert.
  
  Qualitative Determinacy and Decidability of Stochastic Games with Signals, in: Proceedings of LICS'09, Los Angeles, États-Unis, August 2009.
  
  http://hal.archives-ouvertes.fr/hal-00356566
• 6N. Bertrand, T. Jéron, A. Stainer, M. Krichen.
  
  Off-line Test Selection with Test Purposes for Non-Deterministic Timed Automata, in: Logical Methods in Computer Science, October 2012, vol. 8, n^o 4:8, pp. 1-33.
  
  http://hal.inria.fr/hal-00744074
• 7J. Dubreil, P. Darondeau, H. Marchand.
  
  Supervisory Control for Opacity, in: IEEE Transactions on Automatic Control, May 2010, vol. 55, n^o 5, pp. 1089-1100. [ DOI : 10.1109/TAC.2010.2042008 ]
• 8E. Fabre, A. Benveniste.
  
  Partial Order Techniques for Distributed Discrete Event Systems: why you can't avoid using them, in: Journal of Discrete Events Dynamical Systems, 2007, vol. 17, n^o 3, pp. 357-403.
• 9E. Fabre.
  
  Trellis Processes: a Compact Representation for Runs of Concurrent Systems, in: Journal of Discrete Event Dynamical Systems, 2007, vol. 17, n^o 3, pp. 267-306.
• 10E. Fabre, L. Jezequel.
  
  Distributed optimal planning: an approach by weighted automata calculus, in: CDC, 2009, pp. 211-216.
• 11B. Gaudin, H. Marchand.
  
  An Efficient Modular Method for the Control of Concurrent Discrete Event Systems: A Language-Based Approach, in: Discrete Event Dynamic System, 2007, vol. 17, n^o 2, pp. 179-209.
• 12T. Gazagnaire, B. Genest, L. Hélouët, P. Thiagarajan, S. Yang.
  
  Causal Message Sequence Charts, in: Theoretical Computer Science, 2009, 38 p, EA DST.
  
  http://hal.inria.fr/inria-00429538
• 13C. Jard, T. Jéron.
  
  TGV: theory, principles and algorithms, in: STTT, 2005, vol. 7, n^o 4, pp. 297-315.
• 14B. Jeannet, T. Jéron, V. Rusu, E. Zinovieva.
  
  Symbolic Test Selection Based on Approximate Analysis, in: TACAS, Edinburgh, Royaume-Uni, 2005.
  
  http://hal.inria.fr/inria-00564617

Publications of the year

Articles in International Peer-Reviewed Journals

• 15S. Akshay, L. Hélouët, C. Jard, P.-A. Reyniers.
  
  Robustness of Time Petri Nets under Guard Enlargement, in: Fundamenta Informaticae, 2016, vol. 143, n^o 3-4.
  
  https://hal.inria.fr/hal-01379431
• 16E. Badouel, C. Morvan, L. Hélouët.
  
  Petri Nets with Structured Data, in: Fundamenta Informaticae, 2016, vol. 146, n^o 1, 119 p.
  
  https://hal.inria.fr/hal-01379245
• 17N. Berthier, É. Rutten, N. De Palma, S. M.-K. Gueye.
  
  Designing Autonomic Management Systems by using Reactive Control Techniques, in: IEEE Transactions on Software Engineering, July 2016, vol. 42, n^o 7, 18 p.
  
  https://hal.inria.fr/hal-01242853
• 18R. Brenguier, J.-F. Raskin, O. Sankur.
  
  Assume-admissible synthesis, in: Acta Informatica, 2016. [ DOI : 10.1007/s00236-016-0273-2 ]
  
  https://hal.inria.fr/hal-01373538
• 19B. Bérard, L. Hélouët, J. Mullins.
  
  Non-interference in partial order models, in: ACM Transactions on Embedded Computing Systems (TECS), 2016.
  
  https://hal.inria.fr/hal-01379451
• 20Y. Falcone, T. Jéron, H. Marchand, S. Pinisetty.
  
  Runtime Enforcement of Regular Timed Properties by Suppressing and Delaying Events, in: Science of Computer Programming, March 2016. [ DOI : 10.1016/j.scico.2016.02.008 ]
  
  https://hal.inria.fr/hal-01281727
• 21S. Jacobs, R. Bloem, R. Brenguier, R. Ehlers, T. Hell, R. Könighofer, G. A. Pérez, J.-F. Raskin, L. Ryzhyk, O. Sankur, M. Seidl, L. Tentrup, A. Walker.
  
  The first reactive synthesis competition (SYNTCOMP 2014), in: International Journal on Software Tools for Technology Transfer, April 2016. [ DOI : 10.1007/s10009-016-0416-3 ]
  
  https://hal.inria.fr/hal-01373547

Invited Conferences

• 22R. Brenguier, L. Clemente, P. Hunter, G. A. Pérez, M. Randour, J.-F. Raskin, O. Sankur, M. Sassolas.
  
  Non-Zero Sum Games for Reactive Synthesis, in: LATA 2016 : 10th International Conference on Language and Automata Theory and Applications, Prague, Czech Republic, A.-H. Dediu, J. Janoušek, C. Martín-Vide, B. Truthe (editors), Lecture Notes in Computer Science, Springer, March 2016, vol. 9618, pp. 3-23. [ DOI : 10.1007/978-3-319-30000-9_1 ]
  
  https://hal.inria.fr/hal-01373546

International Conferences with Proceedings

• 23S. Akshay, B. Genest, L. Hélouët.
  
  Decidable Classes of Unbounded Petri Nets with Time and Urgency, in: Application and Theory of Petri Nets and Concurrency - 37th International Conference, PETRI NETS, 2016, Torun, Poland, F. Kordon, D. Moldt (editors), Application and Theory of Petri Nets and Concurrency - 37th International Conference, PETRI NETS, 2016, Springer, June 2016, n^o 9698, pp. 301 - 322. [ DOI : 10.1007/978-3-319-39086-4_18 ]
  
  https://hal.inria.fr/hal-01379414
• 24S. Akshay, B. Genest, B. Karelovic, N. Vyas.
  
  On Regularity of unary Probabilistic Automata, in: STACS 2016, Orléans, France, STACS 2016, 2016.
  
  https://hal.archives-ouvertes.fr/hal-01245037
• 25S. Akshay, L. Hélouët, R. Phawade.
  
  Combining Free Choice and Time in Petri Nets, in: 23rd International Symposium on Temporal Representation and Reasoning, Lyngby, Denmark, IEEE (editor), 23rd International Symposium on Temporal Representation and Reasoning, Technical University of Denmark , October 2016.
  
  https://hal.inria.fr/hal-01379440
• 26N. Bertrand, P. Bouyer, T. Brihaye, P. Carlier.
  
  Analysing Decisive Stochastic Processes, in: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Rome, Italy, LiPICS, 2016, vol. 55, 14 p. [ DOI : 10.4230/LIPIcs.ICALP.2016.101 ]
  
  https://hal.inria.fr/hal-01397794
• 27N. Bertrand, S. Haddad, E. Lefaucheux.
  
  Accurate approximate diagnosability of stochastic systems, in: 10th International Conference on Language and Automata Theory and Applications, Prague, Czech Republic, Springer, March 2016.
  
  https://hal.inria.fr/hal-01220954
• 28N. Bertrand, S. Haddad, E. Lefaucheux.
  
  Diagnosis in Infinite-State Probabilistic Systems , in: 27th International Conference on Concurrency Theory (Concur 2016), Québec city, Canada, 27th International Conference on Concurrency Theory (Concur 2016), August 2016. [ DOI : 10.4230/LIPIcs.CONCUR.2016.37 ]
  
  https://hal.inria.fr/hal-01373354
• 29R. Brenguier, G. A. Pérez, J.-F. Raskin, O. Sankur.
  
  Admissibility in Quantitative Graph Games, in: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India, December 2016.
  
  https://hal.inria.fr/hal-01373542
• 30L. Hélouët, K. Kecir.
  
  Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics, in: 37th International Conference, PETRI NETS 2016, Torun, Poland, F. Kordon, D. Moldt (editors), Application and Theory of Petri Nets and Concurrency, Fabrice Kordon and Daniel Moldt, June 2016, n^o 9698, pp. 155-175. [ DOI : 10.1007/978-3-319-39086-4_11 ]
  
  https://hal.inria.fr/hal-01379424
• 31R. F. J. Nsaibirni, E. Badouel, G. Texier, G.-E. Kouamou.
  
  Active-Workspaces: A Dynamic Collaborative Business Process Model for Disease Surveillance Systems, in: Worldcomp'16- The 2nd International Conference on Health Informatics and Medical Systems, Las Vegas, United States, July 2016.
  
  https://hal.inria.fr/hal-01323561
• 32S. K. Palaniappan, M. Pichené, G. Batt, E. Fabre, B. Genest.
  
  A Look-Ahead Simulation Algorithm for DBN Models of Biochemical Pathways, in: Hybrid Systems Biology, 5th International Workshop, HSB 2016, Grenoble, France, E. Cinquemani, A. Donzé (editors), Lecture Notes in Computer Science, October 2016, vol. 9957, pp. 3-15. [ DOI : 10.1007/978-3-319-47151-8_1 ]
  
  https://hal.inria.fr/hal-01406115
• 33S. Pinisetty, V. Preoteasa, S. Tripakis, T. Jéron, Y. Falcone, H. Marchand.
  
  Predictive Runtime Enforcement *, in: SAC 2016 31st ACM Symposium on Applied Computing, Pisa, Italy, ACM, April 2016, 6 p. [ DOI : 10.1145/2851613.2851827 ]
  
  https://hal.inria.fr/hal-01244369
• 34L. S. L. Ricker, H. Marchand.
  
  Finding the weakest link(s): Coalition games for decentralized discrete-event control, in: 55th IEEE Conference on Decision and Control, Las-Vegas, United States, December 2016.
  
  https://hal.inria.fr/hal-01373709

Conferences without Proceedings

• 35E. Fabre, L. Hélouët, E. Lefaucheux, H. Marchand.
  
  Diagnosability of Repairable Faults, in: 13th International Workshop on Discrete Event Systems, Xi'an, China, 2016, pp. 256-262, (Version Longue).
  
  https://hal.inria.fr/hal-01302562
• 36O. Sankur, J.-P. Talpin.
  
  An Abstraction Technique For Parameterized Model Checking of Leader Election Protocols: Application to FTSP, in: 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Uppsala, Sweden, April 2017.
  
  https://hal.archives-ouvertes.fr/hal-01431472

Books or Proceedings Editing

• 37M. LO, E. Badouel, N. Gmati (editors)
  
  Proceedings of CARI 2016, July 2016, 513 p.
  
  https://hal.inria.fr/hal-01350039

Internal Reports

• 38N. Bertrand, S. Haddad, E. Lefaucheux.
  
  Diagnosis in Infinite-State Probabilistic Systems (long version), Inria Rennes ; LSV, ENS Cachan, June 2016.
  
  https://hal.inria.fr/hal-01334218
• 39P. Bouyer, P. Hofman, N. Markey, M. Randour, M. Zimmermann.
  
  Bounding Average-energy Games, ArXiv, October 2016, n^o 1610.07858.
  
  https://hal.archives-ouvertes.fr/hal-01410144
• 40P. Bouyer, V. Jugé, N. Markey.
  
  Dynamic Complexity of Parity Games with Bounded Tree-Width, ArXiv, October 2016.
  
  https://hal.archives-ouvertes.fr/hal-01410169

Other Publications

• 41B. Bérard, L. Hélouët, J. Mullins.
  
  Non-interference in partial order models, February 2016, working paper or preprint.
  
  https://hal.inria.fr/hal-01280043
• 42L. Hélouët, K. Kecir.
  
  Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics (regular paper), March 2016, working paper or preprint.
  
  https://hal.inria.fr/hal-01284682

References in notes

• 43P. A. Abdulla, A. Nylén.
  
  Timed Petri Nets and BQOs, in: ICATPN, LNCS, 2001, vol. 2075, pp. 53-70.
• 44E. Badouel, L. Hélouët, C. Morvan, R. F. J. Nsaibirni.
  
  Active Workspace: Distributed Collaborative Systems based on Guarded Attribute Grammars, in: ACM SIGAPP Applied Computing Review, 2015, vol. 6, n^o 33, pp. 6–33.
• 45B. Bérard, L. Hélouët, J. Mullins.
  
  Non-interference in Partial Order Models, in: Proc. of 15th Int. Conf. on Application of Concurrency to System Design, ACSD 2015, IEEE Computer Society, 2015, pp. 80–89.
• 46N. D. Jones, L. H. Landweber, Y. E. Lien.
  
  Complexity of Some Problems in Petri Nets, in: Theor. Comput. Sci., 1977, vol. 4, n^o 3, pp. 277–299.
• 47P. M. Merlin.
  
  A Study of the Recoverability of Computing Systems, University of California, Irvine, CA, USA, 1974.
• 48A. Puri.
  
  Dynamical Properties of Timed Automata, in: In DEDS, 2000, vol. 10, n^o 1-2, pp. 87–113.
• 49V. V. Ruiz, F. C. Gomez, D. de Frutos-Escrig.
  
  On Non-Decidability of Reachability for Timed-Arc Petri Nets, in: PNPM, IEEE Computer Society, 1999, pp. 188–.
• 50B. Walter.
  
  Timed Petri-Nets for Modelling and Analysing Protocols with Real-Time Characteristics, in: Proc. of PSTV, 1983, pp. 149-159.