var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Flazkany.bitbucket.io%2Fpublication.bib&jsonp=1&css=assets/css/default.css&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Flazkany.bitbucket.io%2Fpublication.bib&jsonp=1&css=assets/css/default.css\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Flazkany.bitbucket.io%2Fpublication.bib&jsonp=1&css=assets/css/default.css\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2023\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Language Support for Verifying Reconfigurable Interacting Systems.\n \n \n \n\n\n \n Abd Alrahman, Y.; Azzopardi, S.; Di Stefano, L.; and Piterman, N.\n\n\n \n\n\n\n International Journal on Software Tools for Technology Transfer. 2023.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{sttt2023a,\n  title = {Language Support for Verifying Reconfigurable Interacting Systems},\n  author = {Abd Alrahman, Yehia and Azzopardi, Shaun and Di Stefano, Luca and Piterman, Nir},\n  journal   = {International Journal on Software Tools for Technology Transfer},\n  year =  {2023},\n  doi = {10.1007/s10009-023-00729-8},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Correct-by-Design Teamwork Plans for Multi-Agent Systems.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; and Piterman, N.\n\n\n \n\n\n\n CoRR, abs/2301.01257. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Correct-by-DesignPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2301-01257,\n  author    = {Yehia {Abd Alrahman} and\n               Nir Piterman},\n  title     = {Correct-by-Design Teamwork Plans for Multi-Agent Systems},\n  journal   = {CoRR},\n  volume    = {abs/2301.01257},\n  year      = {2023},\n  url       = {https://doi.org/10.48550/arXiv.2301.01257},\n  doi       = {10.48550/arXiv.2301.01257},\n  eprinttype = {arXiv},\n  eprint    = {2301.01257}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A PO Characterisation of Reconfiguration.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; Martel, M.; and Piterman, N.\n\n\n \n\n\n\n In Seidl, H.; Liu, Z.; and Pasareanu, C. S., editor(s), Theoretical Aspects of Computing – ICTAC 2022, pages 42–59, Cham, 2022. Springer International Publishing\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{10.1007/978-3-031-17715-6_5,\nauthor="{Abd Alrahman}, Yehia\nand Martel, Mauricio\nand Piterman, Nir",\neditor="Seidl, Helmut\nand Liu, Zhiming\nand Pasareanu, Corina S.",\ntitle="A PO Characterisation of Reconfiguration",\nbooktitle="Theoretical Aspects of Computing -- ICTAC 2022",\nyear="2022",\npublisher="Springer International Publishing",\naddress="Cham",\npages="42--59",\nabstract="We consider partial order semantics of concurrent systems in which local reconfigurations may have global side effects. That is, local changes happening to an entity may block or unblock events relating to others, namely, events in which the entity does not participate. We show that partial order computations need to capture additional restrictions about event ordering, i.e., restrictions that arise from such reconfigurations. This introduces ambiguity where different partial orders represent exactly the same events with the same participants happening in different orders, thus defeating the purpose of using partial order semantics. To remove this ambiguity, we suggest an extension of partial orders called glued partial orders. We show that glued partial orders capture all possible forced reordering arising from said reconfigurations. Furthermore, we show that computations belonging to different glued partial orders are only different due to non-determinism. We consider channeled transition systems and Petri-nets with inhibiting arcs as examples.",\nisbn="978-3-031-17715-6",\nurl       = {https://link.springer.com/chapter/10.1007/978-3-031-17715-6_5}\n}\n\n\n
\n
\n\n\n
\n We consider partial order semantics of concurrent systems in which local reconfigurations may have global side effects. That is, local changes happening to an entity may block or unblock events relating to others, namely, events in which the entity does not participate. We show that partial order computations need to capture additional restrictions about event ordering, i.e., restrictions that arise from such reconfigurations. This introduces ambiguity where different partial orders represent exactly the same events with the same participants happening in different orders, thus defeating the purpose of using partial order semantics. To remove this ambiguity, we suggest an extension of partial orders called glued partial orders. We show that glued partial orders capture all possible forced reordering arising from said reconfigurations. Furthermore, we show that computations belonging to different glued partial orders are only different due to non-determinism. We consider channeled transition systems and Petri-nets with inhibiting arcs as examples.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n R-CHECK: A Model Checker for Verifying Reconfigurable MAS.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; Azzopardi, S.; and Piterman, N.\n\n\n \n\n\n\n In Faliszewski, P.; Mascardi, V.; Pelachaud, C.; and Taylor, M. E., editor(s), 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, Auckland, New Zewland, May 9-13, 2022, pages 1518–1520, 2022. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS,ACM)\n \n\n\n\n
\n\n\n\n \n \n \"R-CHECK:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/atal/AlrahmanAP22,\n  author    = {Yehia {Abd Alrahman} and\n               Shaun Azzopardi and\n               Nir Piterman},\n  editor    = {Piotr Faliszewski and\n               Viviana Mascardi and\n               Catherine Pelachaud and\n               Matthew E. Taylor},\n  title     = {{R-CHECK:} {A} Model Checker for Verifying Reconfigurable {MAS}},\n  booktitle = {21st International Conference on Autonomous Agents and Multiagent\n               Systems, {AAMAS} 2022, Auckland, New Zewland, May 9-13, 2022},\n  pages     = {1518--1520},\n  publisher = {International Foundation for Autonomous Agents and Multiagent Systems\n               {(IFAAMAS,ACM)}},\n  year      = {2022},\n  url       = {https://dl.acm.org/doi/abs/10.5555/3535850.3536020},\n  abstract  = {Reconfigurable multi-agent systems consist of a set of autonomous agents, with integrated interaction capabilities that feature oppor- tunistic interaction. Agents seemingly reconfigure their interactions interfaces by forming collectives, and interact based on mutual in- terests. Finding ways to design and analyse the behaviour of these systems is a vigorously pursued research goal. We propose a model checker, named R-CHECK, to allow reasoning about these systems both from an individual- and a system- level. R-CHECK also permits reasoning about interaction protocols and joint missions. R-CHECK supports a high-level input language with symbolic semantics, and provides a modelling convenience for interaction features such as reconfiguration, coalition formation, self-organisation, etc.}\n}\n
\n
\n\n\n
\n Reconfigurable multi-agent systems consist of a set of autonomous agents, with integrated interaction capabilities that feature oppor- tunistic interaction. Agents seemingly reconfigure their interactions interfaces by forming collectives, and interact based on mutual in- terests. Finding ways to design and analyse the behaviour of these systems is a vigorously pursued research goal. We propose a model checker, named R-CHECK, to allow reasoning about these systems both from an individual- and a system- level. R-CHECK also permits reasoning about interaction protocols and joint missions. R-CHECK supports a high-level input language with symbolic semantics, and provides a modelling convenience for interaction features such as reconfiguration, coalition formation, self-organisation, etc.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Model Checking Reconfigurable Interacting Systems.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; Azzopardi, S.; and Piterman, N.\n\n\n \n\n\n\n In Margaria, T.; and Steffen, B., editor(s), Leveraging Applications of Formal Methods, Verification and Validation. Adaptation and Learning, pages 373–389, Cham, 2022. Springer Nature Switzerland\n \n\n\n\n
\n\n\n\n \n \n \"ModelPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{10.1007/978-3-031-19759-8_23,\nauthor="Abd Alrahman, Yehia\nand Azzopardi, Shaun\nand Piterman, Nir",\neditor="Margaria, Tiziana\nand Steffen, Bernhard",\ntitle="Model Checking Reconfigurable Interacting Systems",\nbooktitle="Leveraging Applications of Formal Methods, Verification and Validation. Adaptation and Learning",\nyear="2022",\npublisher="Springer Nature Switzerland",\naddress="Cham",\npages="373--389",\nabstract="Reconfigurable multi-agent systems consist of a set of autonomous agents, with integrated interaction capabilities that feature opportunistic interaction. Agents seemingly reconfigure their interactions interfaces by forming collectives, and interact based on mutual interests. Finding ways to design and analyse the behaviour of these systems is a vigorously pursued research goal. We propose a model checker, named R-CHECK (Find the associated toolkit repository here: https://github.com/dsynma/recipe.), to allow reasoning about these systems both from an individual- and a system- level. R-CHECK also permits reasoning about interaction protocols and joint missions. R-CHECK supports a high-level input language with symbolic semantics, and provides a modelling convenience for interaction features such as reconfiguration, coalition formation, and self-organisation.",\nisbn="978-3-031-19759-8",\nurl={https://link.springer.com/chapter/10.1007/978-3-031-19759-8_23}\n}\n\n
\n
\n\n\n
\n Reconfigurable multi-agent systems consist of a set of autonomous agents, with integrated interaction capabilities that feature opportunistic interaction. Agents seemingly reconfigure their interactions interfaces by forming collectives, and interact based on mutual interests. Finding ways to design and analyse the behaviour of these systems is a vigorously pursued research goal. We propose a model checker, named R-CHECK (Find the associated toolkit repository here: https://github.com/dsynma/recipe.), to allow reasoning about these systems both from an individual- and a system- level. R-CHECK also permits reasoning about interaction protocols and joint missions. R-CHECK supports a high-level input language with symbolic semantics, and provides a modelling convenience for interaction features such as reconfiguration, coalition formation, and self-organisation.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Modelling and verification of reconfigurable multi-agent systems.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; and Piterman, N.\n\n\n \n\n\n\n Autonomous Agents and Multi Agent Systems, 35(2): 47. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ModellingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{AlrahmanP21,\n  author    = {Yehia {Abd Alrahman} and\n               Nir Piterman},\n  title     = {Modelling and verification of reconfigurable multi-agent systems},\n  journal   = {Autonomous Agents and Multi Agent Systems},\n  volume    = {35},\n  number    = {2},\n  pages     = {47},\n  year      = {2021},\n  url       = {https://doi.org/10.1007/s10458-021-09521-x},\n  doi       = {10.1007/s10458-021-09521-x},\n  abstract  = {We propose a formalism to model and reason about reconfigurable multi-agent systems. In our formalism, agents interact and communicate in different modes so that they can pursue joint tasks; agents may dynamically synchronize, exchange data, adapt their behaviour, and reconfigure their communication interfaces. Inspired by existing multi-robot systems, we represent a system as a set of agents (each with local state), executing independently and only influence each other by means of message exchange. Agents are able to sense their local states and partially their surroundings. We extend LTL to be able to reason explicitly about the intentions of agents in the interaction and their communication protocols. We also study the complexity of satisfiability and model-checking of this extension.}\n}\n
\n
\n\n\n
\n We propose a formalism to model and reason about reconfigurable multi-agent systems. In our formalism, agents interact and communicate in different modes so that they can pursue joint tasks; agents may dynamically synchronize, exchange data, adapt their behaviour, and reconfigure their communication interfaces. Inspired by existing multi-robot systems, we represent a system as a set of agents (each with local state), executing independently and only influence each other by means of message exchange. Agents are able to sense their local states and partially their surroundings. We extend LTL to be able to reason explicitly about the intentions of agents in the interaction and their communication protocols. We also study the complexity of satisfiability and model-checking of this extension.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Synthesis of Run-To-Completion Controllers for Discrete Event Systems.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; Braberman, V. A.; D'Ippolito, N.; Piterman, N.; and Uchitel, S.\n\n\n \n\n\n\n In 2021 American Control Conference, ACC 2021, New Orleans, LA, USA, May 25-28, 2021, pages 4892–4899, 2021. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"SynthesisPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{acc,\n  author    = {Yehia {Abd Alrahman} and\n               V{\\'{\\i}}ctor A. Braberman and\n               Nicol{\\'{a}}s D'Ippolito and\n               Nir Piterman and\n               Sebasti{\\'{a}}n Uchitel},\n  title     = {Synthesis of Run-To-Completion Controllers for Discrete Event Systems},\n  booktitle = {2021 American Control Conference, {ACC} 2021, New Orleans, LA, USA,\n               May 25-28, 2021},\n  pages     = {4892--4899},\n  publisher = {{IEEE}},\n  year      = {2021},\n  url       = {https://doi.org/10.23919/ACC50511.2021.9482704},\n  doi       = {10.23919/ACC50511.2021.9482704},\n abstract  = {A controller for a Discrete Event System must achieve its goals despite that its environment being capable of resolving race conditions between controlled and uncontrolled events.Assuming that the controller loses all races is sometimes unrealistic. In many cases, a realistic assumption is that the controller sometimes wins races and is fast enough to perform multiple actions without being interrupted. However, in order to model this scenario using control of DES requires introducing foreign assumptions about scheduling, that are hard to figure out correctly. We propose a more balanced control problem, named run-to-completion (RTC), to alleviate this issue. RTC naturally supports an execution assumption in which both the controller and the environment are guaranteed to initiate and perform sequences of actions, without flooding or delaying each other indefinitely. We consider control of DES in the context where specifications are given in the form of linear temporal logic. We formalize the RTC control problem and show how it can be reduced to a standard control problem.}\n}\n\n
\n
\n\n\n
\n A controller for a Discrete Event System must achieve its goals despite that its environment being capable of resolving race conditions between controlled and uncontrolled events.Assuming that the controller loses all races is sometimes unrealistic. In many cases, a realistic assumption is that the controller sometimes wins races and is fast enough to perform multiple actions without being interrupted. However, in order to model this scenario using control of DES requires introducing foreign assumptions about scheduling, that are hard to figure out correctly. We propose a more balanced control problem, named run-to-completion (RTC), to alleviate this issue. RTC naturally supports an execution assumption in which both the controller and the environment are guaranteed to initiate and perform sequences of actions, without flooding or delaying each other indefinitely. We consider control of DES in the context where specifications are given in the form of linear temporal logic. We formalize the RTC control problem and show how it can be reduced to a standard control problem.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Reconfigurable Interaction for MAS Modelling.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; Perelli, G.; and Piterman, N.\n\n\n \n\n\n\n In Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, of AAMAS '20, pages 7-15, Richland, SC, 2020. International Foundation for Autonomous Agents and Multiagent Systems\n \n\n\n\n
\n\n\n\n \n \n \"ReconfigurablePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 29 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{rcp,\n  author    = {Abd Alrahman, Yehia and Perelli, Giuseppe and Piterman, Nir},\n  title     = {Reconfigurable Interaction for MAS Modelling},\n  year      = {2020},\n  isbn      = {9781450375184},\n  publisher = {International Foundation for Autonomous Agents and Multiagent Systems},\n  address   = {Richland, SC},\n  booktitle = {Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems},\n  pages     = {7-15},\n  numpages  = {9},\n  keywords  = {verification of multi-agent systems, logics for agent reasoning, agent theories and models},\n  location  = {Auckland, New Zealand},\n  series    = {AAMAS '20},\n  url       = {https://dl.acm.org/doi/abs/10.5555/3398761.3398768},\n  abstract  = {We propose a formalism to model and reason about multi- agent systems. We allow agents to interact and communicate in different modes so that they can pursue joint tasks; agents may dynamically synchronize, exchange data, adapt their behaviour, and reconfigure their communication interfaces. The formalism defines a local behaviour based on shared variables and a global one based on message passing. We extend LTL to be able to reason explicitly about the intentions of the different agents and their interaction protocols. We also study the complexity of satisfiability and model-checking of this extension.}\n}\n\n
\n
\n\n\n
\n We propose a formalism to model and reason about multi- agent systems. We allow agents to interact and communicate in different modes so that they can pursue joint tasks; agents may dynamically synchronize, exchange data, adapt their behaviour, and reconfigure their communication interfaces. The formalism defines a local behaviour based on shared variables and a global one based on message passing. We extend LTL to be able to reason explicitly about the intentions of the different agents and their interaction protocols. We also study the complexity of satisfiability and model-checking of this extension.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A distributed API for coordinating AbC programs.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; and Garbi, G.\n\n\n \n\n\n\n International Journal on Software Tools for Technology Transfer. feb 2020.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{Abd_Alrahman_2020,\n  doi       = {10.1007/s10009-020-00553-4},\n  url       = {https://doi.org/10.1007%2Fs10009-020-00553-4},\n  year      = {2020},\n  month     = {feb},\n  publisher = {Springer Science and Business Media {LLC}},\n  author    = {Yehia {Abd Alrahman} and Giulio Garbi},\n  title     = {A distributed {API} for coordinating {AbC} programs},\n  journal   = {International Journal on Software Tools for Technology Transfer},\n  abstract  = {Collective-adaptive systems exhibit a particular notion of interaction where environmental conditions largely influence interactions. Previously, we pro- posed a calculus, named AbC, to model and reason about CAS. The calculus proved to be effective by naturally modelling essential CAS features. However, the question on the tradeoff between its expressiveness and its efficiency, when implemented to program CAS applications, is to be answered. In this article, we propose an efficient and distributed coordination infrastructure for AbC. We prove its correctness and we evaluate its performance. The main novelty of our approach is that AbC components are infrastructure agnostic. Thus the code of a component does not specify how messages are routed in the infrastructure but rather what properties a target component must satisfy. We also developed a Go API, named GoAt, and an Eclipse plugin to pro- gram in a high-level syntax which can be automatically used to generate matching Go code. We showcase our development through a non-trivial case study.}\n}\n\n
\n
\n\n\n
\n Collective-adaptive systems exhibit a particular notion of interaction where environmental conditions largely influence interactions. Previously, we pro- posed a calculus, named AbC, to model and reason about CAS. The calculus proved to be effective by naturally modelling essential CAS features. However, the question on the tradeoff between its expressiveness and its efficiency, when implemented to program CAS applications, is to be answered. In this article, we propose an efficient and distributed coordination infrastructure for AbC. We prove its correctness and we evaluate its performance. The main novelty of our approach is that AbC components are infrastructure agnostic. Thus the code of a component does not specify how messages are routed in the infrastructure but rather what properties a target component must satisfy. We also developed a Go API, named GoAt, and an Eclipse plugin to pro- gram in a high-level syntax which can be automatically used to generate matching Go code. We showcase our development through a non-trivial case study.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Programming interactions in collective adaptive systems by relying on attribute-based communication.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; De Nicola, R.; and Loreti, M.\n\n\n \n\n\n\n Sci. Comput. Program., 192: 102428. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"ProgrammingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:article/scp/AlrahmanNL20,\n  author   = {Yehia {Abd Alrahman} and\n               Rocco {De Nicola} and\n               Michele Loreti},\n  title    = {Programming interactions in collective adaptive systems by relying\n               on attribute-based communication},\n  journal  = {Sci. Comput. Program.},\n  volume   = {192},\n  pages    = {102428},\n  year     = {2020},\n  url      = {https://doi.org/10.1016/j.scico.2020.102428},\n  doi      = {10.1016/j.scico.2020.102428},\n  abstract = {Collective adaptive systems are new emerging computational systems consisting of a large number of interacting components and featuring complex behaviour. These systems are usually distributed, heterogeneous, decentralised and interdependent, and are operating in dynamic and possibly unpredictable environments. Finding ways to understand and design these systems and, most of all, to model the interactions of their components, is a difficult but important endeavour. In this article we propose a language-based approach for programming the interactions of collective-adaptive systems by relying on attribute-based communication; a paradigm that permits a group of partners to communicate by considering their run-time properties and capabilities. We introduce AbC, a foundational calculus for attribute-based communication and show how its linguistic primitives can be used to program a complex and sophisticated variant of the well-known problem of Stable Allocation in Content Delivery Networks. Also other interesting case studies, from the realm of collective-adaptive systems, are considered. We also illustrate the expressive power of attribute-based communication by showing the natural encoding of other existing communication paradigms into AbC.}\n}\n\n\n\n
\n
\n\n\n
\n Collective adaptive systems are new emerging computational systems consisting of a large number of interacting components and featuring complex behaviour. These systems are usually distributed, heterogeneous, decentralised and interdependent, and are operating in dynamic and possibly unpredictable environments. Finding ways to understand and design these systems and, most of all, to model the interactions of their components, is a difficult but important endeavour. In this article we propose a language-based approach for programming the interactions of collective-adaptive systems by relying on attribute-based communication; a paradigm that permits a group of partners to communicate by considering their run-time properties and capabilities. We introduce AbC, a foundational calculus for attribute-based communication and show how its linguistic primitives can be used to program a complex and sophisticated variant of the well-known problem of Stable Allocation in Content Delivery Networks. Also other interesting case studies, from the realm of collective-adaptive systems, are considered. We also illustrate the expressive power of attribute-based communication by showing the natural encoding of other existing communication paradigms into AbC.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A calculus for collective-adaptive systems and its behavioural theory.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; De Nicola, R.; and Loreti, M.\n\n\n \n\n\n\n Inf. Comput., 268. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:article/iandc/AlrahmanNL19,\n  author   = {Yehia {Abd Alrahman} and\n               Rocco {De Nicola} and\n               Michele Loreti},\n  title    = {A calculus for collective-adaptive systems and its behavioural theory},\n  journal  = {Inf. Comput.},\n  volume   = {268},\n  year     = {2019},\n  url      = {https://doi.org/10.1016/j.ic.2019.104457},\n  doi      = {10.1016/j.ic.2019.104457},\n  abstract = {We propose a process calculus, named AbC, to study the behavioural theory of interactions in collective-adaptive systems by relying on attribute-based communication. An AbC system consists of a set of parallel components each of which is equipped with a set of attributes. Communication takes place in an implicit multicast fashion, and interaction among components is dynamically established by taking into account connections as determined by predicates over their attributes. The structural operational semantics of AbC is based on Labelled Transition Systems that are also used to define bisimilarity between components. Labelled bisimilarity is in full agreement with a barbed congruence, defined by relying on simple basic observables and context closure. The introduced equivalence is used to study the expressiveness of AbC in terms of encoding aspects of broadcast channel-based interactions and to establish formal relationships between system descriptions at different levels of abstraction.}\n}\n\n\n\n
\n
\n\n\n
\n We propose a process calculus, named AbC, to study the behavioural theory of interactions in collective-adaptive systems by relying on attribute-based communication. An AbC system consists of a set of parallel components each of which is equipped with a set of attributes. Communication takes place in an implicit multicast fashion, and interaction among components is dynamically established by taking into account connections as determined by predicates over their attributes. The structural operational semantics of AbC is based on Labelled Transition Systems that are also used to define bisimilarity between components. Labelled bisimilarity is in full agreement with a barbed congruence, defined by relying on simple basic observables and context closure. The introduced equivalence is used to study the expressiveness of AbC in terms of encoding aspects of broadcast channel-based interactions and to establish formal relationships between system descriptions at different levels of abstraction.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A coordination protocol language for power grid operation control.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; and Vieira, H. T.\n\n\n \n\n\n\n J. Log. Algebraic Methods Program., 109. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:article/jlap/AlrahmanV19,\n  author   = {Yehia {Abd Alrahman} and\n               Hugo Torres Vieira},\n  title    = {A coordination protocol language for power grid operation control},\n  journal  = {J. Log. Algebraic Methods Program.},\n  volume   = {109},\n  year     = {2019},\n  url      = {https://doi.org/10.1016/j.jlamp.2019.100487},\n  doi      = {10.1016/j.jlamp.2019.100487},\n  abstract = {Future power distribution grids will comprise a large number of components, each potentially able to carry out operations autonomously. Clearly, in order to ensure safe operation of the grid, individual operations must be coordinated among the different components. Since operation safety is a global property, modelling component coordination typically involves reasoning about systems at a global level. In this paper, we propose a language for specifying grid operation control protocols from a global point of view. In our model, operation control is yielded in communications driven by both the grid topology and by state-based information, features captured by novel language principles previously unexplored. We show how the global specifications can be used to automatically generate local controllers of individual components, and that the distributed implementation yielded by such controllers operationally corresponds to the global specification. We showcase our development by modelling a fault management scenario in power grids.}\n}\n\n\n\n
\n
\n\n\n
\n Future power distribution grids will comprise a large number of components, each potentially able to carry out operations autonomously. Clearly, in order to ensure safe operation of the grid, individual operations must be coordinated among the different components. Since operation safety is a global property, modelling component coordination typically involves reasoning about systems at a global level. In this paper, we propose a language for specifying grid operation control protocols from a global point of view. In our model, operation control is yielded in communications driven by both the grid topology and by state-based information, features captured by novel language principles previously unexplored. We show how the global specifications can be used to automatically generate local controllers of individual components, and that the distributed implementation yielded by such controllers operationally corresponds to the global specification. We showcase our development by modelling a fault management scenario in power grids.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing for Coordination Fidelity.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; Mezzina, C. A.; and Vieira, H. T.\n\n\n \n\n\n\n In Boreale, M.; Corradini, F.; Loreti, M.; and Pugliese, R., editor(s), Models, Languages, and Tools for Concurrent and Distributed Programming - Essays Dedicated to Rocco De Nicola on the Occasion of His 65th Birthday, volume 11665, of Lecture Notes in Computer Science, pages 152-169, 2019. Springer\n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/birthday/AlrahmanMV19,\n  author    = {Yehia {Abd Alrahman} and\n               Claudio Antares Mezzina and\n               Hugo Torres Vieira},\n  editor    = {Michele Boreale and\n               Flavio Corradini and\n               Michele Loreti and\n               Rosario Pugliese},\n  title     = {Testing for Coordination Fidelity},\n  booktitle = {Models, Languages, and Tools for Concurrent and Distributed Programming\n               - Essays Dedicated to Rocco De Nicola on the Occasion of His 65th\n               Birthday},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {11665},\n  pages     = {152-169},\n  publisher = {Springer},\n  year      = {2019},\n  url       = {https://doi.org/10.1007/978-3-030-21485-2\\_10},\n  doi       = {10.1007/978-3-030-21485-2\\_10},\n  abstract  = {Operation control in modern distributed systems must rely on decentralised coordination among system participants. In particular when the operation control involves critical infrastructures such as power grids, it is vital to ensure correctness properties of such coordination mechanisms. In this paper, we present a verification technique that addresses coordination protocols for power grid operation control. Given a global protocol specification, we show how we can rely on testing semantics for the purpose of ensuring protocol fidelity, i.e., to certify that the interaction among the grid nodes follows the protocol specification.}\n}\n\n\n\n\n\n\n
\n
\n\n\n
\n Operation control in modern distributed systems must rely on decentralised coordination among system participants. In particular when the operation control involves critical infrastructures such as power grids, it is vital to ensure correctness properties of such coordination mechanisms. In this paper, we present a verification technique that addresses coordination protocols for power grid operation control. Given a global protocol specification, we show how we can rely on testing semantics for the purpose of ensuring protocol fidelity, i.e., to certify that the interaction among the grid nodes follows the protocol specification.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Distributed Coordination Infrastructure for Attribute-Based Interaction.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; De Nicola, R.; Garbi, G.; and Loreti, M.\n\n\n \n\n\n\n In Baier, C.; and Caires, L., editor(s), Formal Techniques for Distributed Objects, Components, and Systems - 38th IFIP WG 6.1 International Conference, FORTE 2018, Held as Part of the 13th International Federated Conference on Distributed Computing Techniques, DisCoTec 2018, Madrid, Spain, June 18-21, 2018, Proceedings, volume 10854, of Lecture Notes in Computer Science, pages 1-20, 2018. Springer\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/forte/AlrahmanNGL18,\n  author    = {Yehia {Abd Alrahman} and\n               Rocco {De Nicola} and\n               Giulio Garbi and\n               Michele Loreti},\n  editor    = {Christel Baier and\n               Lu{\\'{\\i}}s Caires},\n  title     = {A Distributed Coordination Infrastructure for Attribute-Based Interaction},\n  booktitle = {Formal Techniques for Distributed Objects, Components, and Systems\n               - 38th {IFIP} {WG} 6.1 International Conference, {FORTE} 2018, Held\n               as Part of the 13th International Federated Conference on Distributed\n               Computing Techniques, DisCoTec 2018, Madrid, Spain, June 18-21, 2018,\n               Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {10854},\n  pages     = {1-20},\n  publisher = {Springer},\n  year      = {2018},\n  url       = {https://doi.org/10.1007/978-3-319-92612-4\\_1},\n  doi       = {10.1007/978-3-319-92612-4\\_1},\n  abstract  = {Collective-adaptive systems offer an interesting notion of interaction where run-time contextual data are the driving force for interaction. The attribute-based interaction has been proposed as a foundational theoretical framework to model CAS interactions. The framework permits a group of partners to interact by considering their run-time properties and their environment. In this paper, we lay the basis for an efficient, correct, and distributed implementation of the attribute-based interaction framework. First, we present three coordination infrastructures for message exchange, then we prove their correctness, and finally we model them in terms of stochastic processes to evaluate their performance.}\n}\n\n\n\n
\n
\n\n\n
\n Collective-adaptive systems offer an interesting notion of interaction where run-time contextual data are the driving force for interaction. The attribute-based interaction has been proposed as a foundational theoretical framework to model CAS interactions. The framework permits a group of partners to interact by considering their run-time properties and their environment. In this paper, we lay the basis for an efficient, correct, and distributed implementation of the attribute-based interaction framework. First, we present three coordination infrastructures for message exchange, then we prove their correctness, and finally we model them in terms of stochastic processes to evaluate their performance.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n GoAt: Attribute-Based Interaction in Google Go.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; De Nicola, R.; and Garbi, G.\n\n\n \n\n\n\n In Margaria, T.; and Steffen, B., editor(s), Leveraging Applications of Formal Methods, Verification and Validation. Distributed Systems - 8th International Symposium, ISoLA 2018, Limassol, Cyprus, November 5-9, 2018, Proceedings, Part III, volume 11246, of Lecture Notes in Computer Science, pages 288-303, 2018. Springer\n \n\n\n\n
\n\n\n\n \n \n \"GoAt:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/isola/AlrahmanNG18,\n  author    = {Yehia {Abd Alrahman} and\n               Rocco {De Nicola} and\n               Giulio Garbi},\n  editor    = {Tiziana Margaria and\n               Bernhard Steffen},\n  title     = {GoAt: Attribute-Based Interaction in Google Go},\n  booktitle = {Leveraging Applications of Formal Methods, Verification and Validation.\n               Distributed Systems - 8th International Symposium, ISoLA 2018, Limassol,\n               Cyprus, November 5-9, 2018, Proceedings, Part {III}},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {11246},\n  pages     = {288-303},\n  publisher = {Springer},\n  year      = {2018},\n  url       = {https://doi.org/10.1007/978-3-030-03424-5\\_19},\n  doi       = {10.1007/978-3-030-03424-5\\_19},\n  abstract  = {The attribute-based interaction paradigm has been proposed as an appropriate tool to program the interactions of Collective Adaptive Systems where a group of components can interact according to their run-time properties and the environment they operate in. It has been shown that the novel paradigm is very expressive by means of encoding other well-known interaction paradigms. However, the question on the tradeoff between its expressiveness and its efficiency, when implemented to program distributed and collective systems, is still to be answered. In a previous work, we proposed three distributed communication infrastructures to handle message exchange for the attribute-based paradigm and we proved their correctness. In this paper, we describe an actual implementation of these infrastructures in Google Go. We describe an attribute-based programming API, named GoAt , that is parametric with respect to the infrastructure that mediates the interaction between components and an Eclipse plugin for GoAt to program in a high-level syntax which can be automatically used to generate formally verifiable Go code. Finally, we discuss the performance of the API by considering a non-trivial case study.}\n}\n\n\n
\n
\n\n\n
\n The attribute-based interaction paradigm has been proposed as an appropriate tool to program the interactions of Collective Adaptive Systems where a group of components can interact according to their run-time properties and the environment they operate in. It has been shown that the novel paradigm is very expressive by means of encoding other well-known interaction paradigms. However, the question on the tradeoff between its expressiveness and its efficiency, when implemented to program distributed and collective systems, is still to be answered. In a previous work, we proposed three distributed communication infrastructures to handle message exchange for the attribute-based paradigm and we proved their correctness. In this paper, we describe an actual implementation of these infrastructures in Google Go. We describe an attribute-based programming API, named GoAt , that is parametric with respect to the infrastructure that mediates the interaction between components and an Eclipse plugin for GoAt to program in a high-level syntax which can be automatically used to generate formally verifiable Go code. Finally, we discuss the performance of the API by considering a non-trivial case study.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the Power of Attribute-Based Communication.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; De Nicola, R.; and Loreti, M.\n\n\n \n\n\n\n In Albert, E.; and Lanese, I., editor(s), Formal Techniques for Distributed Objects, Components, and Systems - 36th IFIP WG 6.1 International Conference, FORTE 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Proceedings, volume 9688, of Lecture Notes in Computer Science, pages 1-18, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/forte/AlrahmanNL16,\n  author    = {Yehia {Abd Alrahman} and\n               Rocco {De Nicola} and\n               Michele Loreti},\n  editor    = {Elvira Albert and\n               Ivan Lanese},\n  title     = {On the Power of Attribute-Based Communication},\n  booktitle = {Formal Techniques for Distributed Objects, Components, and Systems\n               - 36th {IFIP} {WG} 6.1 International Conference, {FORTE} 2016, Held\n               as Part of the 11th International Federated Conference on Distributed\n               Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June\n               6-9, 2016, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {9688},\n  pages     = {1-18},\n  publisher = {Springer},\n  year      = {2016},\n  url       = {https://doi.org/10.1007/978-3-319-39570-8\\_1},\n  doi       = {10.1007/978-3-319-39570-8\\_1},\n  abstract  = {In open systems exhibiting adaptation, behaviors can arise as side effects of intensive components interaction. Finding ways to understand and design these systems, is a difficult but important endeavor. To tackle these issues, we present AbC, a calculus for attribute-based communication. An AbC system consists of a set of parallel agents each of which is equipped with a set of attributes. Communication takes place in an implicit multicast fashion, and interactions among agents are dynamically established by taking into account "connections" as determined by predicates over the attributes of agents. First, the syntax and the semantics of the calculus are presented, then expressiveness and effectiveness of AbC are demonstrated both in terms of modeling scenarios featuring collaboration, reconfiguration, and adaptation and of the possibility of encoding channel-based interactions and other interaction patterns. Behavioral equivalences for AbC are introduced for establishing formal relationships between different descriptions of the same system.}\n}\n\n\n\n
\n
\n\n\n
\n In open systems exhibiting adaptation, behaviors can arise as side effects of intensive components interaction. Finding ways to understand and design these systems, is a difficult but important endeavor. To tackle these issues, we present AbC, a calculus for attribute-based communication. An AbC system consists of a set of parallel agents each of which is equipped with a set of attributes. Communication takes place in an implicit multicast fashion, and interactions among agents are dynamically established by taking into account \"connections\" as determined by predicates over the attributes of agents. First, the syntax and the semantics of the calculus are presented, then expressiveness and effectiveness of AbC are demonstrated both in terms of modeling scenarios featuring collaboration, reconfiguration, and adaptation and of the possibility of encoding channel-based interactions and other interaction patterns. Behavioral equivalences for AbC are introduced for establishing formal relationships between different descriptions of the same system.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Programming of CAS Systems by Relying on Attribute-Based Communication.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; De Nicola, R.; and Loreti, M.\n\n\n \n\n\n\n In Margaria, T.; and Steffen, B., editor(s), Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part I, volume 9952, of Lecture Notes in Computer Science, pages 539-553, 2016. \n \n\n\n\n
\n\n\n\n \n \n \"ProgrammingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/isola/AlrahmanNL16,\n  author    = {Yehia {Abd Alrahman} and\n               Rocco {De Nicola} and\n               Michele Loreti},\n  editor    = {Tiziana Margaria and\n               Bernhard Steffen},\n  title     = {Programming of {CAS} Systems by Relying on Attribute-Based Communication},\n  booktitle = {Leveraging Applications of Formal Methods, Verification and Validation:\n               Foundational Techniques - 7th International Symposium, ISoLA 2016,\n               Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I}},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {9952},\n  pages     = {539-553},\n  year      = {2016},\n  url       = {https://doi.org/10.1007/978-3-319-47166-2\\_38},\n  doi       = {10.1007/978-3-319-47166-2\\_38},\n  abstract  = {In most distributed systems, named connections (i.e., channels) are used as means for programming interaction between communicating partners. These kinds of connections are low level and usually totally independent of the knowledge, the status, the capabilities, ..., in one word, of the attributes of the interacting partners. We have recently introduced a calculus, called AbC, in which interactions among agents are dynamically established by taking into account "connection" as  determined by predicates over agent attributes. In this paper, we present Open image in new window , a Java run-time environment that has been developed to support modeling and programming of collective adaptive systems by relying on the communication primitives of the AbC calculus. Systems are described as sets of parallel components, each component is equipped with a set of attributes and communications among components take place in an implicit multicast fashion. By means of a number of examples, we also show how opportunistic behaviors, achieved by run-time attribute updates, can be exploited to express different communication and interaction patterns and to program challenging case studies.}\n}\n\n\n
\n
\n\n\n
\n In most distributed systems, named connections (i.e., channels) are used as means for programming interaction between communicating partners. These kinds of connections are low level and usually totally independent of the knowledge, the status, the capabilities, ..., in one word, of the attributes of the interacting partners. We have recently introduced a calculus, called AbC, in which interactions among agents are dynamically established by taking into account \"connection\" as determined by predicates over agent attributes. In this paper, we present Open image in new window , a Java run-time environment that has been developed to support modeling and programming of collective adaptive systems by relying on the communication primitives of the AbC calculus. Systems are described as sets of parallel components, each component is equipped with a set of attributes and communications among components take place in an implicit multicast fashion. By means of a number of examples, we also show how opportunistic behaviors, achieved by run-time attribute updates, can be exploited to express different communication and interaction patterns and to program challenging case studies.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A calculus for attribute-based communication.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; De Nicola, R.; Loreti, M.; Tiezzi, F.; and Vigo, R.\n\n\n \n\n\n\n In Wainwright, R. L.; Corchado, J. M.; Bechini, A.; and Hong, J., editor(s), Proceedings of the 30th Annual ACM Symposium on Applied Computing, Salamanca, Spain, April 13-17, 2015, pages 1840-1845, 2015. ACM\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/sac/AlrahmanNLTV15,\n  author    = {Yehia {Abd Alrahman} and\n               Rocco {De Nicola} and\n               Michele Loreti and\n               Francesco Tiezzi and\n               Roberto Vigo},\n  editor    = {Roger L. Wainwright and\n               Juan Manuel Corchado and\n               Alessio Bechini and\n               Jiman Hong},\n  title     = {A calculus for attribute-based communication},\n  booktitle = {Proceedings of the 30th Annual {ACM} Symposium on Applied Computing,\n               Salamanca, Spain, April 13-17, 2015},\n  pages     = {1840-1845},\n  publisher = {{ACM}},\n  year      = {2015},\n  url       = {https://doi.org/10.1145/2695664.2695668},\n  doi       = {10.1145/2695664.2695668},\n  abstract  = {The notion of attribute-based communication seems promising to model and analyse systems with huge numbers of interacting components that dynamically adjust and combine their behaviour to achieve specific goals. A basic process calculus, named AbC, is introduced that has as primitive construct exactly attribute-based communication and its impact on the above mentioned kind of systems is considered. An AbC system consists of a set of parallel components each of which is equipped with a set of attributes. Communication takes place in a broadcast fashion and communication links among components are dynamically established by taking into account interdependences determined by predicates over attributes. First, the syntax and the reduction semantics of AbC are presented, then its expressiveness and effectiveness is demonstrated by modelling two scenarios from the realm of TV streaming channels. An example of how well-established process calculi could be encoded into AbC is given by considering the translation into AbC of a prototypical π-calculus process.}\n}\n\n\n\n
\n
\n\n\n
\n The notion of attribute-based communication seems promising to model and analyse systems with huge numbers of interacting components that dynamically adjust and combine their behaviour to achieve specific goals. A basic process calculus, named AbC, is introduced that has as primitive construct exactly attribute-based communication and its impact on the above mentioned kind of systems is considered. An AbC system consists of a set of parallel components each of which is equipped with a set of attributes. Communication takes place in a broadcast fashion and communication links among components are dynamically established by taking into account interdependences determined by predicates over attributes. First, the syntax and the reduction semantics of AbC are presented, then its expressiveness and effectiveness is demonstrated by modelling two scenarios from the realm of TV streaming channels. An example of how well-established process calculi could be encoded into AbC is given by considering the translation into AbC of a prototypical π-calculus process.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?.\n \n \n \n \n\n\n \n Abd Alrahman, Y.; Andric, M.; Beggiato, A.; and Lluch-Lafuente, A.\n\n\n \n\n\n\n In Escobar, S., editor(s), Rewriting Logic and Its Applications - 10th International Workshop, WRLA 2014, Held as a Satellite Event of ETAPS, Grenoble, France, April 5-6, 2014, Revised Selected Papers, volume 8663, of Lecture Notes in Computer Science, pages 21-41, 2014. Springer\n \n\n\n\n
\n\n\n\n \n \n \"CanPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/wrla/AlrahmanABL14,\n  author    = {Yehia {Abd Alrahman} and\n               Marina Andric and\n               Alessandro Beggiato and\n               Alberto Lluch{-}Lafuente},\n  editor    = {Santiago Escobar},\n  title     = {Can We Efficiently Check Concurrent Programs Under Relaxed Memory\n               Models in Maude?},\n  booktitle = {Rewriting Logic and Its Applications - 10th International Workshop,\n               {WRLA} 2014, Held as a Satellite Event of ETAPS, Grenoble, France,\n               April 5-6, 2014, Revised Selected Papers},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {8663},\n  pages     = {21-41},\n  publisher = {Springer},\n  year      = {2014},\n  url       = {https://doi.org/10.1007/978-3-319-12904-4\\_2},\n  doi       = {10.1007/978-3-319-12904-4\\_2},\n  abstract  = {Relaxed memory models offer suitable abstractions of the actual optimizations offered by multi-core architectures and by compilers of concurrent programming languages. Using such abstractions for verification purposes is challenging in part due to their inherent non-determinism which contributes to the state space explosion. Several techniques have been proposed to mitigate those problems so to make verification under relaxed memory models feasible. We discuss how to adopt some   of those techniques in a Maude-based approach to language prototyping, and suggest the use of other techniques that have been shown successful for similar verification purposes.}\n}\n
\n
\n\n\n
\n Relaxed memory models offer suitable abstractions of the actual optimizations offered by multi-core architectures and by compilers of concurrent programming languages. Using such abstractions for verification purposes is challenging in part due to their inherent non-determinism which contributes to the state space explosion. Several techniques have been proposed to mitigate those problems so to make verification under relaxed memory models feasible. We discuss how to adopt some of those techniques in a Maude-based approach to language prototyping, and suggest the use of other techniques that have been shown successful for similar verification purposes.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);