Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
22
views
8
references
Top references
cited by
2
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,935
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
On Reachability for Hybrid Automata over Bounded Time
other
Author(s):
Thomas Brihaye
,
Laurent Doyen
,
Gilles Geeraerts
,
Joël Ouaknine
,
Jean-François Raskin
,
James Worrell
Publication date
(Print):
2011
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
2023 Research and Innovation Open Distance and eLearning (ODeL) Hybrid Conference
Most cited references
8
Record
: found
Abstract
: not found
Article
: not found
What's Decidable about Hybrid Automata?
Thomas Henzinger
,
Peter W. Kopke
,
Anuj Puri
…
(1998)
0
comments
Cited
95
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
HyTech: A model checker for hybrid systems
Thomas Henzinger
,
Pei-Hsin Ho
,
Howard Wong-Toi
(1997)
0
comments
Cited
41
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
PHAVer: algorithmic verification of hybrid systems past HyTech
Goran Frehse
(2008)
0
comments
Cited
33
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2011
Pages
: 416-427
DOI:
10.1007/978-3-642-22012-8_33
SO-VID:
5c7ea615-2dab-4802-b977-9b623bb4a782
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Nondeterministic Streaming String Transducers
pp. 21
An Introduction to Randomness Extractors
pp. 42
Invitation to Algorithmic Uses of Inclusion–Exclusion
pp. 60
On the Relation between Differential Privacy and Quantitative Information Flow
pp. 89
Rice’s Theorem for μ-Limit Sets of Cellular Automata
pp. 101
Fault-Tolerant Compact Routing Schemes for General Graphs
pp. 113
Local Matching Dynamics in Social Networks
pp. 125
Regular Languages of Words over Countable Linear Orderings
pp. 137
Algebraic Independence and Blackbox Identity Testing
pp. 149
A Fragment of ML Decidable by Visibly Pushdown Automata
pp. 162
Krivine Machines and Higher-Order Schemes
pp. 174
Relating Computational Effects by ⊤ ⊤-Lifting
pp. 186
Constructing Differential Categories and Deconstructing Categories of Games
pp. 198
Nondeterminism Is Essential in Small 2FAs with Few Reversals
pp. 210
Isomorphism of Regular Trees and Words
pp. 222
On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids
pp. 234
The Cost of Traveling between Languages
pp. 246
Emptiness and Universality Problems in Timed Automata with Positive Frequency
pp. 258
Büchi Automata Can Have Smaller Quotients
pp. 271
Automata-Based CSL Model Checking
pp. 283
A Progress Measure for Explicit-State Probabilistic Model-Checkers
pp. 295
Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
pp. 307
On the Semantics of Markov Automata
pp. 319
Runtime Analysis of Probabilistic Programs with Unbounded Recursion
pp. 332
Approximating the Termination Value of One-Counter MDPs and Stochastic Games
pp. 344
Generic Expression Hardness Results for Primitive Positive Formula Comparison
pp. 356
Guarded Negation
pp. 368
Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates
pp. 380
Modular Markovian Logic
pp. 404
Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems
pp. 416
On Reachability for Hybrid Automata over Bounded Time
pp. 428
Deciding Robustness against Total Store Ordering
pp. 441
Multiply-Recursive Upper Bounds with Higman’s Lemma
pp. 453
Liveness-Preserving Atomicity Abstraction
pp. 466
On Stabilization in Herman’s Algorithm
pp. 478
Online Graph Exploration: New Results on Old and New Algorithms
pp. 490
Distance Oracles for Vertex-Labeled Graphs
pp. 502
Asymptotically Optimal Randomized Rumor Spreading
pp. 514
Fast Convergence for Consensus in Dynamic Networks
pp. 526
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
pp. 539
Restoring Pure Equilibria to Weighted Congestion Games
pp. 552
Existence and Uniqueness of Equilibria for Flows over Time
pp. 564
Collusion in Atomic Splittable Routing Games
pp. 588
Adaptively Secure Non-interactive Threshold Cryptosystems
pp. 613
Efficient Distributed Communication in Ad-Hoc Radio Networks
pp. 625
Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model
pp. 637
Convergence Time of Power-Control Dynamics
pp. 650
A New Approach for Analyzing Convergence Algorithms for Mobile Robots
Similar content
4,935
Sound and precise malware analysis for android via pushdown reachability and entry-point saturation
Authors:
Shuying Liang
,
Andrew W. Keep
,
Matthew Might
…
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Authors:
Eugene Asarin
,
Thao Dang
,
Antoine Girard
Event‐triggered hybrid control strategy based on hybrid automata and decision tree for microgrid
Authors:
Chunxia Dou
,
Shengqi Teng
,
Tengfei Zhang
…
See all similar
Cited by
2
Interrupt Timed Automata: verification and expressiveness
Authors:
Béatrice Bérard
,
Serge Haddad
,
Mathieu Sassolas
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints
Authors:
Gilles Geeraerts
,
Thomas Brihaye
,
James Worrell
…
See all cited by