{"title":"随机max-plus系统Lyapunov指数的快速逼近算法","authors":"R. Goverde, B. Heidergott, G. Merlet","doi":"10.1109/WODES.2008.4605921","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of approximately computing the Lyapunov exponent of stochastic maxplus linear systems. Our approach allows for an efficient simulation of bounds for the Lyapunov exponent. Depending on the simulation budget the bounds can be made arbitrarily close. We illustrate the effectiveness of our bounds with application to (real-life) railway systems.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A fast approximation algorithm for the Lyapunov exponent of stochastic max-plus systems\",\"authors\":\"R. Goverde, B. Heidergott, G. Merlet\",\"doi\":\"10.1109/WODES.2008.4605921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of approximately computing the Lyapunov exponent of stochastic maxplus linear systems. Our approach allows for an efficient simulation of bounds for the Lyapunov exponent. Depending on the simulation budget the bounds can be made arbitrarily close. We illustrate the effectiveness of our bounds with application to (real-life) railway systems.\",\"PeriodicalId\":105225,\"journal\":{\"name\":\"2008 9th International Workshop on Discrete Event Systems\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 9th International Workshop on Discrete Event Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2008.4605921\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 9th International Workshop on Discrete Event Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2008.4605921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A fast approximation algorithm for the Lyapunov exponent of stochastic max-plus systems
This paper addresses the problem of approximately computing the Lyapunov exponent of stochastic maxplus linear systems. Our approach allows for an efficient simulation of bounds for the Lyapunov exponent. Depending on the simulation budget the bounds can be made arbitrarily close. We illustrate the effectiveness of our bounds with application to (real-life) railway systems.