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
36
views
15
references
Top references
cited by
8
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,163
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
Decidability and Complexity Results for Timed Automata via Channel Machines
other
Author(s):
Parosh Aziz Abdulla
,
Johann Deneux
,
Joël Ouaknine
,
James Worrell
Publication date
(Print):
2005
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
Scientific Ocean Drilling Expedition Research Results
Most cited references
15
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
Article
: not found
Well-structured transition systems everywhere!
A Finkel
,
Ph. Schnoebelen
(2001)
0
comments
Cited
90
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Real-Time Logics: Complexity and Expressiveness
T.A. Henzinger
,
R. Alur
(1993)
0
comments
Cited
38
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 1089-1101
DOI:
10.1007/11523468_88
SO-VID:
f78dee75-c274-48e8-bed2-03315845b4c4
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 16
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
pp. 791
Boneh-Franklin Identity Based Encryption Revisited
pp. 956
Approximating Max kCSP – Outperforming a Random Assignment with Almost a Linear Factor
pp. 153
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
pp. 191
Measure and Conquer: Domination – A Case Study
pp. 249
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs
pp. 261
Deterministic Constructions of Approximate Distance Oracles and Spanners
pp. 347
On the Wake-Up Problem in Radio Networks
pp. 513
Weighted Automata and Weighted Logics
pp. 589
Simulated Annealing Beats Metropolis in Combinatorial Optimization
pp. 627
Reordering Buffer Management for Non-uniform Cost Models
pp. 677
On the Cover Time of Random Geometric Graphs
pp. 779
Completely Non-malleable Schemes
pp. 803
Single-Database Private Information Retrieval with Constant Communication Rate
pp. 878
The Complexity of Stochastic Rabin and Streett Games
pp. 1018
An Accessible Approach to Behavioural Pseudometrics
pp. 1043
A Better Approximation Ratio for the Vertex Cover Problem
pp. 1089
Decidability and Complexity Results for Timed Automata via Channel Machines
pp. 1102
Congruences for Visibly Pushdown Languages
pp. 1115
Approximation Algorithms for Euclidean Group TSP
pp. 1202
A Fully Abstract Encoding of the π-Calculus with Data Terms
pp. 1349
The Polyranking Principle
pp. 1450
Unsafe Grammars and Panic Automata
Similar content
5,163
Learning to decide with and without reasoning: how task experience affects attribute weighting and preference stability
Authors:
T. Leisti
,
J. Hakkinen
Decidability and Complexity of Decision Problems for Affine Continuous VASS
Authors:
A. R. Balasubramanian
How general practitioners decide on maxims of action in response to demands from conflicting sets of norms: a grounded theory study
Authors:
Linus Johnsson
,
Lena Nordgren
See all similar
Cited by
8
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
Authors:
Pierre Chambart
,
Philippe Schnoebelen
Safety Metric Temporal Logic Is Fully Decidable
Authors:
Joel Ouaknine
,
James Worrell
Model Checking Probabilistic Timed Automata with One or Two Clocks
Authors:
Marcin Jurdzinski
,
Francois Laroussinie
,
Jeremy Sproston
See all cited by