2008 |
26 | EE | Blaise Genest,
Anca Muscholl,
Olivier Serre,
Marc Zeitoun:
Tree Pattern Rewriting Systems.
ATVA 2008: 332-346 |
25 | EE | Philippe Darondeau,
Blaise Genest,
P. S. Thiagarajan,
Shaofa Yang:
Quasi-Static Scheduling of Communicating Tasks.
CONCUR 2008: 310-324 |
24 | EE | Philippe Darondeau,
Blaise Genest,
Loïc Hélouët:
Products of Message Sequence Charts.
FoSSaCS 2008: 458-473 |
23 | EE | Debmalya Biswas,
Thomas Gazagnaire,
Blaise Genest:
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination.
HASE 2008: 97-106 |
22 | | Debmalya Biswas,
Blaise Genest:
Minimal Observability for Transactional Hierarchical Services.
SEKE 2008: 531-536 |
21 | EE | Nathalie Bertrand,
Blaise Genest,
Hugo Gimbert:
Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides
CoRR abs/0811.3975: (2008) |
20 | EE | Blaise Genest,
Anca Muscholl:
Pattern Matching and Membership for Hierarchical Message Sequence Charts.
Theory Comput. Syst. 42(4): 536-567 (2008) |
2007 |
19 | EE | Edith Elkind,
Blaise Genest,
Doron Peled,
Paola Spoletini:
Quantifying the Discord: Order Discrepancies in Message Sequence Charts.
ATVA 2007: 378-393 |
18 | EE | Thomas Gazagnaire,
Blaise Genest,
Loïc Hélouët,
P. S. Thiagarajan,
Shaofa Yang:
Causal Message Sequence Charts.
CONCUR 2007: 166-180 |
17 | EE | Dragan Bosnacki,
Edith Elkind,
Blaise Genest,
Doron Peled:
On Commutativity Based Edge Lean Search.
ICALP 2007: 158-170 |
16 | EE | Edith Elkind,
Blaise Genest,
Doron Peled:
Detecting Races in Ensembles of Message Sequence Charts.
TACAS 2007: 420-434 |
15 | EE | Blaise Genest,
Dietrich Kuske,
Anca Muscholl:
On Communicating Automata with Bounded Channels.
Fundam. Inform. 80(1-3): 147-167 (2007) |
2006 |
14 | EE | Edith Elkind,
Blaise Genest,
Doron Peled,
Hongyang Qu:
Grey-Box Checking.
FORTE 2006: 420-435 |
13 | EE | Blaise Genest,
Anca Muscholl:
Constructing Exponential-Size Deterministic Zielonka Automata.
ICALP (2) 2006: 565-576 |
12 | EE | Blaise Genest,
Dietrich Kuske,
Anca Muscholl:
A Kleene theorem and model checking algorithms for existentially bounded communicating automata.
Inf. Comput. 204(6): 920-956 (2006) |
11 | EE | Blaise Genest,
Anca Muscholl,
Helmut Seidl,
Marc Zeitoun:
Infinite-state high-level MSCs: Model-checking and realizability.
J. Comput. Syst. Sci. 72(4): 617-647 (2006) |
2005 |
10 | EE | Blaise Genest,
Anca Muscholl:
Message Sequence Charts: A Survey.
ACSD 2005: 2-4 |
9 | EE | Blaise Genest:
On Implementation of Global Concurrent Systems with Local Asynchronous Controllers.
CONCUR 2005: 443-457 |
8 | EE | Blaise Genest:
Compositional Message Sequence Charts (CMSCs) Are Better to Implement Than MSCs.
TACAS 2005: 429-444 |
7 | EE | Blaise Genest,
Dietrich Kuske,
Anca Muscholl,
Doron Peled:
Snapshot Verification.
TACAS 2005: 510-525 |
2004 |
6 | EE | Blaise Genest,
Anca Muscholl,
Dietrich Kuske:
A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms.
Developments in Language Theory 2004: 30-48 |
5 | EE | Blaise Genest,
Marius Minea,
Anca Muscholl,
Doron Peled:
Specifying and Verifying Partial Order Properties Using Template MSCs.
FoSSaCS 2004: 195-210 |
2003 |
4 | EE | Blaise Genest,
Loïc Hélouët,
Anca Muscholl:
High-Level Message Sequence Charts and Projections.
CONCUR 2003: 308-322 |
3 | EE | Blaise Genest,
Anca Muscholl,
Doron Peled:
Message Sequence Charts.
Lectures on Concurrency and Petri Nets 2003: 537-558 |
2002 |
2 | EE | Blaise Genest,
Anca Muscholl,
Helmut Seidl,
Marc Zeitoun:
Infinite-State High-Level MSCs: Model-Checking and Realizability.
ICALP 2002: 657-668 |
1 | EE | Blaise Genest,
Anca Muscholl:
Pattern Matching and Membership for Hierarchical Message Sequence Charts.
LATIN 2002: 326-340 |