For the most recent entries see the Petri Nets Newsletter.

Towards Fault-Tolerant and Secure Agentry.

Schneider, F.B.

In: Mavronicolas, M.; Tsigas, Ph.: Lecture Notes in Computer Science, Vol. 1320: Distributed Algorithms, Proc. of 11th International Workshop, WDAG'97, Saarbrücken, Germany, pages 1-14. Springer, September 1997.

Abstract: Processes that roam a network - agents - present new technical challenges. Two are discussed here. The first problem, which arises in connection with implementing fault-tolerant agents, concerns how a voter authenticates the agents comprising its electorate. The second is to characterize security policies that are enforceable as well as approaches for enforcing those policies.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography