Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fabrice Chevalier

dblp:76/5212 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 2 first-authorSoftware engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Logic in computer science · 41% Automated reasoning and model checking · 22% Computational complexity · 19%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science
temporal logic
0.222010
On the expressiveness of TPTL and MTL · Inf. Comput. 2010
Control in o-minimal Hybrid Systems · LICS 2006
Computational complexity › descriptive complexity
expressive power
0.112010
On the expressiveness of TPTL and MTL · Inf. Comput. 2010
Automata and formal languages › timed automata
timed languages
0.112010
On the expressiveness of TPTL and MTL · Inf. Comput. 2010
Logic in computer science
bisimulation
0.112006
Control in o-minimal Hybrid Systems · LICS 2006
Automated reasoning and model checking
hybrid systems
0.112006
Control in o-minimal Hybrid Systems · LICS 2006
Automated reasoning and model checking
model checking
0.112006
Control in o-minimal Hybrid Systems · LICS 2006
Embedded and real-time systems
cyber-physical system platforms
0.012006
Control in o-minimal Hybrid Systems · LICS 2006
Embedded and real-time systems › control systems
hybrid systems control
0.012006
Control in o-minimal Hybrid Systems · LICS 2006

Methods — techniques the papers use, named apart from their topics

time-abstract bisimulation · 0.1suffix equivalence · 0.1
YearPublicationVenuePosition
2010 On the expressiveness of TPTL and MTL
Patricia Bouyer, Fabrice Chevalier, Nicolas Markey
Inf. Comput.2
2009 Weighted o-minimal hybrid systems
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
Ann. Pure Appl. Log.3
2009 Automata and logics over finitely varying functions
Fabrice Chevalier, Deepak D'Souza, M. Raj Mohan, Pavithra Prabhakar
Ann. Pure Appl. Log.1
2006 Controller Synthesis for MTL Specifications
Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier
CONCUR3
2006 On Continuous Timed Automata with Input-Determined Guards
Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar
FSTTCS1
2006 Control in o-minimal Hybrid Systems
abstract
In this paper, we consider the control of general hybrid systems. In this context we show that time-abstract bisimulation is not adequate for solving such a problem. That is why we consider an other equivalence, namely the suffix equivalence based on the encoding of trajectories through words. We show that this suffix equivalence is in general a correct abstraction for control problems. We apply this result to o-minimal hybrid systems, and get decidability and computability results in this framework.
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
LICS3
2005 Fault Diagnosis Using Timed Automata
Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza
FoSSaCS2
2005 On the Expressiveness of TPTL and MTL
Patricia Bouyer, Fabrice Chevalier, Nicolas Markey
FSTTCS2