• Publications
  • Influence
Finite-Memory Automata
TLDR
A model of computation dealing with infinite alphabets is proposed. Expand
  • 378
  • 52
  • PDF
Decomposition of Distributed Programs into Communication-Closed Layers
TLDR
The safe decomposition of a distributed program into communication closed layers is suggested as a superstructure of its decomposition into a collection of communicating processes. Expand
  • 221
  • 16
  • PDF
A Proof System for Communicating Sequential Processes
TLDR
An axiomatic proof system is presented for proving partial correctness and absence of deadlock (and failure) of communicating sequential processes. Expand
  • 362
  • 8
Interacting processes: a multiparty approach to coordinated distributed programming
TLDR
In response to the industry's need for coordination, this book represents an approach to the design of coordinated, distributed programs, based on a high-level language, IP. Expand
  • 75
  • 7
Basic simple type theory
  • 83
  • 7
A distributed abstract data type implemented by a probabilistic communication scheme
  • N. Francez, M. Rodeh
  • Computer Science
  • 21st Annual Symposium on Foundations of Computer…
  • 13 October 1980
TLDR
A probabilistic implementation of guard scheduling is suggested, which allows completely distributed symmetric programs. Expand
  • 55
  • 7
Distributed Termination
TLDR
Discussed is a distributed system based on communication among disjoint processes, where each process is capable of achieving a post-condition of its local space in such a way that the conjunction of local post-conditions implies a global post- condition of the whole system. Expand
  • 259
  • 6
  • PDF
Appraising fairness in languages for distributed programming
TLDR
The relations among various languages and models for distributed computation and various possible definitions of fairness are considered. Expand
  • 76
  • 6
Superimposition for Interacting Processes
TLDR
The paper defines an operator for superimposition, in contrast to previous transformational views. Expand
  • 45
  • 5
A Note on Harmony
TLDR
In the proof-theoretic semantics approach to meaning, harmony, requiring a balance between introduction-rules (I-rules) and elimination rules (E- rules) within a meaning conferring natural-deduction proof-system, is a central notion. Expand
  • 49
  • 5
  • PDF