Jason is a well-known programming language for multiagent systems where fine-grained concurrency primitives allow a highly-concurrent efficient execution. However, typical concurrency errors such as race conditions are hard to avoid. In this chapter, we analyze a number of such potential pitfalls of the Jason concurrency model, and, describe both how such risks can be mitigated in Jason itself, as well as discussing the alternatives implemented in eJason, an experimental extension of Jason with support for distribution and fault tolerance. In some cases, we propose changes in the standard Jason semantics.
CITATION STYLE
Fernández Díaz, Á., Benac Earle, C., & Fredlund, L. Å. (2019). Pitfalls of Jason Concurrency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11375 LNAI, pp. 19–33). Springer Verlag. https://doi.org/10.1007/978-3-030-25693-7_2
Mendeley helps you to discover research relevant for your work.