Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
25
views
14
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,343
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
CONCUR 2003 - Concurrency Theory
Model Checking a Path
other
Author(s):
N. Markey
,
P. Schnoebelen
Publication date
(Print):
2003
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
Path of Science
Most cited references
14
Record
: found
Abstract
: not found
Article
: not found
The complexity of propositional linear temporal logics
A. Sistla
,
E. Clarke
(1985)
0
comments
Cited
126
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
On the temporal analysis of fairness
Jonathan Stavi
,
Amir Pnueli
,
Saharon Shelah
…
(1980)
0
comments
Cited
67
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
Håkan L. S. Younes
,
Reid G. Simmons
(2002)
0
comments
Cited
41
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2003
Pages
: 251-265
DOI:
10.1007/978-3-540-45187-7_17
SO-VID:
6d3b9617-bf54-4e2a-9c02-8b0816f98d43
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 461
A Compositional Semantic Theory for Synchronous Component-Based Design
pp. 144
The Element of Surprise in Timed Games
pp. 222
Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE
pp. 251
Model Checking a Path
Similar content
2,343
Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks
Authors:
I. Chabini
,
Shan Lan
Optimal algorithm for shape from shading and path planning
Authors:
R Kimmel
,
J. A. Sethian
,
A. R. Kimmel
Multiple graph realizations method: improving the accuracy and the efficiency of the shortest path method through random sampling
Authors:
Petros Bogiatzis
,
Catherine A Rychert
,
Nicholas Harmon
See all similar
Cited by
9
Rewriting-Based Techniques for Runtime Verification
Authors:
Grigore Rosu
,
Klaus Havelund
Variable Automata over Infinite Alphabets
Authors:
Orna Grumberg
,
Orna Kupferman
,
Sarai Sheinvald
Robustness of Temporal Logic Specifications
Authors:
Georgios E. Fainekos
,
George Pappas
See all cited by