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 (eds.), Application and Theory of Petri Nets 1997, pages 82-101.
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.
BibTeX entry
@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}
}
Copyright 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. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
