Interacting processes | Guide books skip to main content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …
L Lamport - Distributed Computing, 2000 - Springer
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 …
This paper considers the potential of using patterns of cooperative interaction to support the development of general design principles drawn from a range of work settings. It reports on …
PR D'Argenio, B Jeannet, HE Jensen… - … Workshop von Process …, 2002 - Springer
We report on new strategies for model checking quantitative reachability properties of Markov decision processes by successive refinements. In our approach, properties are …
Recent development on distributed systems has shown that a variety of fairness constraints (some of which are only recently defined) play vital roles in designing self-stabilizing …
A multipaq interaction is a set of I/0 actions executed jointly by a number of processes, each of which must be ready to execute its own action for any of the actions in the set to occur, An …
H Völzer, D Varacca - Journal of the ACM (JACM), 2012 - dl.acm.org
We define when a linear-time temporal property is a fairness property with respect to a given system. This captures the essence shared by most fairness assumptions that are used in the …
In Petri net theory, a transition is called live if from every reachable marking there starts a computation in which the transition occurs. Another important property of a transition is the …
A man may imagine he understands something, but still not understand anything in the way that he ought to.(Paul of Tarsus, 1 Corinthians 8: 2) Calling this a 'practical theory'may …