CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452MaRDI QIDQ5897501zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(13)

• scientific article; zbMATH DE number 1008482 (Why is no real title available?)
• scientific article; zbMATH DE number 4037221 (Why is no real title available?)
• On fairness and randomness
• Liveness, Fairness and Impossible Futures
• 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)