Resumen:
Jason is a well-known programming language for multia-gent systems where fine-grained concurrency primitives allow a highly-concurrent efficient execution. However, typical concurrency errors suchas race conditions are hard to avoid. In this chapter, we analyze a numberof such potential pitfalls of the Jason concurrency model, and, describeboth how such risks can be mitigated in Jason itself, as well as discussingthe alternatives implemented in eJason, an experimental extension of Ja-son with support for distribution and fault tolerance. In some cases, wepropose changes in the standard Jason semantics.
Descargas:
Este artículo tiene una licencia de uso CreativeCommons - Reconocimiento (by)
Descarga el artículo haciendo click aquí.
Ver la referencia en formato Bibtex
@inproceedings{prole:2019:019,
title={{Pitfalls of Jason Concurrency}},
author={Álvaro Fern{\'a}ndez D{\'i}az and Clara Benac Earle and Lars-Ake Fredlund},
url={http://hdl.handle.net/11705/PROLE/2019/019},
booktitle={PROLE2019},
year={2019},
publisher={SISTEDES},
crossref={prole2019caceres}
}
@proceedings{prole2019caceres,
title={{Actas de las XIX Jornadas de Programaci{\'o}n y Lenguajes (PROLE 2019)}},
editor={Alpuente, M., Sapi{\~n}a, J. y Rodr{\'i}guez Echeverr{\'i}a, R.},
booktitle={PROLE2019},
year={2019},
publisher={SISTEDES}
}
Copiar al portapapeles |
Cerrar
