Bibliography
Multi-Agent-Systems based on Coloured Petri Nets
Daniel Moldt and Frank Wienberg.
Multi-agent-systems based on coloured Petri nets.
In Azéma and Balbo , Application and Theory of Petri Nets 1997, pages 82-101.
Based on Y. Shoham's paradigm, called Agent-Oriented Programming (AOP), multi-agent-systems are presented as a specialization of distributed, Object-Oriented systems. Equipped with knowledge, general concurrent inference mechanisms dealing with this knowledge, and a declarative agent program, these multi-agent systems are intended to be a foundation of a new approach uniting advantages of many contributing areas: The precise semantics of Petri nets, the abstraction and encapsulation proposed in Object-Oriented approaches, and the power of logic programming, making it easy to adopt well-known AI-methods. As an example, an urban traffic information system will be designed which solves path searching problems in a distributed graph.
BibTeX
@INPROCEEDINGS{Moldt+97,
AUTHOR = {Moldt, Daniel and Wienberg, Frank},
ADDRESS = Springer.addr,
PAGES = {82--101},
PUBLISHER = {Springer Verlag},
SERIES = LNCS,
TITLE = {Multi-Agent-Systems based on Coloured {Petri} Nets},
YEAR = 1997,
keywords = {Multi-Agent-System; Agent-Oriented Programming;
Distributed Artificial Intelligence; Distributed
Object-Orientation; Coloured Petri Nets},
abstract = {Based on Y. Shoham's paradigm, called Agent-Oriented
Programming (AOP), multi-agent-systems are presented as
a specialization of distributed, Object-Oriented
systems. Equipped with knowledge, general concurrent
inference mechanisms dealing with this knowledge, and a
declarative agent program, these multi-agent systems
are intended to be a foundation of a new approach
uniting advantages of many contributing areas: The
precise semantics of Petri nets, the abstraction and
encapsulation proposed in Object-Oriented approaches,
and the power of logic programming, making it easy to
adopt well-known AI-methods. As an example, an urban
traffic information system will be designed which
solves path searching problems in a distributed
graph.},
crossref = {Azema+-e-97}
}
@PROCEEDINGS{Azema+-e-97,
ADDRESS = Springer.addr,
EDITOR = {Az{\'e}ma, Pierre and Balbo, Gianfranco},
NUMBER = {1248},
PUBLISHER = Springer,
SERIES = LNCS,
TITLE = {{Application and Theory of {Petri} Nets 1997}},
BOOKTITLE = {Application and Theory of {Petri} Nets 1997},
YEAR = 1997,
ANNOTE = {ISBN=3-540-63139-9}
}
