Decomposition of timed automata for solving scheduling problems

Tatsushi Nishi; Masato Wakatake; Masahiro Inuiguchi

doi:10.1109/ICSMC.2008.4811664

Decomposition of timed automata for solving scheduling problems

Tatsushi Nishi, Masato Wakatake, Masahiro Inuiguchi

Research output: Contribution to journal › Conference article › peer-review

3 Citations (Scopus)

Abstract

In this paper, we propose a decomposition and coordination method for timed automata for modeling and solution of scheduling problems. Parallel composition of timed automata makes it possible to describe concurrent dynamics for several submodels represented by timed automata. To reduce state space explosion for parallel composition of timed automata, a decomposition and coordination method is developed. In the proposed method, a feasible solution is derived by coordinating the solution of each decomposed subproblem. Computational experiments demonstrate the feasibility of the proposed method.

Original language	English
Article number	4811664
Pages (from-to)	2459-2464
Number of pages	6
Journal	Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
DOIs	https://doi.org/10.1109/ICSMC.2008.4811664
Publication status	Published - 2008
Externally published	Yes
Event	2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 - Singapore, Singapore Duration: Oct 12 2008 → Oct 15 2008

Keywords

Decomposition
Scheduling
Timed automata

ASJC Scopus subject areas

Electrical and Electronic Engineering
Control and Systems Engineering
Human-Computer Interaction

Access to Document

10.1109/ICSMC.2008.4811664

Cite this

@article{6487584f583b4e769bd16d4bdab741d6,

title = "Decomposition of timed automata for solving scheduling problems",

abstract = "In this paper, we propose a decomposition and coordination method for timed automata for modeling and solution of scheduling problems. Parallel composition of timed automata makes it possible to describe concurrent dynamics for several submodels represented by timed automata. To reduce state space explosion for parallel composition of timed automata, a decomposition and coordination method is developed. In the proposed method, a feasible solution is derived by coordinating the solution of each decomposed subproblem. Computational experiments demonstrate the feasibility of the proposed method.",

keywords = "Decomposition, Scheduling, Timed automata",

author = "Tatsushi Nishi and Masato Wakatake and Masahiro Inuiguchi",

year = "2008",

doi = "10.1109/ICSMC.2008.4811664",

language = "English",

pages = "2459--2464",

journal = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",

issn = "1062-922X",

note = "2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 ; Conference date: 12-10-2008 Through 15-10-2008",

}

TY - JOUR

T1 - Decomposition of timed automata for solving scheduling problems

AU - Nishi, Tatsushi

AU - Wakatake, Masato

AU - Inuiguchi, Masahiro

PY - 2008

Y1 - 2008

N2 - In this paper, we propose a decomposition and coordination method for timed automata for modeling and solution of scheduling problems. Parallel composition of timed automata makes it possible to describe concurrent dynamics for several submodels represented by timed automata. To reduce state space explosion for parallel composition of timed automata, a decomposition and coordination method is developed. In the proposed method, a feasible solution is derived by coordinating the solution of each decomposed subproblem. Computational experiments demonstrate the feasibility of the proposed method.

AB - In this paper, we propose a decomposition and coordination method for timed automata for modeling and solution of scheduling problems. Parallel composition of timed automata makes it possible to describe concurrent dynamics for several submodels represented by timed automata. To reduce state space explosion for parallel composition of timed automata, a decomposition and coordination method is developed. In the proposed method, a feasible solution is derived by coordinating the solution of each decomposed subproblem. Computational experiments demonstrate the feasibility of the proposed method.

KW - Decomposition

KW - Scheduling

KW - Timed automata

UR - http://www.scopus.com/inward/record.url?scp=69949115616&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69949115616&partnerID=8YFLogxK

U2 - 10.1109/ICSMC.2008.4811664

DO - 10.1109/ICSMC.2008.4811664

M3 - Conference article

AN - SCOPUS:69949115616

SP - 2459

EP - 2464

JO - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

JF - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

SN - 1062-922X

M1 - 4811664

T2 - 2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008

Y2 - 12 October 2008 through 15 October 2008

ER -

Decomposition of timed automata for solving scheduling problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this