A New Mathematical Approach for Synthesis of State Based Models from Scenario Based Models

Y. G. Bonab, A. Isazadeh
{"title":"A New Mathematical Approach for Synthesis of State Based Models from Scenario Based Models","authors":"Y. G. Bonab, A. Isazadeh","doi":"10.1109/ICCEE.2009.64","DOIUrl":null,"url":null,"abstract":"Model Driven Development and Use Case Driven Development methodologies have inspired the proposal of a variety of software engineering approaches that synthesize state based models from scenario-based models. Solving the problem of synthesis for open reactive systems is an inherently difficult problem. In various settings the problem is undecidable, and even in more restricted settings when it becomes decidable, the time and space requirements of the synthesis algorithm may be too large to be practical for large systems. This research presents a new approach to define algorithms of synthesis technique. This approach is based on an ordered sequence of stage for executing the scenarios. It is important to consider the executing stages of a scenario as a sequence. This gives a lot of information about execution of a scenario. Many synthesis approaches address the running stages of a scenario as a single stage. The mathematical foundation presented for this ordered sequence is based on RUN in Live Sequence Chart method presented by Harel. We believe that our mathematical foundation would significantly reduce the complexity of synthesis technique. We show that our approach have some advantages over those of others’; in particular, our mathematical basis to define algorithms for constructing synthesis technique is very efficient.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Second International Conference on Computer and Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEE.2009.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Model Driven Development and Use Case Driven Development methodologies have inspired the proposal of a variety of software engineering approaches that synthesize state based models from scenario-based models. Solving the problem of synthesis for open reactive systems is an inherently difficult problem. In various settings the problem is undecidable, and even in more restricted settings when it becomes decidable, the time and space requirements of the synthesis algorithm may be too large to be practical for large systems. This research presents a new approach to define algorithms of synthesis technique. This approach is based on an ordered sequence of stage for executing the scenarios. It is important to consider the executing stages of a scenario as a sequence. This gives a lot of information about execution of a scenario. Many synthesis approaches address the running stages of a scenario as a single stage. The mathematical foundation presented for this ordered sequence is based on RUN in Live Sequence Chart method presented by Harel. We believe that our mathematical foundation would significantly reduce the complexity of synthesis technique. We show that our approach have some advantages over those of others’; in particular, our mathematical basis to define algorithms for constructing synthesis technique is very efficient.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于状态的模型与基于场景的模型综合的一种新的数学方法
模型驱动开发和用例驱动开发方法激发了各种软件工程方法的建议,这些方法从基于场景的模型中综合了基于状态的模型。解决开放反应体系的合成问题本身就是一个难题。在各种情况下,问题是不可确定的,甚至在更有限的情况下,当它变得可确定时,综合算法的时间和空间要求可能太大,无法适用于大型系统。本研究提出了一种定义合成技术算法的新方法。此方法基于执行场景的有序阶段序列。将场景的执行阶段视为一个序列是很重要的。这提供了关于场景执行的大量信息。许多综合方法将场景的运行阶段作为单个阶段来处理。该有序序列的数学基础是基于Harel提出的Live sequence Chart方法中的RUN。我们相信,我们的数学基础将大大降低合成技术的复杂性。我们表明,我们的方法比其他方法有一些优势;特别是,我们的数学基础,以定义算法构造综合技术是非常有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ID Based Signature Schemes for Electronic Voting Service Oriented Approach to Improve the Power of Snorts On-line Colour Image Compression Based on Pipelined Architecture CMMP: Clustering-Based Multi-channel MAC Protocol in VANET Computer Aided Protection (Overcurrent) Coordination Studies
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1