The Security of Mobile Agent Systems
Description
In [2] a model for mobility, called Petri hypernets, was presented. Hypernets
offer a visual formalism to describe hierarchically structured dynamic
agents. The agents take the form of Petri nets, which manipulate other agents
as resources. In [4] a logic was proposed in which one can describe the temporal
and the structural properties of agents in a hypernet. One can also analyse
some properties of hypernets expressible as Petri net invariants thanks to the
translation of hypernets to 1-safe Petri net systems given in [3].
Recently, see [1], we have addressed the problem of modelling complex,
hybrid discrete agent systems in a modular way. The idea here is to obtain the
view of the complete system from a number of simpler views, each devoted
to a specific perspective. One view, for instance, could describe how some
mobile agents can evolve in time — this view could be captured as a hypernet.
Another could address other issues, for instance the rights of an agent to read
some messages.
The purpose of the talk is to describe how the approach can be used to
model, specify and verify some security aspects of mobile agent systems.
| Slides | |
| 0:00 | The Security of Mobile Agent Systems |
| 0:47 | Modeling and Reasoning about Mobile Agent Systems |
| 1:02 | Joint work with |
| 1:24 | Systems, views, models |
| 2:14 | Systems, views, specifications |
| 2:28 | Simple example |
| 3:40 | Different aspects of system behavior |
| 4:37 | Modeling the physical view |
| 5:37 | Petri hypernets in a nutshell |
| 8:21 | Communication infrastructure agent |
| 9:25 | Infrastructure & messages (1) |
| 9:41 | Infrastructure & messages (2) |
| 9:44 | Infrastructure & messages (3) |
| 9:46 | Infrastructure & messages (5) |
| 9:48 | Infrastructure & messages (6) |
| 9:51 | Infrastructure & messages (7) |
| 9:56 | Infrastructure, messages & communicators (1) |
| 10:01 | Infrastructure, messages & communicators (2) |
| 10:03 | Infrastructure, messages & communicators (3) |
| 10:14 | Infrastructure, messages & communicators (4) |
| 10:16 | Infrastructure, messages & communicators (5) |
| 10:33 | Physical message flow |
| 11:26 | Physical message flow – receive action |
| 12:39 | Physical message flow – an abstraction |
| 15:39 | Logical view – message addressing |
| 17:30 | Agent-aware transition systems |
| 18:08 | Synchronization of views |
| 21:11 | Synchronization result – system specification |
| 23:04 | Synchronization as a product (1) |
| 23:07 | Synchronization as a product (2) |
| 24:14 | Slightly more interesting example |
| 25:07 | Five views |
| 25:50 | 1. Encrypting and decrypting messages (1) |
| 28:04 | 1. Encrypting and decrypting messages (2) |
| 28:16 | 2. Public-Secret key relationship |
| 29:06 | 3. Communicators' knowledge - public keys |
| 29:36 | 4. Communicators' knowledge - secret keys |
| 29:48 | Synchronous transition function - send |
| 32:39 | Synchronous transition function - receive |
| 32:59 | Synchronous transition function - pass_on (1) |
| 33:17 | Synchronous transition function - pass_on (2) |
| 33:56 | Interpreted agent-aware transition systems |
| 35:17 | Agent-terms and valuations |
| 36:11 | Formulas and satisfaction relation |
| 37:42 | Some useful derived formulas |
| 38:18 | Public key cryptography example revisited (1) |
| 40:04 | Public key cryptography example revisited (2) |
| 41:56 | Public key cryptography example revisited (3) |
| 42:22 | Public key cryptography example revisited (4) |
| 42:43 | Public key cryptography example revisited (5) |
| 50:03 | Conclusions |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





