{"title":"Introduction to max-plus algebra","authors":"H. Goto","doi":"10.1145/2608628.2627496","DOIUrl":null,"url":null,"abstract":"This tutorial will focus on the basics of max-plus algebra along with relevant topics. Max-plus algebra is a discrete algebraic system in which the max and plus operations are defined as addition and multiplication in conventional algebra. Using this system, the behavior of a class of discrete event systems can be represented by simple linear equations, by which modeling, analysis, and control of the systems can be realized.\n We will start with a simple project scheduling problem to understand the basic usage of max-plus algebra. The focus will then be oriented to its detailed definition and observe relevant properties in terms of graph theory, net theory, and so on. In the latter part, we will move on to modeling and formulation methods in control theory viewpoint. Several application examples as schedule solvers will be introduced, followed by several recent advances achieved by the presenter.","PeriodicalId":243282,"journal":{"name":"International Symposium on Symbolic and Algebraic Computation","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2608628.2627496","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
This tutorial will focus on the basics of max-plus algebra along with relevant topics. Max-plus algebra is a discrete algebraic system in which the max and plus operations are defined as addition and multiplication in conventional algebra. Using this system, the behavior of a class of discrete event systems can be represented by simple linear equations, by which modeling, analysis, and control of the systems can be realized.
We will start with a simple project scheduling problem to understand the basic usage of max-plus algebra. The focus will then be oriented to its detailed definition and observe relevant properties in terms of graph theory, net theory, and so on. In the latter part, we will move on to modeling and formulation methods in control theory viewpoint. Several application examples as schedule solvers will be introduced, followed by several recent advances achieved by the presenter.