The following pages link to Blaise Genest (Q436615):
Displaying 50 items.
- Regular set of representatives for time-constrained MSC graphs (Q436617) (← links)
- Diagnosis from scenarios (Q481349) (← links)
- Privacy preserving minimal observability for composite transactional services (Q481362) (← links)
- Causal message sequence charts (Q843103) (← links)
- Pattern matching and membership for hierarchical message sequence charts (Q927396) (← links)
- Symbolically quantifying response time in stochastic models using moments and semirings (Q1653002) (← links)
- Quasi-static scheduling of communicating tasks (Q1959479) (← links)
- Timed negotiations (Q2200811) (← links)
- Global PAC bounds for learning discrete time Markov chains (Q2226743) (← links)
- On commutativity based edge lean search (Q2268917) (← links)
- Infinite-state high-level MSCs: model-checking and realizability (Q2495403) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- Decidable Classes of Unbounded Petri Nets with Time and Urgency (Q2822660) (← links)
- (Q2908878) (← links)
- (Q2911642) (← links)
- Symbolically Bounding the Drift in Time-Constrained MSC Graphs (Q2915094) (← links)
- Knowledge = Observation + Memory + Computation (Q2949441) (← links)
- (Q2963915) (← links)
- Approximate Verification of the Symbolic Dynamics of Markov Chains (Q2986781) (← links)
- (Q3044337) (← links)
- (Q3504343) (← links)
- Quantifying the Discord: Order Discrepancies in Message Sequence Charts (Q3510808) (← links)
- Causal Message Sequence Charts (Q3525636) (← links)
- Tree Pattern Rewriting Systems (Q3540083) (← links)
- Quasi-Static Scheduling of Communicating Tasks (Q3541026) (← links)
- QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS (Q3552521) (← links)
- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata (Q3587426) (← links)
- Constructing Exponential-Size Deterministic Zielonka Automata (Q3591422) (← links)
- Grey-Box Checking (Q3613088) (← links)
- (Q4601857) (← links)
- Qualitative Determinacy and Decidability of Stochastic Games with Signals (Q4640298) (← links)
- (Q4737197) (← links)
- (Q5111624) (← links)
- Distribution-based objectives for Markov Decision Processes (Q5145274) (← links)
- A Look-Ahead Simulation Algorithm for DBN Models of Biochemical Pathways (Q5204368) (← links)
- (Q5227518) (← links)
- Foundations of Software Science and Computation Structures (Q5308451) (← links)
- Asynchronous Games over Tree Architectures (Q5327440) (← links)
- On Commutativity Based Edge Lean Search (Q5428806) (← links)
- (Q5431917) (← links)
- Products of Message Sequence Charts (Q5458379) (← links)
- Approximate Verification of the Symbolic Dynamics of Markov Chains (Q5501948) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703776) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703782) (← links)
- Developments in Language Theory (Q5711975) (← links)
- Lectures on Concurrency and Petri Nets (Q5712282) (← links)
- Detecting Races in Ensembles of Message Sequence Charts (Q5758125) (← links)
- Succinct Population Protocols for Presburger Arithmetic (Q5874313) (← links)
- Classification among Hidden Markov Models (Q5875663) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897500) (← links)
