CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMATH Open1134.68456OpenAlexW1737342522MaRDI QIDQ5897501FDOQ5897501

Authors: H. Völzer, Daniele Varacca, Ekkart Kindler 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11539452

Recommendations

• New perspectives on fairness.
• Defining fairness in reactive and concurrent systems
• Fairness and hyperfairness
• Defining liveness
• scientific article; zbMATH DE number 4096758

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (13)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Liveness, Fairness and Impossible Futures
• On fairness and randomness
• Counting branches in trees using games
• New perspectives on fairness.
• Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths
• Fairness and hyperfairness
• Defining fairness in reactive and concurrent systems
• Counterexamples in Probabilistic LTL Model Checking for Markov Chains
• Model checking with fairness assumptions using PAT
• On the limits of refinement-testing for model-checking CSP
• On the definition of favorableness

This page was built for publication: CONCUR 2005 – Concurrency Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897501)