↓ Skip to main content

Automata, Languages and Programming

Overview of attention for book
Cover of 'Automata, Languages and Programming'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Survey of Stochastic Games with Limsup and Liminf Objectives
  3. Altmetric Badge
    Chapter 2 Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
  4. Altmetric Badge
    Chapter 3 Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
  5. Altmetric Badge
    Chapter 4 When Are Timed Automata Determinizable?
  6. Altmetric Badge
    Chapter 5 Faithful Loops for Aperiodic E-Ordered Monoids
  7. Altmetric Badge
    Chapter 6 Boundedness of Monadic Second-Order Formulae over Finite Words
  8. Altmetric Badge
    Chapter 7 Semilinear Program Feasibility
  9. Altmetric Badge
    Chapter 8 Floats and Ropes: A Case Study for Formal Numerical Program Verification
  10. Altmetric Badge
    Chapter 9 Reachability in Stochastic Timed Games
  11. Altmetric Badge
    Chapter 10 Equations Defining the Polynomial Closure of a Lattice of Regular Languages
  12. Altmetric Badge
    Chapter 11 Approximating Markov Processes by Averaging
  13. Altmetric Badge
    Chapter 12 The Theory of Stabilisation Monoids and Regular Cost Functions
  14. Altmetric Badge
    Chapter 13 A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
  15. Altmetric Badge
    Chapter 14 On Constructor Rewrite Systems and the Lambda-Calculus
  16. Altmetric Badge
    Chapter 15 On Regular Temporal Logics with Past,
  17. Altmetric Badge
    Chapter 16 Forward Analysis for WSTS, Part II: Complete WSTS
  18. Altmetric Badge
    Chapter 17 Qualitative Concurrent Stochastic Games with Imperfect Information
  19. Altmetric Badge
    Chapter 18 Diagrammatic Confluence and Completion
  20. Altmetric Badge
    Chapter 19 Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
  21. Altmetric Badge
    Chapter 20 LTL Path Checking Is Efficiently Parallelizable
  22. Altmetric Badge
    Chapter 21 An Explicit Formula for the Free Exponential Modality of Linear Logic
  23. Altmetric Badge
    Chapter 22 Decidability of the Guarded Fragment with the Transitive Closure
  24. Altmetric Badge
    Chapter 23 Weak Alternating Timed Automata
  25. Altmetric Badge
    Chapter 24 A Decidable Characterization of Locally Testable Tree Languages
  26. Altmetric Badge
    Chapter 25 Automata, Languages and Programming
  27. Altmetric Badge
    Chapter 26 Google’s Auction for TV Ads
  28. Altmetric Badge
    Chapter 27 Graph Sparsification in the Semi-streaming Model
  29. Altmetric Badge
    Chapter 28 Sort Me If You Can: How to Sort Dynamic Data
  30. Altmetric Badge
    Chapter 29 Automata, Languages and Programming
  31. Altmetric Badge
    Chapter 30 Mediated Population Protocols
  32. Altmetric Badge
    Chapter 31 Rumor Spreading in Social Networks
  33. Altmetric Badge
    Chapter 32 MANETS: High Mobility Can Make Up for Low Transmission Power
  34. Altmetric Badge
    Chapter 33 Multiple Random Walks and Interacting Particle Systems
  35. Altmetric Badge
    Chapter 34 Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
  36. Altmetric Badge
    Chapter 35 On a Network Generalization of the Minmax Theorem
  37. Altmetric Badge
    Chapter 36 Rate-Based Transition Systems for Stochastic Process Calculi
  38. Altmetric Badge
    Chapter 37 Improved Algorithms for Latency Minimization in Wireless Networks
  39. Altmetric Badge
    Chapter 38 Efficient Methods for Selfish Network Design
  40. Altmetric Badge
    Chapter 39 Smoothed Analysis of Balancing Networks
  41. Altmetric Badge
    Chapter 40 Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
  42. Altmetric Badge
    Chapter 41 Automata, Languages and Programming
  43. Altmetric Badge
    Chapter 42 Algorithms for Secretary Problems on Graphs and Hypergraphs
  44. Altmetric Badge
    Chapter 43 Automata, Languages and Programming
  45. Altmetric Badge
    Chapter 44 Secure Function Collection with Sublinear Storage
  46. Altmetric Badge
    Chapter 45 Worst-Case Efficiency Analysis of Queueing Disciplines
  47. Altmetric Badge
    Chapter 46 On Observing Dynamic Prioritised Actions in SOC
  48. Altmetric Badge
    Chapter 47 A Distributed and Oblivious Heap
  49. Altmetric Badge
    Chapter 48 Proportional Response Dynamics in the Fisher Market
Attention for Chapter 36: Rate-Based Transition Systems for Stochastic Process Calculi
Altmetric Badge

Readers on

mendeley
23 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
Rate-Based Transition Systems for Stochastic Process Calculi
Chapter number 36
Book title
Automata, Languages and Programming
Published by
Springer, Berlin, Heidelberg, July 2009
DOI 10.1007/978-3-642-02930-1_36
Book ISBNs
978-3-64-202929-5, 978-3-64-202930-1
Authors

Rocco De Nicola, Diego Latella, Michele Loreti, Mieke Massink

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United Kingdom 1 4%
United States 1 4%
Unknown 21 91%

Demographic breakdown

Readers by professional status Count As %
Researcher 5 22%
Student > Ph. D. Student 5 22%
Student > Master 4 17%
Professor > Associate Professor 3 13%
Professor 2 9%
Other 1 4%
Unknown 3 13%
Readers by discipline Count As %
Computer Science 17 74%
Mathematics 1 4%
Agricultural and Biological Sciences 1 4%
Physics and Astronomy 1 4%
Unknown 3 13%