We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete f...
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
Coloured Petri Nets are powerful models for different problems. This paper deals with the modelling of a Bluetooth communication network, piconet and scatternet. The developed Pet...
Silke Feldmann, Tim Hartmann, Kyandoghere Kyamakya
Component-based software engineering needs to be backed by thorough formal concepts and modeling techniques. This paper combines two concepts introduced independently by the two a...
Rough Petri nets model (RPNM) for knowledge representation, rule generation, and reasoning is presented in this paper. An algorithm for verifying the consistency of a rough knowle...