The following pages link to Franck Cassez (Q209127):
Displaying 41 items.
- The complexity of synchronous notions of information flow security (Q278742) (← links)
- Synthesis of opaque systems with static and dynamic masks (Q453510) (← links)
- Timed modal logics for real-time systems. Specification, verification and control (Q548704) (← links)
- Compilation of the ELECTRE reactive language into finite transition systems (Q673127) (← links)
- (Q944371) (redirect page) (← links)
- When are timed automata weakly timed bisimilar to time Petri nets? (Q944375) (← links)
- Refinement of trace abstraction for real-time programs (Q1685776) (← links)
- The expressive power of time Petri nets (Q1944773) (← links)
- Hybrid verifications of reactive programs (Q1974481) (← links)
- (Q2754097) (← links)
- Predictability of Event Occurrences in Timed Systems (Q2842660) (← links)
- (Q2848419) (← links)
- (Q2849560) (← links)
- Energy and mean-payoff timed games (Q2986981) (← links)
- (Q3044342) (← links)
- Verification of Concurrent Programs Using Trace Abstraction Refinement (Q3460058) (← links)
- Timed Control with Observation Based and Stuttering Invariant Strategies (Q3510796) (← links)
- Efficient On-the-Fly Algorithms for Partially Observable Timed Games (Q3510829) (← links)
- Symbolic Unfoldings for Networks of Timed Automata (Q3522917) (← links)
- The Complexity of Synchronous Notions of Information Flow Security (Q3557857) (← links)
- (Q3602752) (← links)
- Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study (Q3624564) (← links)
- Dynamic Observers for the Synthesis of Opaque Systems (Q3648711) (← links)
- Synthesis of Non-Interferent Timed Systems (Q3648818) (← links)
- (Q4536599) (← links)
- Controllers with Minimal Observation Power (Application to Timed Systems) (Q4649298) (← links)
- (Q4654267) (← links)
- (Q4736580) (← links)
- (Q4738470) (← links)
- (Q4817052) (← links)
- The Complexity of Codiagnosability for Discrete Event and Timed Systems (Q4931284) (← links)
- Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction* (Q4989166) (← links)
- Control and synthesis of non-interferent timed systems (Q5265904) (← links)
- The Complexity of Codiagnosability for Discrete Event and Timed Systems (Q5352876) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465848) (← links)
- Automated Technology for Verification and Analysis (Q5491871) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897475) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897476) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897776) (← links)
- Formal Modeling and Analysis of Timed Systems (Q5897964) (← links)
- Application of partial-order methods to reactive programs with event memorization (Q5946210) (← links)
