Publications
A polynomial time flow for implementing free-choice Petri-nets
Abstract
FSM and PTnet control models are pertinent in both software and hardware applications as both specification and implementation models. The state-based, monolithic FSM model is directly implementable in software or hardware, but cannot model concurrency without state explosion. Interacting FSM models have so far lacked the formal rigor for expressing the synchronising interactions between different FSMs. The event-based, PTnet model is able to model both concurrency and choice within the same model, however lacks a polynomial time flow to implementation, as current methods of exposing the event state space require a potentially exponential number of states. In this work, we present a polynomial complexity flow for transforming a Free-Choice PTnet into a new formalism for Interacting FSMs, i.e Multiple, Synchronised FSMs (MSFSMs), a compact Interacting FSMs model, potentially implementable using …
- Date
- 2012
- Authors
- Pavlos M Mattheakis, Christos P Sotiriou, Peter A Beerel
- Conference
- 2012 IEEE 30th International Conference on Computer Design (ICCD)
- Pages
- 227-234
- Publisher
- IEEE