Decomposition of timed automata for solving scheduling problems

Tatsushi Nishi, Masato Wakatake, Masahiro Inuiguchi

Research output: Contribution to journalConference articlepeer-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 languageEnglish
Article number4811664
Pages (from-to)2459-2464
Number of pages6
JournalConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 - Singapore, Singapore
Duration: Oct 12 2008Oct 15 2008

Keywords

  • Decomposition
  • Scheduling
  • Timed automata

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Decomposition of timed automata for solving scheduling problems'. Together they form a unique fingerprint.

Cite this