Blaise Genest

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Loïc Hélouët

> Home > Persons > Blaise Genest

Publications

2021
[c45]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/0001GHKR21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/0001GHKR21
S. Akshay, Blaise Genest, Loïc Hélouët, S. Krishna, Sparsa Roychowdhury:
Resilience of Timed Systems. FSTTCS 2021: 33:1-33:22
2020
[c43]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fossacs/AkshayGHM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fossacs/AkshayGHM20
S. Akshay, Blaise Genest, Loïc Hélouët, Sharvik Mital:
Timed Negotiations. FoSSaCS 2020: 37-56
2016
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/apn/AkshayGH16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/apn/AkshayGH16
S. Akshay, Blaise Genest, Loïc Hélouët:
Decidable Classes of Unbounded Petri Nets with Time and Urgency. Petri Nets 2016: 301-322
2014
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/deds/HelouetMGG14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/deds/HelouetMGG14
Loïc Hélouët, Hervé Marchand, Blaise Genest, Thomas Gazagnaire:
Diagnosis from scenarios. Discret. Event Dyn. Syst. 24(4): 353-415 (2014)
2012
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/AkshayGHY12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/AkshayGHY12
S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang:
Regular set of representatives for time-constrained MSC graphs. Inf. Process. Lett. 112(14-15): 592-598 (2012)
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/ictac/AkshayGHY12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ictac/AkshayGHY12
S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang:
Symbolically Bounding the Drift in Time-Constrained MSC Graphs. ICTAC 2012: 1-15
2009
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/GazagnaireGHTY09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/GazagnaireGHTY09
Thomas Gazagnaire, Blaise Genest, Loïc Hélouët, P. S. Thiagarajan, Shaofa Yang:
Causal Message Sequence Charts. Theor. Comput. Sci. 410(41): 4094-4110 (2009)
2008
[c19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fossacs/DarondeauGH08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fossacs/DarondeauGH08
Philippe Darondeau, Blaise Genest, Loïc Hélouët:
Products of Message Sequence Charts. FoSSaCS 2008: 458-473
2007
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/concur/GazagnaireGHTY07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/concur/GazagnaireGHTY07
Thomas Gazagnaire, Blaise Genest, Loïc Hélouët, P. S. Thiagarajan, Shaofa Yang:
Causal Message Sequence Charts. CONCUR 2007: 166-180
2003
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/concur/GenestHM03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/concur/GenestHM03
Blaise Genest, Loïc Hélouët, Anca Muscholl:
High-Level Message Sequence Charts and Projections. CONCUR 2003: 308-322

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.