CONCUR '96: Concurrency Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 44 Retracing some paths in process algebra
3. Altmetric Badge
   Chapter 45 Process calculus based upon evaluation to committed form
4. Altmetric Badge
   Chapter 46 A process algebra with distributed priorities
5. Altmetric Badge
   Chapter 47 Symbolic transition graph with assignment
6. Altmetric Badge
   Chapter 48 Models for concurrent constraint programming
7. Altmetric Badge
   Chapter 49 Comparing transition systems with independence and asynchronous transition systems
8. Altmetric Badge
   Chapter 50 CONCUR '96: Concurrency Theory
9. Altmetric Badge
   Chapter 51 Elementary control structures
10. Altmetric Badge
    Chapter 52 On transformations of concurrent object programs
11. Altmetric Badge
    Chapter 53 On bisimulations for the asynchronous π-calculus
12. Altmetric Badge
    Chapter 54 On the expressiveness of internal mobility in name-passing calculi
13. Altmetric Badge
    Chapter 55 Decoding choice encodings
14. Altmetric Badge
    Chapter 56 Infinite results
15. Altmetric Badge
    Chapter 57 Decidability of bisimulation equivalence for normed pushdown processes
16. Altmetric Badge
    Chapter 58 The modal mu-calculus alternation hierarchy is strict
17. Altmetric Badge
    Chapter 59 Bisimulation collapse and the process taxonomy
18. Altmetric Badge
    Chapter 60 On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
19. Altmetric Badge
    Chapter 61 A Facile tutorial
20. Altmetric Badge
    Chapter 62 Testing probabilistic automata
21. Altmetric Badge
    Chapter 63 Extended Markovian Process Algebra
22. Altmetric Badge
    Chapter 64 Rewriting logic as a semantic framework for concurrency: a progress report
23. Altmetric Badge
    Chapter 65 Truly concurrent constraint programming
24. Altmetric Badge
    Chapter 66 Constraints as processes
25. Altmetric Badge
    Chapter 67 A calculus of mobile agents
26. Altmetric Badge
    Chapter 68 Algebraic interpretation of lambda calculus with resources
27. Altmetric Badge
    Chapter 69 Concurrent graph and term graph rewriting
28. Altmetric Badge
    Chapter 70 Petri boxes and finite precedence
29. Altmetric Badge
    Chapter 71 Constrained properties, semilinear systems, and Petri nets
30. Altmetric Badge
    Chapter 72 Linear constraint systems as high-level nets
31. Altmetric Badge
    Chapter 73 A space-efficient on-the-fly algorithm for real-time model checking
32. Altmetric Badge
    Chapter 74 State equivalences for rectangular hybrid automata
33. Altmetric Badge
    Chapter 75 Verifying abstractions of timed systems
34. Altmetric Badge
    Chapter 76 Towards automatic temporal logic verification of value passing process algebra using abstract interpretation
35. Altmetric Badge
    Chapter 77 Modelling and verification of Distributed Algorithms
36. Altmetric Badge
    Chapter 78 An algorithmic approach for checking closure properties of Ω-regular languages
37. Altmetric Badge
    Chapter 79 Towards automata for branching time and partial order
38. Altmetric Badge
    Chapter 80 Asynchronous cellular automata for pomsets without auto-concurrency
39. Altmetric Badge
    Chapter 81 Action refinement and property inheritance in systems of sequential agents
40. Altmetric Badge
    Chapter 82 A calculus for concurrent objects
41. Altmetric Badge
    Chapter 83 Refinement in Interworkings
42. Altmetric Badge
    Chapter 84 Equivalences of Statecharts
43. Altmetric Badge
    Chapter 85 Modular verification for shared-variable concurrent programs
44. Altmetric Badge
    Chapter 86 The impact of hardware models on shared memory consistency conditions
45. Altmetric Badge
    Chapter 87 Synchronous development of asynchronous systems