An Ontology-Based Approach for Requirements and Change Impact Analysis in SysML Designs.

Pierre-Cyrille Héam https://scholar.google.com/citations?user=L_G_nxUAAAAJ https://orcid.org/0000-0002-1125-1767 https://www.wikidata.org/entity/Q102355513 https://mathgenealogy.org/id.php?id=138977 Université de Franche-Comté, Besançon, France

Messaoud Rahim Ahmed Hammad Pierre-Cyrille Héam Malika Boukala-Ioualalen An Ontology-Based Approach for Requirements and Change Impact Analysis in SysML Designs. 2026 April 306 7 SN Comput. Sci. 4 https://doi.org/10.1007/s42979-026-04881-1 db/journals/sncs/sncs7.html#RahimHHB26 streams/journals/sncs

Louis-Claude Canon Anthony Dugois Mohamad El Sayah Pierre-Cyrille Héam MCMC generation of cost matrices for scheduling performance evaluation. 107758 2025 168 Future Gener. Comput. Syst. https://doi.org/10.1016/j.future.2025.107758 db/journals/fgcs/fgcs168.html#CanonDSH25 streams/journals/fgcs

Louis-Claude Canon Anthony Dugois Pierre-Cyrille Héam Ismaël Jecker Approximation Bounds for SLACK on Identical Parallel Machines. 131-144 2025 Euro-Par (1) https://doi.org/10.1007/978-3-031-99854-6_9 conf/europar/2025-1 db/conf/europar/europar2025-1.html#CanonDHJ25 streams/conf/europar

Anne Benoit Louis-Claude Canon Redouane Elghazi Pierre-Cyrille Héam List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds. 100-117 2023 April 174 J. Parallel Distributed Comput. https://doi.org/10.1016/j.jpdc.2022.12.003 db/journals/jpdc/jpdc174.html#BenoitCEH23

Anne Benoit Louis-Claude Canon Redouane Elghazi Pierre-Cyrille Héam Asymptotic Performance and Energy Consumption of SLACK. 81-95 2023 Euro-Par https://doi.org/10.1007/978-3-031-39698-4_6 conf/europar/2023 db/conf/europar/europar2023.html#BenoitCEH23 Edy Hourany Bachir Habib Abdallah Makhoul Benoît Piranda Julien Bourgeois Pierre-Cyrille Héam ELECTOR: Deterministic leader election algorithm for modular robots. 1551-1559 2022 SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta https://doi.org/10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00174 conf/uic/2022 db/conf/uic/uic2022.html#HouranyHMPBH22 Anne Benoit Louis-Claude Canon Redouane Elghazi Pierre-Cyrille Héam Update on the Asymptotic Optimality of LPT. 55-69 2021 Euro-Par https://doi.org/10.1007/978-3-030-85665-6_4 conf/europar/2021 db/conf/europar/europar2021.html#BenoitCEH21 Anne Benoit Louis-Claude Canon Redouane Elghazi Pierre-Cyrille Héam Shelf schedules for independent moldable tasks to minimize the energy consumption. 126-136 2021 SBAC-PAD https://doi.org/10.1109/SBAC-PAD53543.2021.00024 conf/sbac-pad/2021 db/conf/sbac-pad/sbac-pad2021.html#BenoitCEH21 Louis-Claude Canon Mohamad El Sayah Pierre-Cyrille Héam A Comparison of Random Task Graph Generation Methods for Scheduling Problems. 61-73 2019 Euro-Par https://doi.org/10.1007/978-3-030-29400-7_5 conf/europar/2019 db/conf/europar/europar2019.html#CanonSH19 Sylvain Contassot-Vivier Jean-François Couchot Mohammed Bakiri Pierre-Cyrille Héam Fast and robust PRNGs based on jumps in N-cubes for simulation, but not exclusively for that. 650-657 2019 HPCS https://doi.org/10.1109/HPCS48598.2019.9188175 conf/ieeehpcs/2019 db/conf/ieeehpcs/ieeehpcs2019.html#Contassot-Vivier19

Louis-Claude Canon Mohamad El Sayah Pierre-Cyrille Héam A Comparison of Random Task Graph Generation Methods for Scheduling Problems. 2019 abs/1902.05808 CoRR http://arxiv.org/abs/1902.05808 db/journals/corr/corr1902.html#abs-1902-05808

Louis-Claude Canon Mohamad El Sayah Pierre-Cyrille Héam A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation. 460-467 2018 HPCS https://doi.org/10.1109/HPCS.2018.00079 conf/ieeehpcs/2018 db/conf/ieeehpcs/ieeehpcs2018.html#CanonSH18 Julien Bernard 0001 Pierre-Cyrille Héam Olga Kouchnarenko An Approximation-Based Approach for the Random Exploration of Large Models. 27-43 2018 TAP@STAF https://doi.org/10.1007/978-3-319-92994-1_2 conf/tap/2018 db/conf/tap/tap2018.html#BernardHK18

Louis-Claude Canon Mohamad El Sayah Pierre-Cyrille Héam A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation. 2018 abs/1803.08121 CoRR http://arxiv.org/abs/1803.08121 db/journals/corr/corr1803.html#abs-1803-08121

Julien Bernard 0001 Pierre-Cyrille Héam Olga Kouchnarenko An Approximation-based Approach for the Random Exploration of Large Models. 2018 abs/1806.04878 CoRR http://arxiv.org/abs/1806.04878 db/journals/corr/corr1806.html#abs-1806-04878

Louis-Claude Canon Pierre-Cyrille Héam Laurent Philippe 0001 Controlling the correlation of cost matrices to assess scheduling algorithm performance on heterogeneous platforms. 2017 29 Concurr. Comput. Pract. Exp. 15 https://doi.org/10.1002/cpe.4185 db/journals/concurrency/concurrency29.html#CanonHP17

Sylvain Contassot-Vivier Jean-François Couchot Christophe Guyeux Pierre-Cyrille Héam Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations. 1750014:1-1750014:18 2017 27 Int. J. Bifurc. Chaos 1 https://doi.org/10.1142/S0218127417500146 db/journals/ijbc/ijbc27.html#Contassot-Vivier17

Pierre-Cyrille Héam Vincent Hugot Olga Kouchnarenko The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. 6-9 2017 118 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2016.09.007 db/journals/ipl/ipl118.html#HeamHK17

Sylvain Contassot-Vivier Jean-François Couchot Christophe Guyeux Pierre-Cyrille Héam Random Walk in a N-cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations. 2017 abs/1702.02533 CoRR http://arxiv.org/abs/1702.02533 db/journals/corr/corr1702.html#Contassot-Vivier17

Jacques M. Bahi Christophe Guyeux Pierre-Cyrille Héam A Cryptographic Approach for Steganography. 2017 abs/1706.08752 CoRR http://arxiv.org/abs/1706.08752 db/journals/corr/corr1706.html#BahiGH17

Jean-François Couchot Pierre-Cyrille Héam Christophe Guyeux Qianxue Wang Jacques M. Bahi Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers. 2017 abs/1706.08923 CoRR http://arxiv.org/abs/1706.08923 db/journals/corr/corr1706.html#CouchotHGWB17

Pierre-Cyrille Héam Frédéric Dadeau Rafik Kheddam Ghazi Maatoug Michaël Rusinowitch A Model-Based Testing Approach for Security Protocols. 553-556 2016 CSE/EUC/DCABES https://doi.org/10.1109/CSE-EUC-DCABES.2016.240 https://doi.ieeecomputersociety.org/10.1109/CSE-EUC-DCABES.2016.240 conf/cse/2016 db/conf/cse/cse2016.html#HeamDKMR16 Louis-Claude Canon Pierre-Cyrille Héam Laurent Philippe 0001 Controlling and Assessing Correlations of Cost Matrices in Heterogeneous Scheduling. 133-145 2016 Euro-Par https://doi.org/10.1007/978-3-319-43659-3_10 conf/europar/2016 db/conf/europar/europar2016.html#CanonHP16

Frédéric Dadeau Pierre-Cyrille Héam Rafik Kheddam Ghazi Maatoug Michaël Rusinowitch Model-based mutation testing from security protocols in HLPSL. 684-711 2015 25 Softw. Test. Verification Reliab. 5-7 https://doi.org/10.1002/stvr.1531 https://www.wikidata.org/entity/Q115149610 db/journals/stvr/stvr25.html#DadeauHKMR15

Christophe Guyeux Raphaël Couturier Pierre-Cyrille Héam Jacques M. Bahi Efficient and cryptographically secure generation of chaotic pseudorandom numbers on GPU. 3877-3903 2015 71 J. Supercomput. 10 https://doi.org/10.1007/s11227-015-1479-8 db/journals/tjs/tjs71.html#GuyeuxCHB15

Pierre-Cyrille Héam Hana M'Hemdi Covering both stack and states while testing push-down systems. 1-7 2015 ICST Workshops https://doi.org/10.1109/ICSTW.2015.7107406 https://doi.ieeecomputersociety.org/10.1109/ICSTW.2015.7107406 conf/icst/2015w db/conf/icst/icstw2015.html#HeamM15 Pierre-Cyrille Héam Jean-Luc Joly On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism. 140-152 2015 CIAA https://doi.org/10.1007/978-3-319-22360-5_12 conf/wia/2015 db/conf/wia/ciaa2015.html#HeamJ15 Pierre-Cyrille Héam Jean-Luc Joly Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata. 153-164 2015 CIAA https://doi.org/10.1007/978-3-319-22360-5_13 conf/wia/2015 db/conf/wia/ciaa2015.html#HeamJ15a

Pierre-Cyrille Héam Jean-Luc Joly On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism. 2015 abs/1512.02797 CoRR http://arxiv.org/abs/1512.02797 db/journals/corr/corr1512.html#HeamJ15

Pierre-Cyrille Héam Jean-Luc Joly Random Generation and Enumeration of Accessible Determinisitic Real-time Pushdown Automata. 2015 abs/1512.05881 CoRR http://arxiv.org/abs/1512.05881 db/journals/corr/corr1512.html#HeamJ15a

Aloïs Dreyfus Pierre-Cyrille Héam Olga Kouchnarenko Catherine Masson A random testing approach using pushdown automata. 656-683 2014 24 Softw. Test. Verification Reliab. 8 https://doi.org/10.1002/stvr.1526 db/journals/stvr/stvr24.html#DreyfusHKM14

Jean-François Couchot Pierre-Cyrille Héam Christophe Guyeux Qianxue Wang Jacques M. Bahi Pseudorandom Number Generators with Balanced Gray Codes. 469-475 2014 SECRYPT conf/secrypt/2014 db/conf/secrypt/secrypt2014.html#CouchotHGWB14 https://ieeexplore.ieee.org/document/7509527/

Pierre-Cyrille Héam Vincent Hugot Olga Kouchnarenko The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard. 2014 abs/1412.0839 CoRR http://arxiv.org/abs/1412.0839 db/journals/corr/corr1412.html#HeamHK14

Aloïs Dreyfus Pierre-Cyrille Héam Olga Kouchnarenko Random Grammar-Based Testing for Covering All Non-terminals. 210-215 2013 ICST Workshops https://doi.org/10.1109/ICSTW.2013.32 https://doi.ieeecomputersociety.org/10.1109/ICSTW.2013.32 conf/icst/2013w db/conf/icst/icstw2013.html#DreyfusHK13 Jacques M. Bahi Christophe Guyeux Pierre-Cyrille Héam A Cryptographic Approach for Steganography. 518-521 2013 IIH-MSP https://doi.org/10.1109/IIH-MSP.2013.134 conf/iih-msp/2013 db/conf/iih-msp/iih-msp2013.html#BahiGH13 Aloïs Dreyfus Pierre-Cyrille Héam Olga Kouchnarenko Enhancing Approximations for Regular Reachability Analysis. 331-339 2013 CIAA https://doi.org/10.1007/978-3-642-39274-0_29 conf/wia/2013 db/conf/wia/ciaa2013.html#DreyfusHK13

Aloïs Dreyfus Pierre-Cyrille Héam Olga Kouchnarenko Enhancing Approximations for Regular Reachability Analysis. 2013 CoRR http://arxiv.org/abs/1311.6605 abs/1311.6605 db/journals/corr/corr1311.html#DreyfusHK13

Aloïs Dreyfus Pierre-Cyrille Héam Olga Kouchnarenko Random Grammar-based Testing for Covering All Non-Terminals. 2013 CoRR http://arxiv.org/abs/1311.6606 abs/1311.6606 db/journals/corr/corr1311.html#DreyfusHK13a

Pierre-Cyrille Héam Vincent Hugot Olga Kouchnarenko Loops and overloops for Tree-Walking Automata. 43-53 2012 450 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.04.026 db/journals/tcs/tcs450.html#HeamHK12

Pierre-Cyrille Héam Vincent Hugot Olga Kouchnarenko From Linear Temporal Logic Properties to Rewrite Propositions. 316-331 2012 IJCAR https://doi.org/10.1007/978-3-642-31365-3_25 conf/cade/2012 db/conf/cade/ijcar2012.html#HeamHK12 Pierre-Cyrille Héam Vincent Hugot Olga Kouchnarenko On Positive TAGED with a Bounded Number of Constraints. 329-336 2012 CIAA https://doi.org/10.1007/978-3-642-31606-7_29 conf/wia/2012 db/conf/wia/ciaa2012.html#HeamHK12

Pierre-Cyrille Héam On the complexity of computing the profinite closure of a rational language. 5808-5813 2011 412 Theor. Comput. Sci. 41 https://doi.org/10.1016/j.tcs.2011.06.022 db/journals/tcs/tcs412.html#Heam11

Pierre-Cyrille Héam Cyril Nicaud Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing. 60-69 2011 ICST https://doi.org/10.1109/ICST.2011.31 https://doi.ieeecomputersociety.org/10.1109/ICST.2011.31 conf/icst/2011 db/conf/icst/icst2011.html#HeamN11 Frédéric Dadeau Pierre-Cyrille Héam Rafik Kheddam Mutation-Based Test Generation from Security Protocols in HLPSL. 240-248 2011 ICST https://doi.org/10.1109/ICST.2011.42 https://doi.ieeecomputersociety.org/10.1109/ICST.2011.42 conf/icst/2011 db/conf/icst/icst2011.html#DadeauHK11 Pierre-Cyrille Héam Catherine Masson A Random Testing Approach Using Pushdown Automata. 119-133 2011 TAP@TOOLS https://doi.org/10.1007/978-3-642-21768-5_10 conf/tap/2011 db/conf/tap/tap2011.html#HeamM11 Pierre-Cyrille Héam Vincent Hugot Olga Kouchnarenko Loops and Overloops for Tree Walking Automata. 166-177 2011 CIAA https://doi.org/10.1007/978-3-642-22256-6_16 conf/wia/2011 db/conf/wia/ciaa2011.html#HeamHK11

Jacques M. Bahi Raphaël Couturier Christophe Guyeux Pierre-Cyrille Héam Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU http://arxiv.org/abs/1112.5239 2011 CoRR abs/1112.5239 db/journals/corr/corr1112.html#abs-1112-5239

Jacques M. Bahi Christophe Guyeux Pierre-Cyrille Héam A Complexity Approach for Steganalysis http://arxiv.org/abs/1112.5245 2011 CoRR abs/1112.5245 db/journals/corr/corr1112.html#abs-1112-5245

Pierre-Cyrille Héam Olga Kouchnarenko Jérôme Voinot Component simulation-based substitutivity managing QoS and composition issues. 898-917 2010 75 Sci. Comput. Program. 10 https://doi.org/10.1016/j.scico.2010.02.004 db/journals/scp/scp75.html#HeamKV10

Pierre-Cyrille Héam Cyril Nicaud Sylvain Schmitz Parametric random generation of deterministic tree automata. 3469-3480 2010 411 Theor. Comput. Sci. 38-39 https://doi.org/10.1016/j.tcs.2010.05.036 db/journals/tcs/tcs411.html#HeamNS10

Pierre-Cyrille Héam Vincent Hugot Olga Kouchnarenko SAT Solvers for Queries over Tree Automata with Constraints. 343-348 2010 ICST Workshops https://doi.org/10.1109/ICSTW.2010.17 https://doi.ieeecomputersociety.org/10.1109/ICSTW.2010.17 conf/icst/2010w db/conf/icst/icstw2010.html#HeamHK10 Pierre-Christophe Bué Frédéric Dadeau Pierre-Cyrille Héam Model-Based Testing Using Symbolic Animation and Machine Learning. 355-360 2010 ICST Workshops https://doi.org/10.1109/ICSTW.2010.43 https://doi.ieeecomputersociety.org/10.1109/ICSTW.2010.43 conf/icst/2010w db/conf/icst/icstw2010.html#BueDH10 Pierre-Cyrille Héam Automates finis pour la fiabilité logicielle et l'analyse d'accessibilité. (Finite Automata for Software Realiability and Reachability Analyses). 2009 University of Franche-Comté, France https://tel.archives-ouvertes.fr/tel-00432301

Yohan Boichut Roméo Courbis Pierre-Cyrille Héam Olga Kouchnarenko Handling Non Left-Linear Rules when Completing Tree Automata. 837-849 2009 20 Int. J. Found. Comput. Sci. 5 https://doi.org/10.1142/S0129054109006917 db/journals/ijfcs/ijfcs20.html#BoichutCHK09

Yohan Boichut Pierre-Cyrille Héam Olga Kouchnarenko How to Tackle Integer Weighted Automata Positivity. 79-92 2009 RP https://doi.org/10.1007/978-3-642-04420-5_9 conf/rp/2009 db/conf/rp/rp2009.html#BoichutHK09 Pierre-Cyrille Héam Cyril Nicaud Sylvain Schmitz Random Generation of Deterministic Tree (Walking) Automata. 115-124 2009 CIAA https://doi.org/10.1007/978-3-642-02979-0_15 conf/wia/2009 db/conf/wia/ciaa2009.html#HeamNS09 Roméo Courbis Pierre-Cyrille Héam Olga Kouchnarenko TAGED Approximations for Temporal Properties Model-Checking. 135-144 2009 CIAA https://doi.org/10.1007/978-3-642-02979-0_17 conf/wia/2009 db/conf/wia/ciaa2009.html#CourbisHK09 Philippe Balbiani Fahima Cheikh Alili Pierre-Cyrille Héam Olga Kouchnarenko Composition of Services with Constraints. 31-46 2009 conf/facs2/2009 FACS@FMWeek https://doi.org/10.1016/j.entcs.2010.05.003 db/journals/entcs/entcs263.html#BalbianiAHK10 Frédéric Dadeau Jocelyn Levrey Pierre-Cyrille Héam On the Use of Uniform Random Generation of Automata for Testing. 37-51 2009 conf/mbt/2009 MBT@ETAPS https://doi.org/10.1016/j.entcs.2009.09.050 db/conf/mbt/mbt2009.html#DadeauLH09 Yohan Boichut Pierre-Cyrille Héam Olga Kouchnarenko Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. 57-72 2009 conf/infinity/2006-07-08 INFINITY https://doi.org/10.1016/j.entcs.2009.05.030 db/journals/entcs/entcs239.html#BoichutHK09

Yohan Boichut Pierre-Cyrille Héam A theoretical limit for safety verification techniques with regular fix-point computations. 1-2 2008 108 Inf. Process. Lett. 1 https://doi.org/10.1016/j.ipl.2008.03.012 db/journals/ipl/ipl108.html#BoichutH08

Pierre-Cyrille Héam A note on partially ordered tree automata. 242-246 2008 108 Inf. Process. Lett. 4 https://doi.org/10.1016/j.ipl.2008.05.012 db/journals/ipl/ipl108.html#Heam08

Gérard Cécé Pierre-Cyrille Héam Yann Mainier Efficiency of automata in semi-commutation verification techniques. 197-215 2008 42 RAIRO Theor. Informatics Appl. 2 https://doi.org/10.1051/ita:2007029 db/journals/ita/ita42.html#CeceHM08

Yohan Boichut Pierre-Cyrille Héam Olga Kouchnarenko Approximation-based Tree Regular Model-Checking. 216-241 2008 14 Nord. J. Comput. 3 db/journals/njc/njc14.html#BoichutHK08

Gérard Cécé Pierre-Cyrille Héam Yann Mainier Clôtures transitives de semi-commutations et model-checking régulier. 7-28 2008 27 Tech. Sci. Informatiques 1-2 https://doi.org/10.3166/tsi.27.7-28 db/journals/tsi/tsi27.html#CeceHM08

Yohan Boichut Roméo Courbis Pierre-Cyrille Héam Olga Kouchnarenko Finer Is Better: Abstraction Refinement for Rewriting Approximations. 48-62 2008 RTA https://doi.org/10.1007/978-3-540-70590-1_4 conf/rta/2008 db/conf/rta/rta2008.html#BoichutCHK08 Yohan Boichut Roméo Courbis Pierre-Cyrille Héam Olga Kouchnarenko Handling Left-Quadratic Rules When Completing Tree Automata. 61-70 2008 conf/rp/2008 RP https://doi.org/10.1016/j.entcs.2008.12.031 db/journals/entcs/entcs223.html#BoichutCHK08 Pierre-Cyrille Héam Olga Kouchnarenko Jérôme Voinot Component Simulation-based Substitutivity Managing QoS Aspects. 109-123 2008 conf/facs2/2008 FACS https://doi.org/10.1016/j.entcs.2009.12.034 db/journals/entcs/entcs260.html#HeamKV10 Pierre-Cyrille Héam Olga Kouchnarenko Jérôme Voinot How to Handle QoS Aspects in Web Services Substitutivity Verification. 333-338 2007 conf/wetice/2007 WETICE https://doi.ieeecomputersociety.org/10.1109/WETICE.2007.149 db/conf/wetice/wetice2007.html#HeamKV07 Yohan Boichut Pierre-Cyrille Héam Olga Kouchnarenko Handling Algebraic Properties in Automatic Analysis of Security Protocols. 153-167 2006 conf/ictac/2006 ICTAC https://doi.org/10.1007/11921240_11 db/conf/ictac/ictac2006.html#BoichutHK06 Alessandro Armando David A. Basin Yohan Boichut Yannick Chevalier Luca Compagna Jorge Cuéllar Paul Hankes Drielsma Pierre-Cyrille Héam Olga Kouchnarenko Jacopo Mantovani Sebastian Mödersheim David von Oheimb Michaël Rusinowitch Judson Santiago Mathieu Turuani Luca Viganò 0001 Laurent Vigneron The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. 281-285 2005 conf/cav/2005 CAV https://doi.org/10.1007/11513988_27 db/conf/cav/cav2005.html#ArmandoBBCCCDHKMMORSTVV05

Pierre-Cyrille Héam Some complexity results for polynomial rational expressions. 735-741 2003 1-3 Theor. Comput. Sci. 299 https://doi.org/10.1016/S0304-3975(01)00342-5 db/journals/tcs/tcs299.html#Heam03

Pierre-Cyrille Héam On Shuffle Ideals. 359-384 2002 36 RAIRO Theor. Informatics Appl. 4 https://doi.org/10.1051/ita:2003002 db/journals/ita/ita36.html#Heam02

Pierre-Cyrille Héam Some Topological Properties of Rational Sets. 275-290 2001 6 J. Autom. Lang. Comb. 3 db/journals/jalc/jalc6.html#Heam01 https://doi.org/10.25596/jalc-2001-275

Pierre-Cyrille Héam A Lower Bound For Reversible Automata. 331-341 2000 34 RAIRO Theor. Informatics Appl. 5 https://doi.org/10.1051/ita:2000120 db/journals/ita/ita34.html#Heam00

Pierre-Cyrille Héam Automata for Pro-V Topologies. 135-144 2000 conf/wia/2000 CIAA https://doi.org/10.1007/3-540-44674-5_11 db/conf/wia/ciaa2000.html#Heam00 Alessandro Armando Jacques M. Bahi Mohammed Bakiri Philippe Balbiani David A. Basin Anne Benoit Julien Bernard 0001 Yohan Boichut Julien Bourgeois Pierre-Christophe Bué Louis-Claude Canon Gérard Cécé Fahima CheikhFahima Cheikh Alili Yannick Chevalier Luca Compagna Sylvain Contassot-Vivier Jean-François Couchot Roméo Courbis Raphaël Couturier Jorge Cuéllar Frédéric Dadeau Aloïs Dreyfus Paul Hankes Drielsma Anthony Dugois Redouane Elghazi Christophe Guyeux Bachir Habib Ahmed Hammad Edy Hourany Vincent Hugot Malika IoualalenMalika Boukala-Ioualalen Ismaël Jecker Jean-Luc Joly Rafik Kheddam Olga Kouchnarenko Jocelyn Levrey Ghazi Maatoug Yann Mainier Abdallah Makhoul Jacopo Mantovani Catherine Masson Hana M'Hemdi Sebastian Mödersheim Cyril Nicaud David von Oheimb Laurent Philippe 0001 Benoît Piranda Messaoud Rahim Michaël Rusinowitch Judson Santiago Mohamad El Sayah Sylvain Schmitz Mathieu Turuani Luca Viganò 0001 Laurent Vigneron Jérôme Voinot Qianxue Wang