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 …
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 …
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 …
The relations among various languages and models for distributed computation and various possible definitions of fairness are considered. Natural semantic criteria are presented …
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 …
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 …
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 …
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 …
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 …