JOURNAL ARTICLE
Optimal infinite scheduling for multi-priced timed automata
Patricia BouyerEd BrinksmaKim G. Larsen
Year: 2007 Journal: Formal Methods in System Design Vol: 32 (1)Pages: 3-23 Publisher: Springer Science+Business Media
Keywords:
Automaton Computer science Class (philosophy) Reduction (mathematics) Abstraction Scheduling (production processes) Extension (predicate logic) Cover (algebra) Point (geometry) Finite-state machine Mathematical optimization Theoretical computer science Mathematics Algorithm Programming language Artificial intelligence
Metrics
65
Cited By
7.48
FWCI (Field Weighted Citation Impact)
30
Refs
0.98
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Formal Methods in Verification
Physical Sciences → Computer Science → Computational Theory and Mathematics
Petri Nets in System Modeling
Physical Sciences → Computer Science → Computational Theory and Mathematics
Model-Driven Software Engineering Techniques
Physical Sciences → Computer Science → Software
Related Documents
JOURNAL ARTICLE
Optimal scheduling using priced timed automata
Gerd BehrmannKim G. LarsenJacob Illum Rasmussen
Journal: ACM SIGMETRICS Performance Evaluation Review Year: 2005 Vol: 32 (4)Pages: 34-40
BOOK-CHAPTER
Resource-Optimal Scheduling Using Priced Timed Automata
Jacob Illum RasmussenKim G. LarsenK. Subramani
Lecture notes in computer science Year: 2004 Pages: 220-235
JOURNAL ARTICLE
Discount-Optimal Infinite Runs in Priced Timed Automata
Journal: Electronic Notes in Theoretical Computer Science Year: 2009 Vol: 239 Pages: 179-191
JOURNAL ARTICLE
Optimal reachability for multi-priced timed automata
Kim G. LarsenJacob Illum Rasmussen
Journal: Theoretical Computer Science Year: 2007 Vol: 390 (2-3)Pages: 197-213
JOURNAL ARTICLE
On using priced timed automata to achieve optimal scheduling
Jacob Illum RasmussenKim G. LarsenK. Subramani
Journal: Formal Methods in System Design Year: 2006 Vol: 29 (1)Pages: 97-114