Abstract | ||
---|---|---|
We present an algebra for programming the itineraries of mobile agents. The algebra contains operators for modelling sequential, parallel, nondeterministic, and conditional mobility behaviour. Iterative behaviour is also modelled by a language of regular itineraries borrowing ideas from regular expressions. We give an operational semantics for the operators using Plotkin-style transition rules and provide examples of itineraries for meeting scheduling, sales order processing, and network modelling. |
Year | DOI | Venue |
---|---|---|
1999 | 10.1007/3-540-46674-6_19 | ASIAN |
Keywords | Field | DocType |
composing itineraries,plotkin-style transition rule,mobility behaviour,regular itinerary,operational semantics,modelling sequential,mobile agent,network modelling,meeting scheduling,regular expression,iterative behaviour,conditional mobility behaviour | Program optimization,Operational semantics,Regular expression,Nondeterministic algorithm,Object-oriented programming,Computer science,Scheduling (computing),Theoretical computer science,Artificial intelligence,Operator (computer programming),Sales order,Distributed computing | Conference |
ISBN | Citations | PageRank |
3-540-66856-X | 7 | 1.04 |
References | Authors | |
6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Seng Wai Loke | 1 | 778 | 88.71 |
Heinz Schmidt | 2 | 121 | 11.99 |
Arkady B. Zaslavsky | 3 | 943 | 168.27 |