Article
Generating non-conspiratorial executions
Author/s | Ruiz Cortés, David
![]() ![]() ![]() ![]() ![]() ![]() ![]() Corchuelo Gil, Rafael ![]() ![]() ![]() ![]() ![]() ![]() ![]() Arjona Fernández, José Luis |
Department | Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos |
Publication Date | 2007 |
Deposit Date | 2017-11-23 |
Published in |
|
Abstract | Avoiding conspiratorial executions is useful for debugging, model checking or refinement, and helps implement several wellknown
problems in faulty environments; furthermore, avoiding non-equivalence robust executions ... Avoiding conspiratorial executions is useful for debugging, model checking or refinement, and helps implement several wellknown problems in faulty environments; furthermore, avoiding non-equivalence robust executions prevents conflicting observations in a distributed setting from occurring. Our results prove that scheduling pairs of states and transitions in a strongly fair manner suf-fices to prevent conspiratorial executions; we then establish a formal connection between conspiracies and equivalence robustness; finally, we present a transformation scheme to implement our results and show how to build them into a well-known distributed scheduler. Previous results were applicable to a subset of systems only, just attempted to characterise potential conspiracies, or were tightly bound up with a particular interaction model. |
Funding agencies | Comisión Interministerial de Ciencia y Tecnología (CICYT). España |
Project ID. | TIC2003-02737-C02-01
![]() |
Citation | Ruiz Cortés, D., Corchuelo Gil, R. y Arjona Fernández, J.L. (2007). Generating non-conspiratorial executions. Information Processing Letters, 103 (4), 157-162. |
Files | Size | Format | View | Description |
---|---|---|---|---|
Generating non-conspiratorial.pdf | 277.4Kb | ![]() | View/ | |