5 Result(s)
within
Uri Abraham
Computer Science
-
Chapter and Conference Paper
On the Mailbox Problem
The Mailbox Problem was described and solved by Aguilera, Gafni, and Lamport in [2] with a mailbox algorithm that uses two flag registers that carry 14 values each. An interesting question that they ask is whe...
-
Chapter and Conference Paper
On a Decidable Formal Theory for Abstract Continuous-Time Dynamical Systems
We propose a decidable formal theory which describes high-level properties of abstract continuous-time dynamical systems called Nondeterministic Complete Markovian Systems (NCMS). NCMS is a rather general clas...
-
Article
On system executions and states
An approach for modeling dynamic situations where several processes execute concurrently is described. Using the concepts “system execution” and “pomset” defined by Lamport and Gischer, we address basic issues...
-
Chapter and Conference Paper
On the limitation of the global time assumption in distributed systems
An ongoing debate among theoreticians of distributed systems concerns the global time issue. The basic question seems to be to what extent does a model with global time reflect the ‘real’ behavior of a distrib...
-
Chapter and Conference Paper
On Global-Time and Inter-process Communication
How should time be represented in models for inter-process communication? The global-time axiom implies that all events can be represented by intervals on one time-axis. Its use simplifies the analysis of prot...
