实时应用扩展标记图的时间分析

[1993] Proceedings of the IEEE Workshop on Real-Time Applications Pub Date : 1993-05-13 DOI:10.1109/RTA.1993.263114

G. Bruno, A. Castella, I. Pavesio, M. P. Pescarmona

{"title":"实时应用扩展标记图的时间分析","authors":"G. Bruno, A. Castella, I. Pavesio, M. P. Pescarmona","doi":"10.1109/RTA.1993.263114","DOIUrl":null,"url":null,"abstract":"Many of the formalisms available for describing real-time systems and assessing their performance are based on some flavor of Petri nets. Most of these formalisms are expressive but not analyzable, or vice-versa. To overcome these limitations, the authors increase the expressiveness of a current formal method, by extending it with controlled forms of transition expansions. An example is discussed.<<ETX>>","PeriodicalId":293622,"journal":{"name":"[1993] Proceedings of the IEEE Workshop on Real-Time Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Temporal analysis of extended marked graphs for real-time applications\",\"authors\":\"G. Bruno, A. Castella, I. Pavesio, M. P. Pescarmona\",\"doi\":\"10.1109/RTA.1993.263114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many of the formalisms available for describing real-time systems and assessing their performance are based on some flavor of Petri nets. Most of these formalisms are expressive but not analyzable, or vice-versa. To overcome these limitations, the authors increase the expressiveness of a current formal method, by extending it with controlled forms of transition expansions. An example is discussed.<<ETX>>\",\"PeriodicalId\":293622,\"journal\":{\"name\":\"[1993] Proceedings of the IEEE Workshop on Real-Time Applications\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings of the IEEE Workshop on Real-Time Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTA.1993.263114\",\"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 of the IEEE Workshop on Real-Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTA.1993.263114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

许多可用于描述实时系统和评估其性能的形式化方法都是基于某种形式的Petri网。大多数这些形式都是表达性的，但不能分析，反之亦然。为了克服这些限制，作者增加了当前形式化方法的表达性，通过使用转换展开的受控形式对其进行扩展。最后讨论了一个例子。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Temporal analysis of extended marked graphs for real-time applications

Many of the formalisms available for describing real-time systems and assessing their performance are based on some flavor of Petri nets. Most of these formalisms are expressive but not analyzable, or vice-versa. To overcome these limitations, the authors increase the expressiveness of a current formal method, by extending it with controlled forms of transition expansions. An example is discussed.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1993] Proceedings of the IEEE Workshop on Real-Time Applications

自引率

0.00%

发文量