A time stamp reduction method for state space exploration using colored Petri nets

Mercedes E. Narciso; Miquel A. Piera; Antoni Guasch

doi:10.1177/0037549711410768

A time stamp reduction method for state space exploration using colored Petri nets

Mercedes E. Narciso, Miquel A. Piera, Antoni Guasch

Department of Telecommunications and Systems Engineering

Research output: Contribution to journal › Article › Research › peer-review

19 Citations (Scopus)

Abstract

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. © 2012, The Author(s). All rights reserved.

Original language	English
Pages (from-to)	592-616
Journal	Simulation
Volume	88
Issue number	5
DOIs	https://doi.org/10.1177/0037549711410768
Publication status	Published - 1 Jan 2012

Keywords

colored Petri nets
logistic systems
optimization problems
scheduling
state space reduction methods

Access to Document

10.1177/0037549711410768

Cite this

@article{ab4a2791e68d4451b13ae34cf43fb106,

title = "A time stamp reduction method for state space exploration using colored Petri nets",

abstract = "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 {\textquoteleft}Old Node Method{\textquoteright}, 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. {\textcopyright} 2012, The Author(s). All rights reserved.",

keywords = "colored Petri nets, logistic systems, optimization problems, scheduling, state space reduction methods",

author = "Narciso, {Mercedes E.} and Piera, {Miquel A.} and Antoni Guasch",

year = "2012",

month = jan,

day = "1",

doi = "10.1177/0037549711410768",

language = "English",

volume = "88",

pages = "592--616",

number = "5",

}

TY - JOUR

T1 - A time stamp reduction method for state space exploration using colored Petri nets

AU - Narciso, Mercedes E.

AU - Piera, Miquel A.

AU - Guasch, Antoni

PY - 2012/1/1

Y1 - 2012/1/1

N2 - 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. © 2012, The Author(s). All rights reserved.

AB - 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. © 2012, The Author(s). All rights reserved.

KW - colored Petri nets

KW - logistic systems

KW - optimization problems

KW - scheduling

KW - state space reduction methods

U2 - 10.1177/0037549711410768

DO - 10.1177/0037549711410768

M3 - Article

VL - 88

SP - 592

EP - 616

IS - 5

ER -

A time stamp reduction method for state space exploration using colored Petri nets

Abstract

Keywords

Access to Document

Fingerprint

Cite this