↓ Skip to main content

CONCUR 2000 — Concurrency Theory

Overview of attention for book
Cover of 'CONCUR 2000 — Concurrency Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Combining Theorem Proving and Model Checking through Symbolic Analysis
  3. Altmetric Badge
    Chapter 2 Verification Is Experimentation!
  4. Altmetric Badge
    Chapter 3 Compositional Performance Analysis Using Probabilistic I/O Automata
  5. Altmetric Badge
    Chapter 4 Formal Models for Communication-Based Design
  6. Altmetric Badge
    Chapter 5 Programming Access Control: The Klaim Experience
  7. Altmetric Badge
    Chapter 6 Exploiting Hierarchical Structure for Efficient Formal Verification
  8. Altmetric Badge
    Chapter 7 From Process Calculi to Process Frameworks
  9. Altmetric Badge
    Chapter 8 Verification Using Tabled Logic Programming
  10. Altmetric Badge
    Chapter 9 Open Systems in Reactive Environments: Control and Synthesis
  11. Altmetric Badge
    Chapter 10 Model Checking with Finite Complete Prefixes Is PSPACE-Complete
  12. Altmetric Badge
    Chapter 11 Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
  13. Altmetric Badge
    Chapter 12 The Impressive Power of Stopwatches
  14. Altmetric Badge
    Chapter 13 Optimizing Büchi Automata
  15. Altmetric Badge
    Chapter 14 Generalized Model Checking: Reasoning about Partial State Spaces
  16. Altmetric Badge
    Chapter 15 Reachability Analysis for Some Models of Infinite-State Transition Systems
  17. Altmetric Badge
    Chapter 16 Process Spaces
  18. Altmetric Badge
    Chapter 17 Failure Semantics for the Exchange of Information in Multi-Agent Systems
  19. Altmetric Badge
    Chapter 18 Proof-Outlines for Threads in Java
  20. Altmetric Badge
    Chapter 19 Deriving Bisimulation Congruences for Reactive Systems
  21. Altmetric Badge
    Chapter 20 Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic
  22. Altmetric Badge
    Chapter 21 Process Languages for Rooted Eager Bisimulation
  23. Altmetric Badge
    Chapter 22 Action Contraction
  24. Altmetric Badge
    Chapter 23 A Theory of Testing for Markovian Processes
  25. Altmetric Badge
    Chapter 24 Reasoning about Probabilistic Lossy Channel Systems
  26. Altmetric Badge
    Chapter 25 Weak Bisimulation for Probabilistic Systems
  27. Altmetric Badge
    Chapter 26 Nondeterminism and Probabilistic Choice: Obeying the Laws
  28. Altmetric Badge
    Chapter 27 Secrecy and Group Creation
  29. Altmetric Badge
    Chapter 28 On the Reachability Problem in Cryptographic Protocols
  30. Altmetric Badge
    Chapter 29 Secure Information Flow for Concurrent Processes
  31. Altmetric Badge
    Chapter 30 LP Deadlock Checking Using Partial Order Dependencies
  32. Altmetric Badge
    Chapter 31 Pomsets for Local Trace Languages
  33. Altmetric Badge
    Chapter 32 Functional Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs
  34. Altmetric Badge
    Chapter 33 The Control of Synchronous Systems
  35. Altmetric Badge
    Chapter 34 Typing Non-uniform Concurrent Objects
  36. Altmetric Badge
    Chapter 35 An Implicitly-Typed Deadlock-Free Process Calculus
  37. Altmetric Badge
    Chapter 36 Typed Mobile Objects
  38. Altmetric Badge
    Chapter 37 Synthesizing Distributed Finite-State Systems from MSCs
  39. Altmetric Badge
    Chapter 38 Emptiness Is Decidable for Asynchronous Cellular Machines
  40. Altmetric Badge
    Chapter 39 Revisiting Safety and Liveness in the Context of Failures
  41. Altmetric Badge
    Chapter 40 Well-Abstracted Transition Systems
  42. Altmetric Badge
    Chapter 41 A Unifying Approach to Data-Independence
  43. Altmetric Badge
    Chapter 42 Chi Calculus with Mismatch
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (77th percentile)
  • Good Attention Score compared to outputs of the same age and source (69th percentile)

Mentioned by

5 tweeters


3 Dimensions

Readers on

13 Mendeley
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.
CONCUR 2000 — Concurrency Theory
Published by
Lecture notes in computer science, December 2000
DOI 10.1007/3-540-44618-4
978-3-54-067897-7, 978-3-54-044618-7

Catuscia Palamidessi

Twitter Demographics

The data shown below were collected from the profiles of 5 tweeters who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

The data shown below were compiled from readership statistics for 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 13 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 15%
Student > Bachelor 1 8%
Student > Master 1 8%
Unknown 9 69%
Readers by discipline Count As %
Computer Science 2 15%
Mathematics 1 8%
Unknown 10 77%

Attention Score in Context

This research output has an Altmetric Attention Score of 4. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 26 September 2022.
All research outputs
of 23,414,653 outputs
Outputs from Lecture notes in computer science
of 8,157 outputs
Outputs of similar age
of 115,675 outputs
Outputs of similar age from Lecture notes in computer science
of 23 outputs
Altmetric has tracked 23,414,653 research outputs across all sources so far. This one has received more attention than most of these and is in the 68th percentile.
So far Altmetric has tracked 8,157 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.1. This one has gotten more attention than average, scoring higher than 70% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 115,675 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 77% of its contemporaries.
We're also able to compare this research output to 23 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 69% of its contemporaries.