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
17
views
10
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
6,639
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
CONCUR 2000 — Concurrency Theory
LP Deadlock Checking Using Partial Order Dependencies
other
Author(s):
Victor Khomenko
,
Maciej Koutny
Publication date
(Online):
December 21 2000
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
Genome Engineering using CRISPR
Most cited references
10
Record
: found
Abstract
: not found
Article
: not found
Automatic verification of finite-state concurrent systems using temporal logic specifications
Susan E M Clarke
,
E. A. Emerson
,
A. Sistla
(1986)
0
comments
Cited
75
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Branching processes of Petri nets
Joost Engelfriet
(1991)
0
comments
Cited
31
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Model checking using net unfoldings
Javier Esparza
(1994)
0
comments
Cited
19
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2000
Publication date (Online):
December 21 2000
Pages
: 410-425
DOI:
10.1007/3-540-44618-4_30
SO-VID:
91a99a2d-cefb-441b-b0a3-c67431aca794
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 410
LP Deadlock Checking Using Partial Order Dependencies
pp. 123
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
pp. 138
The Impressive Power of Stopwatches
pp. 153
Optimizing Büchi Automata
pp. 168
Generalized Model Checking: Reasoning about Partial State Spaces
pp. 243
Deriving Bisimulation Congruences for Reactive Systems
pp. 334
Weak Bisimulation for Probabilistic Systems
pp. 350
Nondeterminism and Probabilistic Choice: Obeying the Laws
pp. 380
On the Reachability Problem in Cryptographic Protocols
Similar content
6,639
Sequential chemoradiotherapy (SCRT) for larynx preservation (LP): preliminary results of the randomized phase II TREMPLIN study [abstract]
Authors:
J Lefebvre
,
Y Pointreau
,
F Rolland
…
Effect of Lp(a) on the early functional and structural changes of atherosclerosis.
Authors:
O Raitakari
,
D Celermajer
,
M. Adams
Lp : A Logic for Statistical Information
Authors:
Fahiem Bacchus
See all similar
Cited by
2
Compositional Reachability in Petri Nets
Authors:
Julian Rathke
,
Paweł Sobociński
,
Owen Stephens
Computation of Summaries Using Net Unfoldings
Authors:
Stefan Schwoon
,
Javier Esparza
,
Loïg Jezequel
See all cited by