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
50
views
21
references
Top references
cited by
16
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,735
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
CONCUR 2004 - Concurrency Theory
Verification by Network Decomposition
other
Author(s):
Edmund Clarke
,
Muralidhar Talupur
,
Tayssir Touili
,
Helmut Veith
Publication date
(Print):
2004
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
Exponential Random Graph Models
Most cited references
21
Record
: found
Abstract
: not found
Article
: not found
Reasoning about systems with many processes
A. Sistla
,
Steven M. German
(1992)
0
comments
Cited
78
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Limits for automatic verification of finite-state concurrent systems
Dexter Kozen
,
Krzysztof R. Apt
(1986)
0
comments
Cited
60
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Characterizing finite Kripke structures in propositional temporal logic
M.C. Browne
,
O. Grumberg
,
E.M. Clarke
(1988)
0
comments
Cited
44
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2004
Pages
: 276-291
DOI:
10.1007/978-3-540-28644-8_18
SO-VID:
b14a41cc-fdea-426b-9088-a78e55673049
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 193
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems
pp. 512
A Higher Order Modal Fixed Point Logic
pp. 49
Resources, Concurrency and Local Reasoning
pp. 115
Basic Theory of Reduction Congruence forTwo Timed Asynchronous π-Calculi
pp. 276
Verification by Network Decomposition
pp. 387
Model Checking Timed Automata with One or Two Clocks
pp. 402
On Flatness for 2-Dimensional Vector Addition Systems with States
pp. 497
Session Types for Functional Multithreading
Similar content
1,735
A News Verification Browser for the Detection of Clickbait, Satire, and Falsified News
Authors:
Victoria Rubin
,
Chris Brogly
,
Nadia Conroy
…
Network Discovery and Verification with Distance Queries
Authors:
Thomas Erlebach
,
Alexander Hall
,
Michael Hoffmann
…
Ultrasonic Phased Array Compressive Imaging in Time and Frequency Domain: Simulation, Experimental Verification and Real Application
Authors:
Zhiliang Bai
,
Shili Chen
,
Lecheng Jia
…
See all similar
Cited by
16
Parameterized Model Checking of Token-Passing Systems
Authors:
Benjamin Aminof
,
Swen Jacobs
,
Ayrat Khalimov
…
Inferring Network Invariants Automatically
Authors:
Olga Grinchtein
,
Martin Leucker
,
Nir Piterman
Towards Efficient Parameterized Synthesis
Authors:
Ayrat Khalimov
,
Swen Jacobs
,
Roderick Bloem
See all cited by