An algebraic structure for duration automata

Authors:
Bui Vu Anh;Phan Trung Huy
Affiliations:
Faculty of Mathematics, Mechanics and Informatics, VNU University of Science, Vietnam;School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, Vietnam
Venue:
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
Year:
2012

Citing 4
Cited 0

A theory of timed automata

Theoretical Computer Science
Time-Constrained Automata (Extended Abstract)

CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Model Checking Real-Time Component Based Systems with Blackbox Testing

RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
A really temporal logic

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algebraic structures such as group, lattice and fuzzy algebra play an important role in the field of information technology, especially in modelling systems. The previous researches [1, 2, 3, 4] have introduced a formal tool named duration automata, by which we modelled systems and developed algorithms to solve problems on scheduling jobs for a cluster computer, routing on priority network or dealing with uncertain processing time jobs. Here we introduce a new weak semigroup with the aim to combine duration automata together with algebraic structures to solve some optimization problems.