IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

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 synth...

ver descrição completa

Detalhes bibliográficos
Autor principal: Pereira, Fernando (author)
Outros Autores: Moutinho, Filipe (author), Gomes, Luís (author), Campos-Rebelo, Rogério (author)
Formato: conferenceObject
Idioma:eng
Publicado em: 2013
Assuntos:
Texto completo:http://hdl.handle.net/10400.21/2208
País:Portugal
Oai:oai:repositorio.ipl.pt:10400.21/2208
Descrição
Resumo: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.