Overall Objectives
Research Program
Application Domains
New Results
- Analyzing Timed Systems Using Tree Automata
- Interrupt Timed Automata with Auxiliary Clocks and Parameters
- One-Counter Automata with Counter Observability
- Diagnosis in Infinite-State Probabilistic Systems
- Accurate Approximate Diagnosability of Stochastic Systems
- Diagnosability of Repairable Faults
- Optimal constructions for active diagnosis
- Verification of parameterized communicating automata via split-width
- Cyclic Ordering through Partial Orders
- Predicting Traffic Load in Public Transportation Networks
- Unfolding of Parametric Logical Regulatory Networks
- Relationship between the Reprogramming Determinants of Boolean Networks and their Interaction Graph
- D-SPACES: An Implementation of Declarative Semantics for Spatially Structured Information
- Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion
- Goal-Driven Unfolding of Petri Nets
Partnerships and Cooperations
Bibliography
Overall Objectives
Research Program
Application Domains
New Results
- Analyzing Timed Systems Using Tree Automata
- Interrupt Timed Automata with Auxiliary Clocks and Parameters
- One-Counter Automata with Counter Observability
- Diagnosis in Infinite-State Probabilistic Systems
- Accurate Approximate Diagnosability of Stochastic Systems
- Diagnosability of Repairable Faults
- Optimal constructions for active diagnosis
- Verification of parameterized communicating automata via split-width
- Cyclic Ordering through Partial Orders
- Predicting Traffic Load in Public Transportation Networks
- Unfolding of Parametric Logical Regulatory Networks
- Relationship between the Reprogramming Determinants of Boolean Networks and their Interaction Graph
- D-SPACES: An Implementation of Declarative Semantics for Spatially Structured Information
- Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion
- Goal-Driven Unfolding of Petri Nets
Partnerships and Cooperations
Bibliography
Previous | 
Home