*banner
 

Representing Swarm Behaviors
Chris Shaver, Marjan Sirjani

Citation
Chris Shaver, Marjan Sirjani. "Representing Swarm Behaviors". Talk or presentation, 16, October, 2015; Presented at the Eleventh Biennial Ptolemy Miniconference, Berkeley.

Abstract
Applications in the Swarm will involve the coordinated interaction of communicating concurrent processes. These processes will not only be persistent proxies for a plethora of Internet of Things (IoT) devices such as sensors, actuators, and interfaces, but also persistent and transient computational processes deployed into the Swarm. In contrast with models of concurrent computation (MoCC) studied in Ptolemy that involve asynchronous processes, such as Process Networks and Dataflow, which have either static or modal topologies, the Swarm demands a MoCC that integrates into its semantics the deployment and configuration of concurrent processes. Such a semantics should account for the asynchronous and concurrently executing steps performed in the Swarm to transform the topology of communication, instantiate new processes, and to communicate not just data but mobile code as well.

Work has been done to develop such a MoCC, tailored to the Swarm, drawing from the Hewitt Actor model which has many of the features desired in such a model. In order to develop a new Actor model for the Swarm, termed the "ReActor" MoCC, foundational considerations are being explored to determine what an appropriate mathematical model is for the behaviors of this kind of model. In this presentation, we will propose such a model, expressing the behaviors of Swarm Processes as labeled dependency graphs of send, receive, and reaction events. It will be shown how Swarm Process can be represented as collections of these behaviors that can be composed, preserving important properties, and how one can reason about Swarm applications in terms of these behaviors.

Having developed the basis for a mathematical language that can describe what happens in the Swarm, a language of logic formula will be presented for the assertion of contracts and specifications for Swarm Applications. This logic language will play in Swarm Applications a role analogous to that of LTL formula in specifying reactive systems. The relationship between the language of specifications and the models of this language as event dependency graphs will serve as the basis for what constitutes as verification for Swarm applications, and how synthesis can be framed. Examples of this work will be explored involving coordinated home automation and emergency management.

Electronic downloads

Citation formats  
  • HTML 
    Chris Shaver, Marjan Sirjani. <a
href="http://chess.eecs.berkeley.edu/pubs/1159.html"><i>Representing
Swarm Behaviors</i></a>, Talk or presentation, 
16, October, 2015; Presented at the <a
href="http://ptolemy.eecs.berkeley.edu/conferences/15"
>Eleventh Biennial Ptolemy Miniconference,
Berkeley</a>.
  • Plain text 
    Chris Shaver, Marjan Sirjani. "Representing Swarm
Behaviors". Talk or presentation,  16, October, 2015;
Presented at the <a
href="http://ptolemy.eecs.berkeley.edu/conferences/15"
>Eleventh Biennial Ptolemy Miniconference,
Berkeley</a>.
  • BibTeX 
    @presentation{ShaverSirjani15_RepresentingSwarmBehaviors,
    author = {Chris Shaver and Marjan Sirjani},
    title = {Representing Swarm Behaviors},
    day = {16},
    month = {October},
    year = {2015},
    note = {Presented at the <a
              href="http://ptolemy.eecs.berkeley.edu/conferences/15"
              >Eleventh Biennial Ptolemy Miniconference,
              Berkeley</a>},
    abstract = {Applications in the Swarm will involve the
              coordinated interaction of communicating
              concurrent processes. These processes will not
              only be persistent proxies for a plethora of
              Internet of Things (IoT) devices such as sensors,
              actuators, and interfaces, but also persistent and
              transient computational processes deployed into
              the Swarm. In contrast with models of concurrent
              computation (MoCC) studied in Ptolemy that involve
              asynchronous processes, such as Process Networks
              and Dataflow, which have either static or modal
              topologies, the Swarm demands a MoCC that
              integrates into its semantics the deployment and
              configuration of concurrent processes. Such a
              semantics should account for the asynchronous and
              concurrently executing steps performed in the
              Swarm to transform the topology of communication,
              instantiate new processes, and to communicate not
              just data but mobile code as well.</p> <p>Work has
              been done to develop such a MoCC, tailored to the
              Swarm, drawing from the Hewitt Actor model which
              has many of the features desired in such a model.
              In order to develop a new Actor model for the
              Swarm, termed the "ReActor" MoCC, foundational
              considerations are being explored to determine
              what an appropriate mathematical model is for the
              behaviors of this kind of model. In this
              presentation, we will propose such a model,
              expressing the behaviors of Swarm Processes as
              labeled dependency graphs of send, receive, and
              reaction events. It will be shown how Swarm
              Process can be represented as collections of these
              behaviors that can be composed, preserving
              important properties, and how one can reason about
              Swarm applications in terms of these
              behaviors.</p> <p>Having developed the basis for a
              mathematical language that can describe what
              happens in the Swarm, a language of logic formula
              will be presented for the assertion of contracts
              and specifications for Swarm Applications. This
              logic language will play in Swarm Applications a
              role analogous to that of LTL formula in
              specifying reactive systems. The relationship
              between the language of specifications and the
              models of this language as event dependency graphs
              will serve as the basis for what constitutes as
              verification for Swarm applications, and how
              synthesis can be framed. Examples of this work
              will be explored involving coordinated home
              automation and emergency management.</p> },
    URL = {http://chess.eecs.berkeley.edu/pubs/1159.html}
}

Posted by Elizabeth Coyne on 15 Dec 2015.
Groups: chess
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.
©2002-2018 Chess