You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
|
---|---|
Chapter number | 6 |
Book title |
CONCUR 2004 - Concurrency Theory
|
Published by |
Springer, Berlin, Heidelberg, August 2004
|
DOI | 10.1007/978-3-540-28644-8_6 |
Book ISBNs |
978-3-54-022940-7, 978-3-54-028644-8
|
Authors |
Paolo Baldan, Andrea Corradini, Barbara König |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Hungary | 1 | 17% |
Germany | 1 | 17% |
Unknown | 4 | 67% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 50% |
Professor > Associate Professor | 1 | 17% |
Researcher | 1 | 17% |
Student > Doctoral Student | 1 | 17% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 83% |
Agricultural and Biological Sciences | 1 | 17% |