Four past PhD students (2010 - 2020) at Sorbonne University

One past Postdoc (2020) at Sorbonne University

2000-2023 Publications

• 2023
  • M. Dien, F. Peschanski : “Counting Linear Extensions of Modular Partial Orders”, 2023 25^th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Nancy, France, pp. 60-67, (IEEE) (2023)
• 2022
  • M. Dien, A. Genitrini, F. Peschanski : “A Combinatorial Study of Async/Await Processes”, The 19^th International Colloquium on Theoretical Aspects of Computing, vol. 13572, Lecture Notes in Computer Science, Tbilisi, Georgia, pp. 170-187, (Springer) (2022)
  • C. Bertrand, H. Klaudel, F. Peschanski : “Layered Memory Automata: Recognizers for Quasi-Regular Languages with Unbounded Memory”, 43^rd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2022), vol. 13288, Lecture Notes in Computer Science, Bergen, Norway, pp. 43-63, (Springer International Publishing) (2022)
  • A. Genitrini, M. Pépin, F. Peschanski : “A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space”, Theoretical Computer Science, vol. 912, pp. 1-36, (Elsevier) (2022)
• 2021
  • O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency”, Discrete Mathematics and Theoretical Computer Science, vol. vol. 22 no. 3, Computational Logic and Applications (CLA'19) (3), Computational Logic and Applications (CLA'19), (DMTCS) (2021)
• 2020
  • A. Genitrini, M. Pépin, F. Peschanski : “Statistical Analysis of Non-Deterministic Fork-Join Processes”, Theoretical Aspects of Computing - ICTAC 2020 - 17^th International Colloquium, vol. 12545, Lecture Notes in Computer Science, Macau, China, pp. 83-102, (Springer) (2020)
• 2019
  • B. Sall, F. Peschanski, E. Chailloux : “A Mechanized Theory of Program Refinement”, ICFEM 2019 - 21^st International Conference on Formal Engineering Methods, vol. 11852, Lecture Notes in Computer Science, Shenzhen, China, pp. 305-321, (Springer) (2019)
  • O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “The Combinatorics of Barrier Synchronization”, PETRI NETS 2019 - 40^th International Conference on Application and Theory of Petri Nets and Concurrency, vol. 11522, Lecture Notes in Computer Science, Aachen, Germany, pp. 386-405 (2019)
  • F. Peschanski : “Verifying Mobile Systems: Take Two: Stateful Observations of Pi-calculus Processes”, Communicating Process Architectures 2018 - WoTUG 40, vol. 70, Concurrent Systems Engineering Series, Dresden, Germany, (IOS Press), (ISBN: 978-1-61499-948-5) (2019)
• 2018
  • C. Bertrand, F. Peschanski, H. Klaudel, M. Latapy : “Pattern Matching in Link Streams: Timed-Automata with Finite Memory”, Scientific Annals of Computer Science, vol. 28 (36), pp. 161-198, (Alexandru Ioan Cuza University Publishing House) (2018)
  • C. Bertrand, H. Klaudel, M. Latapy, F. Peschanski : “Pattern Matching in Link Streams: a Token-based Approach”, International Conference on Applications and Theory of Petri Nets and Concurrency, vol. 10877, Lecture Notes in Computer Science, Bratislava, Slovakia, pp. 227-247 (2018)
• 2017
  • B. Sall, F. Peschanski, E. Chailloux : “Analyse de Bytecode par Raffinement”, Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'2017), Montpellier, France (2017)
  • F. Peschanski : “A Lisp Way to Type Theory and Formal Proofs”, 10^th European Lisp Symposium (ELS 2017), Bruxelles, Belgium, (ACM) (2017)
  • O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes”, 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Barcelone, Spain, pp. 16-30 (2017)
  • O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets”, Computer Science Symposium in Russia, Kazan, Russian Federation (2017)
• 2016
  • O. Bodini, A. Genitrini, F. Peschanski : “A Quantitative Study of Pure Parallel Processes”, The Electronic Journal of Combinatorics, vol. 23 (1), pp. p1.11, (Open Journal Systems) (2016)
• 2015
  • O. Bodini, A. Genitrini, F. Peschanski, N. Rolin : “Associativity for Binary Parallel Processes: a Quantitative Study”, Algorithms and Discrete Applied Mathematics, vol. 8959, Lecture Notes in Computer Science, Kanpur, India, pp. 217-228, (Springer) (2015)
• 2014
  • A. Deharbe, F. Peschanski : “The Omniscient Garbage Collector : a Resource Analysis Framework”, ACSD 2014 - 14^th International Conference on Application of Concurrency to System Design, La Marsa, Tunisia, pp. 102-111, (IEEE) (2014)
  • A. Deharbe, F. Peschanski : “The Omniscient Garbage Collector: a Resource Analysis Framework”, (2014)
• 2013
  • O. Bodini, A. Genitrini, F. Peschanski : “The Combinatorics of Non-determinism”, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 24, Leibniz International Proceedings in Informatics, Guwahati, India, pp. 425-436 (2013)
  • F. Peschanski, H. Klaudel, R. Devillers : “A petri net interpretation of open reconfigurable systems”, Fundamenta Informaticae, vol. 122 (1-2), pp. 85-117, (Polskie Towarzystwo Matematyczne) (2013)
• 2012
  • O. Bodini, A. Genitrini, F. Peschanski : “Enumeration and Random Generation of Concurrent Computations”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AQ, 23^rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), DMTCS Proceedings, Montreal, Canada, pp. 83-96, (Discrete Mathematics and Theoretical Computer Science) (2012)
• 2011
  • F. Peschanski, H. Klaudel, R. Devillers : “A Petri Net Interpretation of Open Reconfigurable Systems”, Applications and Theory of Petri Nets. 32^nd International Conference, PETRI NETS 2011, Newcastle, UK, June 20-24, 2011. Proceedings, vol. 6709, Lecture Notes in Computer Science, Newcastle, United Kingdom, pp. 208-227 (2011)
  • F. Peschanski : “Parallel Computing with the Pi-calculus”, DAMP'11. Proceedings of the 6^th ACM Workshop on Declarative Aspects of Multicore Programming, Austin, Texas, United States, pp. 45-54, (ACM) (2011)
• 2010
  • F. Peschanski, H. Klaudel, R. Devillers : “A Decidable Characterization of a Graphical Pi-calculus with Iterators”, Proc. of the 12^th International Workshop on Verification of Infinite-State Systems (INFINITY 2010), vol. 39, EPTCS, Singapore, Singapore, pp. 47-61 (2010)
  • F. Peschanski : “Principes et pratiques de la programmation en pi-calcul”, Journées Francophone des langages applicatifs (JFLA 2010), Studia Informatica Universalis, Vieux-Port La Ciotat, France, pp. 245-274, (Hermann) (2010)
• 2009
  • C. Méhat, O. Marin, F. Peschanski : “Intégration des fautes dans un modèle de programmation pour réseaux mobiles”, MajecSTIC'2009, Avignon, France (2009)
  • J.‑A. Bialkiewicz, F. Peschanski : “A Denotational Study of Mobility”, Communicating Process Architectures, vol. 67, Concurrent Systems Engineering Series, Eindhoven, Netherlands, pp. 239-261, (IOS Press) (2009)
  • J.‑A. Bialkiewicz, F. Peschanski : “Logic for Mobility: A Denotational Approach”, Second International Workshop on Logics for Agents and Mobility, Los Angeles, California, United States, pp. 44-59, (Durham University) (2009)
  • N. Stefanovitch, A. El Fallah‑Seghrouchni, F. Peschanski : “Towards Efficient Coordination in Open MAS using Graphical Utility Models”, International Workshop on Optimisation in Multi-Agent Systems, Budapest, Hungary (2009)
  • F. Peschanski, J.‑A. Bialkiewicz : “Modelling and Verifying Mobile Systems Using Pi-Graphs”, 35^th International Conference on Current Trends in Theory and Practice of Computer Science (Sofsem 2009), vol. 5404, Lecture Notes in Computer Science, Špindlerův Mlýn, Czechia, pp. 437-442, (Springer) (2009)
• 2008
  • H. Belhaouari, F. Peschanski : “A Constraint Logic Programming Approach to Automated Testing”, 24^th International Conference on Logic Programming, vol. 5366, Lecture Notes in Computer Science, Udine, Italy, pp. 754-758, (Springer-Verlag) (2008)
  • H. Belhaouari, F. Peschanski : “Automated generation of test cases from contract-oriented specifications: A CSP-based approach”, IEEE International Symposium on High Assurance Systems Engineering, Nanjing, China, pp. 219-228, (IEEE) (2008)
  • H. Belhaouari, F. Peschanski : “A Lightweight Container Architecture for Runtime Verification”, Workshop on Runtime Verification, vol. 5289, Lecture Notes in Computer Science, Budapest, Hungary, pp. 173-187, (Springer-Verlag) (2008)
• 2007
  • J.‑P. Briot, Th. Meurisse, F. Peschanski : “An experience in using components for a modular construction of agents for agent-based simulations”, XXI Simpósio Brasileiro de Engenharia de Software (SBES'2007), João Pessoa, PB, Brazil, pp. 93-109, (Sociedade Brasileira de Computação (SBC)) (2007)
  • H. Belhaouari, F. Peschanski : “An Integrated Platform for Contract-oriented Development”, Formal Languages and Analysis of Contract-Oriented Software, FLACOS 2007, Oslo, Norway, pp. 12-15 (2007)
  • F. Peschanski, A. Darrasse, N. Guts, J. Bobbio : “Coordinating mobile agents in interaction spaces”, Science of Computer Programming, vol. 66 (3), pp. 246-265, (Elsevier) (2007)
  • J.‑P. Briot, Th. Meurisse, F. Peschanski : “Architectural Design of Component-based Agents: A Behavior-based Approach”, chapter in Programming Multi-Agent Systems - ProMAS 2006, vol. 4411, Lecture Notes in Computer Science, pp. 73-92, (Springer-Verlag), (ISBN: 978-3-540-71955-7) (2007)
• 2006
  • A. Lenica, F. Ogel, F. Peschanski, J.‑P. Briot : “Toward agent-based cooperative resource management in a telecom operator grid platform”, Workshop on Emerging Technologies for Next-Generation GRID (ETNGRID'06), Manchester, United Kingdom, pp. 214-219, (IEEE) (2006)
  • A. Lenica, F. Ogel, F. Peschanski, J.‑P. Briot : “Agent-based grid resource management”, The 2006 International Conference on Computational Science (ICCS'2006) International Workshop on Grid Computing Security and Resource Management (GSRM'06), Reading, United Kingdom (2006)
  • J.‑P. Briot, Th. Meurisse, F. Peschanski : “Architectural Design of Component-based Agents: A Behavior-based Approach”, 4^th International Workshop on Programming Multi-Agent Systems (ProMAS'06), Hakodate, Japan, pp. 35-49 (2006)
  • F. Peschanski : “Mobile Agents in Interaction Spaces”, Electronic Notes in Theoretical Computer Science, vol. 154 (1), pp. 63-82, (Elsevier) (2006)
  • F. Peschanski, S. Hym : “A Stackless Runtime Environment for a Pi-calculus”, VEE 2006 - Second International Conference on Virtual Execution Environments, Ottawa, Canada, pp. 57-67, (ACM Press) (2006)
  • J.‑P. Briot, Th. Meurisse, F. Peschanski : “Une expérience de conception et de composition de comportements d’agents à l’aide de composants”, Revue des Sciences et Technologies de l'Information - Série L'Objet : logiciel, bases de données, réseaux, vol. 12 (4), pp. 11-41, (Hermès-Lavoisier) (2006)
  • F. Peschanski, D. Poitrenaud : “Vérification de systèmes infinis”, chapitre de Méthodes formelles pour les systèmes répartis et coopératifs, IC2 Series, pp. 213-250, (Hermès Lavoisier), (ISBN: 2-7462-1447-4) (2006)
• 2005
  • F. Peschanski, J.‑P. Briot : “Architectures de composants répartis”, chapter in Ingénierie des composants : Concepts, techniques et outils, Génie logiciel, pp. 247-279, (Vuibert), (ISBN: 2-7117-4836-7) (2005)
• 2004
  • F. Peschanski : “On Linear Time and Congruence in Channel-passing Calculi”, Communicating Process Architectures 2004, Oxford, United Kingdom, pp. 39-53, (IOS Press) (2004)
  • T. Masuyama, F. Peschanski, Y. Oyama, A. Yonezawa : “MobileScope: a Programming Language with Objective Mobility”, Mobile Distributed Computing MDC 2004, Tokyo, Japan, pp. 542-547, (IEEE) (2004)
  • F. Peschanski, R. Affeldt, J.‑P. Briot : “Les espaces d’interactions : vers une géométrie des systèmes d’agents mobiles”, Journées Francophones Langages et modèles à objet (LMO'04), vol. 10 (2-3), Revue L'Objet, Lille, France, pp. 31-45, (Lavoisier) (2004)
  • F. Peschanski, J.‑P. Briot : “Adaptations dynamiques et orthogonales de composants logiciels distribués”, Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, vol. 23 (2), pp. 151-174, (Lavoisier) (2004)
• 2003
  • F. Peschanski, J.‑P. Briot, A. Yonezawa : “Fine-Grained Dynamic Adaptation of Distributed Components”, Middleware 2003 - ACM/IFIP/USENIX International Middleware Conference, vol. 2672, Lecture Notes in Computer Science, Rio de Janeiro, Brazil, pp. 123-142, (Springer) (2003)
  • F. Peschanski, D. Julien : “When Concurrent Control Meets Functional Requirements, or Z + Petri Nets”, Third International Conference of B and Z Users 2003, vol. 2651, Lecture Notes in Computer Science, Turku, Finland, pp. 79-97, (Springer-Verlag) (2003)
• 2002
  • F. Peschanski : “Composition et adaptation dynamiques de systèmes distribués”, thesis, phd defence 06/17/2002, supervision Briot, Jean-Pierre, co-supervision : Queinnec, Christian (2002)
  • F. Peschanski : “A Vesatile Event-based Communication Model for Generic Distributed Interactions”, Distributed Event-based Systems DEBS 2002, Vienna, Austria, pp. 503-511, (IEEE) (2002)
• 2001
  • F. Peschanski : “A Reflective Middleware Architecture for Adaptive Component-based Distributed Systems”, Distributed Systems Online Journal, vol. 1 (7), pp. 12-16 (2001)
• 2000
  • F. Peschanski, Th. Meurisse, J.‑P. Briot : “Les Composants Logiciels : Evolution Technologique ou Nouveau Paradigme ?”, Conférence Objets, Composants, Modèles (OCM'2000), Nantes, France, pp. 53-65 (2000)
  • F. Peschanski : “COMET : Architecture Réflexive à base de Composants pour la Construction d’Applications Concurrentes et Réparties”, Langages et modèles à objet 2000, Mont Saint-Hilaire, Québec, Canada, pp. 11-26, (Hermès) (2000)