G. Bruno, A. Castella, I. Pavesio, M. P. Pescarmona
{"title":"一种新的基于Petri网的实时系统规范、设计和分析形式","authors":"G. Bruno, A. Castella, I. Pavesio, M. P. Pescarmona","doi":"10.1109/REAL.1993.393487","DOIUrl":null,"url":null,"abstract":"Current Petri net based methods for modeling and design of real-time systems rely on formalisms that are either expressive or analyzable, but not both. Our goal is to provide a new formalism bridging the gap between these positions. We start from a well known result on timed marked graphs, extend it to more general nets, and enhance the resulting formalism expressiveness by means of a set of transition expansion rules, which also enable hierarchical net structuring. A detailed example is discussed.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A new Petri net based formalism for specification, design and analysis of real-time systems\",\"authors\":\"G. Bruno, A. Castella, I. Pavesio, M. P. Pescarmona\",\"doi\":\"10.1109/REAL.1993.393487\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Current Petri net based methods for modeling and design of real-time systems rely on formalisms that are either expressive or analyzable, but not both. Our goal is to provide a new formalism bridging the gap between these positions. We start from a well known result on timed marked graphs, extend it to more general nets, and enhance the resulting formalism expressiveness by means of a set of transition expansion rules, which also enable hierarchical net structuring. A detailed example is discussed.<<ETX>>\",\"PeriodicalId\":198313,\"journal\":{\"name\":\"1993 Proceedings Real-Time Systems Symposium\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 Proceedings Real-Time Systems Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/REAL.1993.393487\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 Proceedings Real-Time Systems Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REAL.1993.393487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new Petri net based formalism for specification, design and analysis of real-time systems
Current Petri net based methods for modeling and design of real-time systems rely on formalisms that are either expressive or analyzable, but not both. Our goal is to provide a new formalism bridging the gap between these positions. We start from a well known result on timed marked graphs, extend it to more general nets, and enhance the resulting formalism expressiveness by means of a set of transition expansion rules, which also enable hierarchical net structuring. A detailed example is discussed.<>