Ensuring liveness properties of distributed systems: open problems
From MaRDI portal
Abstract: Often fairness assumptions need to be made in order to establish liveness properties of distributed systems, but in many situations they lead to false conclusions. This document presents a research agenda aiming at laying the foundations of a theory of concurrency that is equipped to ensure liveness properties of distributed systems without making fairness assumptions. This theory will encompass process algebra, temporal logic and semantic models. The agenda also includes the development of a methodology and tools that allow successful application of this theory to the specification, analysis and verification of realistic distributed systems. Contemporary process algebras and temporal logics fail to make distinctions between systems of which one has a crucial liveness property and the other does not, at least when assuming justness, a strong progress property, but not assuming fairness. Setting up an alternative framework involves giving up on identifying strongly bisimilar systems, inventing new induction principles, developing new axiomatic bases for process algebras and new congruence formats for operational semantics, and creating matching treatments of time and probability. Even simple systems like fair schedulers or mutual exclusion protocols cannot be accurately specified in standard process algebras (or Petri nets) in the absence of fairness assumptions. Hence the work involves the study of adequate language or model extensions, and their expressive power.
Recommendations
Cites work
- scientific article; zbMATH DE number 4018370 (Why is no real title available?)
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 3808938 (Why is no real title available?)
- scientific article; zbMATH DE number 3896316 (Why is no real title available?)
- scientific article; zbMATH DE number 3926231 (Why is no real title available?)
- scientific article; zbMATH DE number 3958712 (Why is no real title available?)
- scientific article; zbMATH DE number 3978362 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3735115 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 605806 (Why is no real title available?)
- scientific article; zbMATH DE number 1538045 (Why is no real title available?)
- scientific article; zbMATH DE number 1759617 (Why is no real title available?)
- scientific article; zbMATH DE number 794263 (Why is no real title available?)
- scientific article; zbMATH DE number 1412988 (Why is no real title available?)
- scientific article; zbMATH DE number 7317251 (Why is no real title available?)
- scientific article; zbMATH DE number 3892604 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A Theory of Communicating Sequential Processes
- A fair calculus of communicating systems
- A hierarchy of SOS rule formats
- A process algebra for wireless mesh networks
- A theory of processes with localities
- Algèbre de processus et synchronisation
- Analysing mutual exclusion using process algebra with signals
- Applications of Process Algebra
- Appraising fairness in languages for distributed programming
- Bisimulation and divergence
- Bisimulation can't be traced
- Branching Bisimilarity with Explicit Divergence
- Branching time and abstraction in bisimulation semantics
- CADP 2010: a toolbox for the construction and analysis of distributed processes
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- Characterising Testing Preorders for Finite Probabilistic Processes
- Concurrent systems and inevitability
- Demonic, angelic and unbounded probabilistic choices in sequential programs
- Divergence and fair testing
- Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- Encyclopedia of parallel computing.
- Equivalence and preorder checking for finite-state systems
- FDR3 -- a modern refinement checker for CSP
- Fairness of actions in system computations
- Fairness of components in system computations
- Finite axiom systems for testing preorder and De Simone process languages
- Formal Methods for the Design of Real-Time Systems
- Higher-level synchronising devices in Meije-SCCS
- Justness. A completeness criterion for capturing liveness properties (extended abstract)
- Lean and full congruence formats for recursion
- Liveness of a mutex algorithm in a fair process algebra
- Modeling and analysis of communicating systems
- Models, Languages, and Tools for Concurrent and Distributed Programming
- Modular construction and partial order semantics of Petri nets
- Modular specification of process algebras
- Musings on encodings and expressiveness
- Mutex needs fairness
- Nets, Terms and Formulas
- On characterising distributability
- On cool congruence formats for weak bisimulations
- On the consistency of Koomen's fair abstraction rule
- Ordered SOS process languages for branching and eager bisimulations
- Precongruence formats for decorated trace semantics
- Priority in process algebra.
- Process Algebra
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- Proving the Correctness of Multiprocess Programs
- Psi-calculi: a framework for mobile processes with nominal data and logic
- Refinement of actions and equivalence notions for concurrent systems
- Structural operational semantics for weak bisimulations
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- Structured operational semantics and bisimulation as a congruence
- Testing equivalences for processes
- Testing probabilistic automata
- The -calculus: A theory of mobile processes
- The coarsest precongruences respecting safety and liveness properties
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- The meaning of negative premises in transition system specifications
- Time and Fairness in a Process Algebra with Non-blocking Reading
- Towards a unified approach to encodability and separation results for process calculi
- Transition system specifications with negative premises
- Understanding Petri Nets
- Using branching time temporal logic to synthesize synchronization skeletons
- Weak and strong fairness in CCS
Cited in
(11)- Safety-liveness exclusion in distributed computing
- scientific article; zbMATH DE number 7559462 (Why is no real title available?)
- Polynomial-time optimal liveness enforcement for guidepath-based transport systems
- Preface to the special issue on open problems in concurrency theory
- Modelling mutual exclusion in a process algebra with time-outs
- Just testing
- scientific article; zbMATH DE number 7453963 (Why is no real title available?)
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- scientific article; zbMATH DE number 7350777 (Why is no real title available?)
- On the refinement of liveness properties of distributed systems
- Reactive bisimulation semantics for a process algebra with timeouts
This page was built for publication: Ensuring liveness properties of distributed systems: open problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011206)