↓ Skip to main content

Application and Theory of Petri Nets and Concurrency

Overview of attention for book
Cover of 'Application and Theory of Petri Nets and Concurrency'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Alignment of Formal, Structured and Unstructured Process Descriptions
  3. Altmetric Badge
    Chapter 2 Complexity Made Simple (at a Small Price)
  4. Altmetric Badge
    Chapter 3 Resource Equivalences in Petri Nets
  5. Altmetric Badge
    Chapter 4 Faster Simulation of (Coloured) Petri Nets Using Parallel Computing
  6. Altmetric Badge
    Chapter 5 Evaluating and Improving SIP Non-INVITE Transaction to Alleviate the Losing Race Problem
  7. Altmetric Badge
    Chapter 6 Performance and Replica Consistency Simulation for Quorum-Based NoSQL System Cassandra
  8. Altmetric Badge
    Chapter 7 travis - An Online Tool for the Synthesis and Analysis of Petri Nets with Final States
  9. Altmetric Badge
    Chapter 8 An Integrated Environment for Petri Net Slicing
  10. Altmetric Badge
    Chapter 9 Petri Nets Repository: A Tool to Benchmark and Debug Petri Net Tools
  11. Altmetric Badge
    Chapter 10 Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation
  12. Altmetric Badge
    Chapter 11 Model Checking Concurrency and Causality
  13. Altmetric Badge
    Chapter 12 Weak Observable Liveness and Infinite Games on Finite Graphs
  14. Altmetric Badge
    Chapter 13 The Complexity of Diagnosability and Opacity Verification for Petri Nets
  15. Altmetric Badge
    Chapter 14 Getting the Priorities Right: Saturation for Prioritised Petri Nets
  16. Altmetric Badge
    Chapter 15 Modelling and Evaluation of a Control Room Application
  17. Altmetric Badge
    Chapter 16 On Liveness and Deadlockability in Subclasses of Weighted Petri Nets
  18. Altmetric Badge
    Chapter 17 Restricting Hornets to Support Self-adaptive Systems
  19. Altmetric Badge
    Chapter 18 Synthesis and Analysis of Process Networks by Joint Application of P-graphs and Petri Nets
  20. Altmetric Badge
    Chapter 19 Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets
Attention for Chapter 5: Evaluating and Improving SIP Non-INVITE Transaction to Alleviate the Losing Race Problem
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 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
Evaluating and Improving SIP Non-INVITE Transaction to Alleviate the Losing Race Problem
Chapter number 5
Book title
Application and Theory of Petri Nets and Concurrency
Published by
Springer, Cham, June 2017
DOI 10.1007/978-3-319-57861-3_5
Book ISBNs
978-3-31-957860-6, 978-3-31-957861-3
Authors

Junxian Liu, Lin Liu, Tao Chen

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Computer Science 1 100%