CONCUR 2001 — Concurrency Theory
Springer Science & Business Media
Chapter title |
Symbolic Computation of Maximal Probabilisti Reachability
|
---|---|
Chapter number | 12 |
Book title |
CONCUR 2001 — Concurrency Theory
|
Published by |
Springer, Berlin, Heidelberg, August 2001
|
DOI | 10.1007/3-540-44685-0_12 |
Book ISBNs |
978-3-54-042497-0, 978-3-54-044685-9
|
Authors |
Marta Kwiatkowska, Gethin Norman, Jeremy Sproston |
Country | Count | As % |
---|---|---|
Unknown | 7 | 100% |
Readers by professional status | Count | As % |
---|---|---|
Lecturer | 2 | 29% |
Student > Ph. D. Student | 1 | 14% |
Researcher | 1 | 14% |
Professor > Associate Professor | 1 | 14% |
Unknown | 2 | 29% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 3 | 43% |
Agricultural and Biological Sciences | 1 | 14% |
Social Sciences | 1 | 14% |
Medicine and Dentistry | 1 | 14% |
Unknown | 1 | 14% |