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
26
views
12
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
3,105
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Strict Divergence for Probabilistic Timed Automata
other
Author(s):
Jeremy Sproston
Publication date
(Print):
2009
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
ScienceOpen Research
Most cited references
12
Record
: found
Abstract
: not found
Article
: not found
A logic for reasoning about time and reliability
Hans-Christen Hansson
,
Bengt-Harald Jonsson
(1994)
0
comments
Cited
210
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Model checking of probabilistic and nondeterministic systems
Andrea Bianco
,
Luca Alfaro
(1995)
0
comments
Cited
94
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Denumerable Markov Chains
John G. Kemeny
,
J. Laurie Snell
,
Anthony Knapp
(1976)
0
comments
Cited
60
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Pages
: 620-636
DOI:
10.1007/978-3-642-04081-8_41
SO-VID:
578eb83d-a2c5-4a33-a8f9-542e97874532
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Perspectives on Transactional Memory
pp. 15
The Effect of Tossing Coins in Omega-Automata
pp. 30
Bigraphical Categories
pp. 37
BlenX Static and Dynamic Semantics
pp. 53
Flow Policy Awareness for Distributed Mobile Code
pp. 69
Volume and Entropy of Regular Timed Languages: Discretization Approach
pp. 84
A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types
pp. 99
Encoding Asynchronous Interactions Using Open Petri Nets
pp. 115
Distributed Asynchronous Automata
pp. 131
Algebra for Infinite Forests with an Application to the Temporal Logic EF
pp. 146
Deriving Syntax and Axioms for Quantitative Regular Behaviours
pp. 178
A Logic-Based Framework for Reasoning about Composite Data Structures
pp. 196
Measuring Permissivity in Finite Games
pp. 244
Probabilistic Weighted Automata
pp. 259
Partially-Commutative Context-Free Processes
pp. 289
A Demonic Approach to Information in Probabilistic Systems
pp. 305
HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour
pp. 321
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
pp. 338
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
pp. 354
Model-Checking Games for Fixpoint Logics with Partial Order Models
pp. 384
Winning Regions of Pushdown Parity Games: A Saturation Method
pp. 415
Concavely-Priced Probabilistic Timed Automata
pp. 431
Compositional Control Synthesis for Partially Observable Systems
pp. 448
Howe’s Method for Calculi with Passivation
pp. 463
On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
pp. 481
Modeling Radio Networks
pp. 496
Time-Bounded Verification
pp. 511
Secure Enforcement for Global Process Specifications
pp. 527
On Convergence of Concurrent Systems under Regular Interactions
pp. 542
Computing Stuttering Simulations
pp. 557
Weak Time Petri Nets Strike Back!
pp. 587
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
pp. 603
Query-Based Model Checking of Ad Hoc Network Protocols
pp. 620
Strict Divergence for Probabilistic Timed Automata
Similar content
3,105
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
All \((\infty,1)\)-toposes have strict univalent universes
Authors:
Michael A. Shulman
See all similar
Cited by
2
Model checking for probabilistic timed automata
Authors:
Gethin Norman
,
David Parker
,
Jeremy Sproston
Modal Specifications for Probabilistic Timed Systems
Authors:
Tingting Han
,
Christian Krause
,
Marta Kwiatkowska
…
See all cited by