Decomposition of timed automata for solving scheduling problems

DOI10.1080/00207721.2012.724099zbMath1320.90032OpenAlexW2115611038MaRDI QIDQ5172578

Masato Wakatake, Tatsushi Nishi

Publication date: 4 February 2015

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207721.2012.724099

zbMATH Keywords

timed automatacoordinationjobshop schedulingdecomposition algorithmparallel composition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Hybrid multi-objective optimisation for concurrent activities consolidating two docked spacecraft

Cites Work

• Optimal paths in weighted timed automata
• A theory of timed automata
• The power of reachability testing for timed automata
• Scheduling with timed automata
• Symbolic reachability analysis of genetic regulatory networks using discrete abstractions
• Supervisory control of hybrid systems based on model abstraction and guided search
• Task automata: Schedulability, decidability and undecidability
• Decomposition in automatic generation of Petri nets for manufacturing system control and scheduling
• Hybrid automata: an insight into the discrete abstraction of discontinuous systems
• Unnamed Item

This page was built for publication: Decomposition of timed automata for solving scheduling problems