Designing Petri Net Supervisors from LTL Specifications

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
$15 $15
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, books, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

We present a methodology to build a Petri net realization of a supervisor that, given a Petri net model of a (multi-)robot system and a linear temporal logic (LTL) specification, forces the system to fulfil the specification. The methodology includes composing the Petri net model with the Büchi automaton representing the LTL formula and trimming the result using a known method to reduce the size of the supervisor. Furthermore, we guarantee that the obtained supervisors are admissible by construction by restricting the LTL formulas that can be written to an appropriate subset. To illustrate the method, we provide an example on how to specify coordination rules for a team of simulated soccer robots.