Fairness
Can message buffers be axiomatized in linear temporal logic?
Information and Control
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A simple approach to specifying concurrent systems
Communications of the ACM
win and sin: predicate transformers for concurrency
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying concurrent objects as communicating processes
Science of Computer Programming
The existence of refinement mappings
Theoretical Computer Science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
On concurrent programming
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Decentralization of process nets with centralized control
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Fairness and hyperfairness in multi-party interactions
Distributed Computing
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CONCUR 2005 - Concurrency Theory
Generating non-conspiratorial executions
Information Processing Letters
Modeling fairness and starvation in concurrent systems
ACM SIGSOFT Software Engineering Notes
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Specifying and Verifying Event-Based Fairness Enhanced Systems
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Fairness and conspiracy concepts in concurrent systems
ACM SIGSOFT Software Engineering Notes
Information and Computation
Scalable Multi-core Model Checking Fairness Enhanced Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
On combining state space reductions with global fairness assumptions
FM'11 Proceedings of the 17th international conference on Formal methods
State/event-based LTL model checking under parametric generalized fairness
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
On conspiracies and hyperfairness in distributed computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On deadlocks and fairness in self-organizing resource-flow systems
ARCS'10 Proceedings of the 23rd international conference on Architecture of Computing Systems
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
A distributed maximal scheduler for strong fairness
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Relational transducers for declarative networking
Journal of the ACM (JACM)
Model checking with fairness assumptions using PAT
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
The notion of fairness in trace-based formalisms is examined. It is argued that, in general, fairness means machine closure. The notion of hyperfairness introduced by Attie, Francez, and Grumberg is generalized to arbitrary action systems. Also examined are the fairness criteria proposed by Apt, Francez, and Katz.