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
53
views
12
references
Top references
cited by
13
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,309
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Foundations of Software Science and Computational Structures
Alternating Timed Automata
other
Author(s):
Sławomir Lasota
,
Igor Walukiewicz
Publication date
(Print):
2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
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
ScienceOpen Research
Most cited references
12
Record
: found
Abstract
: not found
Article
: not found
Ordering by Divisibility in Abstract Algebras
Graham Higman
(1952)
0
comments
Cited
141
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
Verifying lossy channel systems has nonprimitive recursive complexity
Ph. Schnoebelen
(2002)
0
comments
Cited
26
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 250-265
DOI:
10.1007/978-3-540-31982-5_16
SO-VID:
74dd789a-b0b9-495c-b260-eecf85bf7c31
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 47
Congruence for Structural Congruences
pp. 140
Model Checking Durational Probabilistic Systems
pp. 25
Mathematical Models of Computational and Combinatorial Structures
pp. 187
A Category of Higher-Dimensional Automata
pp. 202
Third-Order Idealized Algol with Iteration Is Decidable
pp. 250
Alternating Timed Automata
pp. 282
Foundations of Web Transactions
pp. 395
From Separation Logic to First-Order Logic
pp. 455
Duality for Logics of Transition Systems
Similar content
3,309
Automata-Based Dynamic Fault Tolerant Task Scheduling Approach in Fog Computing
Authors:
Sara Ghanavati
,
Jemal Abawajy
,
Davood Izadi
Modeling of urban change using remote sensing data and cellular automata technique
Authors:
K Abutaleb
,
F Ahmed
Origin of Complexity and Conditional Predictability in Cellular Automata
Authors:
Vladimir Garcia-Morales
See all similar
Cited by
13
On Metric Temporal Logic and Faulty Turing Machines
Authors:
Joel Ouaknine
,
James Worrell
On the Expressiveness of TPTL and MTL
Authors:
Patricia Bouyer
,
Fabrice Chevalier
,
Nicolas Markey
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
Authors:
Pierre Chambart
,
Philippe Schnoebelen
See all cited by