{"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.