↓ Skip to main content

CONCUR 2006 - Concurrency Theory

Overview of attention for book
Cover of 'CONCUR 2006 - Concurrency Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Modeling Timed Concurrent Systems
  3. Altmetric Badge
    Chapter 2 Some Remarks on Definability of Process Graphs
  4. Altmetric Badge
    Chapter 3 Sanity Checks in Formal Verification
  5. Altmetric Badge
    Chapter 4 Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
  6. Altmetric Badge
    Chapter 5 Probability and Nondeterminism in Operational Models of Concurrency
  7. Altmetric Badge
    Chapter 6 CONCUR 2006 – Concurrency Theory
  8. Altmetric Badge
    Chapter 7 Proving Liveness by Backwards Reachability
  9. Altmetric Badge
    Chapter 8 Model Checking Quantified Computation Tree Logic
  10. Altmetric Badge
    Chapter 9 Liveness, Fairness and Impossible Futures
  11. Altmetric Badge
    Chapter 10 Checking a Mutex Algorithm in a Process Algebra with Fairness
  12. Altmetric Badge
    Chapter 11 A Complete Axiomatic Semantics for the CSP Stable-Failures Model
  13. Altmetric Badge
    Chapter 12 Transition Systems of Elementary Net Systems with Localities
  14. Altmetric Badge
    Chapter 13 Operational Determinism and Fast Algorithms
  15. Altmetric Badge
    Chapter 14 Minimization, Learning, and Conformance Testing of Boolean Programs
  16. Altmetric Badge
    Chapter 15 A Capability Calculus for Concurrency and Determinism
  17. Altmetric Badge
    Chapter 16 A New Type System for Deadlock-Free Processes
  18. Altmetric Badge
    Chapter 17 Sortings for Reactive Systems
  19. Altmetric Badge
    Chapter 18 Dynamic Access Control in a Concurrent Object Calculus
  20. Altmetric Badge
    Chapter 19 Concurrent Rewriting for Graphs with Equivalences
  21. Altmetric Badge
    Chapter 20 Event Structure Semantics for Nominal Calculi
  22. Altmetric Badge
    Chapter 21 Encoding ℂDuce in the ℂ π -Calculus
  23. Altmetric Badge
    Chapter 22 A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
  24. Altmetric Badge
    Chapter 23 Probabilistic I/O Automata: Theories of Two Equivalences
  25. Altmetric Badge
    Chapter 24 Reachability in Recursive Markov Decision Processes
  26. Altmetric Badge
    Chapter 25 Strategy Improvement for Stochastic Rabin and Streett Games
  27. Altmetric Badge
    Chapter 26 Weak Bisimulation Up to Elaboration
  28. Altmetric Badge
    Chapter 27 Generic Forward and Backward Simulations
  29. Altmetric Badge
    Chapter 28 On Finite Alphabets and Infinite Bases III: Simulation
  30. Altmetric Badge
    Chapter 29 Inference of Event-Recording Automata Using Timed Decision Trees
  31. Altmetric Badge
    Chapter 30 Controller Synthesis for MTL Specifications
  32. Altmetric Badge
    Chapter 31 On Interleaving in Timed Automata
  33. Altmetric Badge
    Chapter 32 A Language for Task Orchestration and Its Semantic Properties
  34. Altmetric Badge
    Chapter 33 Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
  35. Altmetric Badge
    Chapter 34 Second-Order Simple Grammars
Attention for Chapter 7: Proving Liveness by Backwards Reachability
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
7 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.
Chapter title
Proving Liveness by Backwards Reachability
Chapter number 7
Book title
CONCUR 2006 – Concurrency Theory
Published by
Springer, Berlin, Heidelberg, August 2006
DOI 10.1007/11817949_7
Book ISBNs
978-3-54-037376-6, 978-3-54-037377-3
Authors

Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena

Mendeley readers

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

Geographical breakdown

Country Count As %
Italy 1 14%
Unknown 6 86%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 57%
Student > Master 2 29%
Student > Doctoral Student 1 14%
Other 1 14%
Readers by discipline Count As %
Computer Science 7 100%
Mathematics 1 14%