IOPT Petri net state space generation algorithm with maximal-step execution semantics

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Citations (Scopus)

Abstract

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc “explosion” effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.
Original languageUnknown
Title of host publicationIEEE International Conference on Industrial Informatics INDIN
Pages789-795
ISBN (Electronic)978-1-4577-0433-8
DOIs
Publication statusPublished - 1 Jan 2011
Event9th IEEE International Conference on Industrial Informatics (INDIN) - Lisbon, Portugal
Duration: 26 Jul 201129 Jul 2011

Conference

Conference9th IEEE International Conference on Industrial Informatics (INDIN)
CountryPortugal
CityLisbon
Period26/07/1129/07/11

Cite this