Petri nets and flexible manufacturing
Advances in Petri nets 1989
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
State space reduction by non-standard semantics for deadlock analysis
Science of Computer Programming
Integrating Petri nets and hybrid heuristic search for the scheduling of FMS
Computers in Industry
Condensed State Spaces for Timed Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Computers and Industrial Engineering
Formal specification and state space analysis of an operational planning process
International Journal on Software Tools for Technology Transfer (STTT)
Modular state space exploration for timed petri nets
International Journal on Software Tools for Technology Transfer (STTT)
Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems
International Journal on Software Tools for Technology Transfer (STTT)
Model-based development of a course of action scheduling tool
International Journal on Software Tools for Technology Transfer (STTT)
Improved question-guided stubborn set methods for state properties
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Original Articles: Coloured Petri net scheduling models: Timed state space exploration shortages
Mathematics and Computers in Simulation
Exploiting equivalence reduction and the sweep-line method for detecting terminal states
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
In this paper we present a state space exploration method implemented as part of a Decision Support Tool designed to improve the performance of logistics and production systems. An efficient depth-first search strategy, together with a reduction method known as the 'Old Node Method', is introduced to improve the descendant path choice by means of an evaluation function that allows the selection of the most promising node to be expanded at any level of the path. The sub-set of the state space representing the most promising scenarios holds a set of feasible and quasi-optimal solutions.