Progress, justness, and fairness

RV Glabbeek, P Höfner - ACM Computing Surveys (CSUR), 2019 - dl.acm.org
Progress, Justness, and Fairness Page 1 69 Progress, Justness, and Fairness ROB VAN
GLABBEEK and PETER HÖFNER, Data61, CSIRO and UNSW, Australia Fairness assumptions …

[图书][B] Fairness

N Francez - 2012 - books.google.com
The main purpose of this book is to bring together much of the research conducted in recent
years in a subject I find both fascinating and impor tant, namely fairness. Much of the …

Completing the temporal picture

Z Manna, A Pnueli - Theoretical Computer Science, 1991 - Elsevier
The paper presents a relatively complete proof system for proving the validity of temporal
properties of reactive programs. The presented proof system improves on previous temporal …

Fairness and related properties in transition systems—a temporal logic to deal with fairness

JP Queille, J Sifakis - Acta informatica, 1983 - Springer
In this paper we propose a notion of fairness for transition systems and a logic for proving
properties under the fairness assumption corresponding to this notion. We start from an …

Appraising fairness in languages for distributed programming

KR Apt, N Francez, S Katz - Distributed Computing, 1988 - Springer
The relations among various languages and models for distributed computation and various
possible definitions of fairness are considered. Natural semantic criteria are presented …

Fifty years of Hoare's logic

KR Apt, ER Olderog - Formal Aspects of Computing, 2019 - Springer
Fifty years of Hoare’s logic | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Search Cart 1.Home 2.Formal Aspects of …

Bisimulation learning

A Abate, M Giacobbe, Y Schnitzer - International Conference on Computer …, 2024 - Springer
We introduce a data-driven approach to computing finite bisimulations for state transition
systems with very large, possibly infinite state space. Our novel technique computes stutter …

Verification of concurrent programs: The automata-theoretic framework

MY Vardi - Annals of Pure and Applied Logic, 1991 - Elsevier
Vardi, MY, Verification of concurrent programs: the automata-theoretic framework, Annals of
Pure and Applied Logic 51 (1991) 79–98. We present an automata-theoretic framework to …

Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness

D Harel - Journal of the ACM (JACM), 1986 - dl.acm.org
Elementary translations between various kinds of recursive trees are presented. It is shown
that trees of either finite or countably infinite branching can be effectively put into one-one …

Analysis of hybrid systems: An ounce of realism can save an infinity of states

M Fränzle - Computer Science Logic: 13th International Workshop …, 1999 - Springer
Hybrid automata have been introduced in both control engineering and computer science as
a formal model for the dynamics of hybrid discrete-continuous systems. In the case of so …