D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness: The ethics of concurrent termination. In Proceedings of the 8th ICALP. Lecture Notes in Computer Science, Vol. 115, Springer Verlag, July 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to terminate (in a deadlocked marking) In [35] Howell, Rosier and Yen conducted an exhaustive study of the decidability and complexity of non termination problems for 24 different fairness notions. In particular, they studied the three notions of impartiality, justice and fairness introduced in [51]. An infinite occurrence sequence is impartial if every transition of the net occurs infinitely often in it; it is just if every transition that is enabled almost everywhere along the sequence occurs infinitely often in it; fair infinite occurrence sequences were defined above. The just ....

D. Lehman, A. Pnueli and J. Stavi. Impartiality, justice, and fairness: the ethics of concurrent termination. ICALP '81, LNCS 115, 264--277

....that satisfy both liveness and safety properties. Then, transition systems with no fairness condition are too weak, and we need the framework of fair transition systems . We consider unconditional, weak, and strong fairness (also known as impartiality, justice, and compassion, respectively) LPS81, Eme90, MP92] Within this framework, correct trace based implementation corresponds to fair containment, and correct tree based implementation corresponds to fair simulation [BBLS92, ASB 94, GL94] Hence, it is the complexity of these problems that should be examined when we compare the ....

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness---the ethics of concurrent termination. In Proceedings of the 8th Colloquium on Automata, Programming, and Languages (ICALP), volume 115 of Lecture Notes in Computer Science, pages 264--277, Berlin, July 1981. Springer-Verlag.

....of detecting their presence. We then turn to defining fair containment and fair simulation with respect to concurrent transition systems, and study their complexities too, employing unconditional, weak, and strong fairness (also known as impartiality, justice, and compassion, respectively) LPS81, MP92] The complexity of checking relations between an implementation and a specification of concurrent systems is studied also in [SHRS96] and [Rab92, Rab97] In [Rab92, Rab97] Rabinovich considers a parallel composition of labeled transition systems with silent transitions and hiding of ....

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness -- the ethics of concurrent termination. In Proc. 8th Colloq. on Automata, Programming, and Languages (ICALP), volume 115 of Lecture Notes in Computer Science, pages 264--277. Springer-Verlag, July 1981.

....of detecting their presence. We then turn to defining faircontainment and fair simulation with respect to concurrent transition systems, and study their complexities too, employing unconditional, weak, and strong fairness (also known as impartiality, justice, and compassion, respectively) LPS81, Eme90, MP92] Before saying a little more about the results themselves, we clarify what we feel are the paper s two main contributions. First, it continues the study of implementation specification verification in [Mil80, BGS92, KV96] Unlike these papers, our complexity analysis addresses the ....

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness -- the ethics of concurrent termination. In Proc. 8th Colloq. on Automata, Programming, and Languages (ICALP), volume 115 of Lecture Notes in Computer Science, pages 264--277. Springer-Verlag, July 1981.

....an infinite fair occurrence sequence. In [36] Howell, Rosier and Yen conducted an exhaustive study of the decidability and complexity of non termination problems for 24 different fairness notions. In particular, they studied the three notions of impartiality, justice and fairness introduced in [54]. An infinite occurrence sequence is impartial if every transition of the net occurs infinitely often in it; it is just if every transition that is enabled almost everywhere along the sequence occurs infinitely often in it; fair infinite occurrence sequences were defined 150 J. Esparza, M. ....

Lehman, D., A. Pnueli and J. Stavi: Impartiality, justice, and fairness: the ethics of concurrent termination. ICALP '81, LNCS 115 (1981), 264--277.

....linear time model checking. Once, however, we want our implementations and specifications to describe behaviors that satisfy both liveness and safety properties, modules are too weak. Then, we need the framework of fair modules. We consider unconditional fairness (also known as impartiality) LPS81] Within this framework, correct trace based implementation corresponds to fair containment and correct tree based implementation corresponds to fair simulation [BBLS92, ASB 94, GL94] Hence, it is the complexity of these problems that should be examined when we compare the trace based and ....

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness -- the ethics of concurrent termination. In Proc. 8th Colloq. on Automata, Programming, and Languages (ICALP), volume 115 of Lecture Notes in Computer Science, pages 264--277. SpringerVerlag, July 1981.

....be fair, if we prove that a program satisfies a property under the assumption of fairness, it follows that the property holds for all possible implementations of the program. While the theory of specification and verification using different forms of fairness is well understood (see, for example, [LPS82, Fra86, MP91]) fairness has two major drawbacks. First, the mathematical treatment of fairness, both in verification and in semantics, is complicated and requires higher ordinals. Second, fairness is too weak to yield a suitable model for fault tolerant distributed computing. This is illustrated by the ....

....then its language is regular. Thus, to capture all finite state schedulers that implement F , it suffices to consider the (countable) union of all regular safety properties that are contained in F . There are several popular definitions of F , such as strong fairness, weak fairness, etc. [LPS82, Fra86]. For every choice of F , we obtain its finitary version fin(F ) as the union of all regular safety properties contained in F . In the case of weak fairness F , we show that the finitary version fin(F ) is particularly intuitive: while F prohibits a schedule if it postpones a task forever, fin(F ....

[Article contains additional citation context not shown here]

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness: The ethics of concurrent termination. In Automata, Languages and Programming: Proceedings of the Ninth ICALP, LNCS 115, pages 264--277. Springer-Verlag, 1982.

....and synthesis algorithms that handle fairness assumptions and do not use the automata theoretic approach described above. In this paper we show to the contrary that the automata theoretic approach can handle realizability checking and synthesis under various fairness assumptions (cf. [LPS81]) In the same spirit as in [WTD91] we show that the original specification can be transformed to a constraint on the infinite branches of the strategy tree by a sequence of transformations of automata. The key to these transformations is the closure of the set of regular languages under ....

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness -- the ethic of concurrent termination. In Proc. 8th Colloq. on Automata, Programming, and Languages (ICALP), volume 115 of Lecture Notes in Computer Science, pages 264--277. Springer-Verlag, July 1981.

....that satisfy both liveness and safety properties. Then, transition systems with no fairness condition are too weak and we need the framework of fair transition systems . We consider unconditional, weak, and strong fairness (also known as impartiality, justice, and compassion, respectively) LPS81, Eme90, MP92] Within this framework, correct trace based implementation corresponds to fair containment and correct tree based implementation corresponds to fair simulation [BBLS92, ASB 94, GL94] Hence, it is the complexity of these problems that should be examined when we compare the ....

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness -- the ethic of concurrent termination. In Proc. 8th Colloq. on Automata, Programming, and Languages (ICALP), volume 115 of Lecture Notes in Computer Science, pages 264--277. Springer-Verlag, July 1981.

....modeled as a Kripke structure and the specification as a CTL formula, the modelchecking algorithm can be used to decide whether or not the implementation satisfies the specification. In verifying concurrent systems, we are generally interested only in correctness along the fair computation paths [26]. For example, in a system with two processes, we may wish to consider only those computation sequences in which each process executes infinitely often. Since CTL cannot express correctness along fair paths, Clarke et.al. have defined CTL F by changing the semantics of CTL [12] The syntax of ....

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness: The ethics of concurrent termination. In Automata, Languages and Programming: Proceedings of the Ninth ICALP, Lecture Notes in Computer Science 115, pages 264--277. SpringerVerlag, 1982.

....specifications to describe behaviors that satisfy both liveness and safety properties, transition systems are too weak. Then, we need the framework of fair transition systems. We consider unconditional, weak, and strong fairness (also known as impartiality, justice, and compassion, respectively) LPS81, Eme90, MP92] Within this framework, correct tracebased implementation corresponds to language containment and correct tree based implementation corresponds to fair simulation[BBLS92, ASB 94, GL94] Hence, it is the complexity of these problems that should be examined when we compare the ....

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness -- the ethic of concurrent termination. In Proc. 8th Colloq. on Automata, Programming, and Languages (ICALP), volume 115 of Lecture Notes in Computer Science, pages 264--277. Springer-Verlag, July 1981.

....of detecting their presence. We then turn to defining fair containment and fair simulation with respect to concurrent transition systems, and study their complexities too, employing unconditional, weak, and strong fairness (also known as impartiality, justice, and compassion, respectively) LPS81, MP92] Before saying a little more about the results themselves, we clarify what we feel are the paper s two main contributions. First, it continues the study of implementation verification in [Mil80, BGS92, KV96] Unlike these papers, our complexity analysis addresses the state explosion issue ....

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness -- the ethics of concurrent termination. In Proc. 8th ICALP, LNCS 115, pages 264--277. 1981.

No context found.

D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness: The ethics of concurrent termination. In Proceedings of the 8th ICALP. Lecture Notes in Computer Science, Vol. 115, Springer Verlag, July 1981.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC