Cart (Loading....) | Create Account
Close category search window

Workflow Nets for Multiagent Cooperation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kotb, Y.T. ; Dept. of Comput. Sci., Univ. of Western Ontario, London, ON, Canada ; Beauchemin, S.S. ; Barron, J.L.

We present a formal framework for robotic cooperation in which we use an extension to Petri nets, known as workflow nets, to establish a protocol among mobile agents based on the task coverage they maintain. Our choice is motivated by the fact that Petri nets handle concurrency and that goal reachability, or soundness, can be theoretically established. In particular, we define a mathematical cooperation operator which turns cooperation problems expressed as workflow nets into algebraic representations. While we do not address the problem of efficiency, we formally demonstrate that this framework guarantees soundness, or goal reachability, using workflow nets.

Published in:

Automation Science and Engineering, IEEE Transactions on  (Volume:9 ,  Issue: 1 )

Date of Publication:

Jan. 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.