发布求助
文献互助 智能选刊 最新文献

French Singaporean Workshop on Formal Methods and Applications最新文献

筛选
英文 中文
Dynamic Clock Elimination in Parametric Timed Automata 参数定时自动机的动态时钟消除
French Singaporean Workshop on Formal Methods and Applications Pub Date : 1900-01-01 DOI: 10.4230/OASIcs.FSFMA.2013.18
É. André
{"title":"Dynamic Clock Elimination in Parametric Timed Automata","authors":"É. André","doi":"10.4230/OASIcs.FSFMA.2013.18","DOIUrl":"https://doi.org/10.4230/OASIcs.FSFMA.2013.18","url":null,"abstract":"The formalism of parametric timed automata provides designers with a formal way to specify and verify real-time concurrent systems where iming requirements are unknown (or parameters). Such models are usually subject to the state space explosion. A popular way to partially reduce the size of the state space is to reduce the number of clock variables. In this work, we present a technique for dynamically eliminating clocks. Experiments using IMITATOR show a diminution of the number of states and of the computation time, and in some cases allow termination of the analysis of models that could not terminate otherwise. More surprisingly, even when the number of clocks remains constant, there is little noticeable overhead in applying the proposed clock elimination.","PeriodicalId":192578,"journal":{"name":"French Singaporean Workshop on Formal Methods and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132808454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
An Improved Construction of Petri Net Unfoldings Petri网展开的一种改进构造
French Singaporean Workshop on Formal Methods and Applications Pub Date : 1900-01-01 DOI: 10.4230/OASIcs.FSFMA.2013.47
César Rodríguez, Stefan Schwoon
{"title":"An Improved Construction of Petri Net Unfoldings","authors":"César Rodríguez, Stefan Schwoon","doi":"10.4230/OASIcs.FSFMA.2013.47","DOIUrl":"https://doi.org/10.4230/OASIcs.FSFMA.2013.47","url":null,"abstract":"Petri nets are a well-known model language for concurrent systems. \u0000The unfolding of a Petri net is an acyclic net bisimilar to the original one. Because it is acyclic, it admits simpler decision problems though it is in general larger than the net. In this paper, we revisit the problem of efficiently constructing an unfolding. We propose a new method that avoids computing the concurrency relation and therefore uses less memory than some other methods but still represents a good time-space tradeoff. We implemented the approach \u0000and report on experiments.","PeriodicalId":192578,"journal":{"name":"French Singaporean Workshop on Formal Methods and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125108779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Formal Modelling and Verification of Pervasive Computing Systems 普适计算系统的形式化建模与验证
French Singaporean Workshop on Formal Methods and Applications Pub Date : 1900-01-01 DOI: 10.4230/OASIcs.FSFMA.2013.61
Y. Liu
{"title":"Formal Modelling and Verification of Pervasive Computing Systems","authors":"Y. Liu","doi":"10.4230/OASIcs.FSFMA.2013.61","DOIUrl":"https://doi.org/10.4230/OASIcs.FSFMA.2013.61","url":null,"abstract":"Smart systems equipped with emerging pervasive computing technologies enable people with limitations to live in their homes independently. However, lack of guarantees for correctness prevent such system to be widely used. Analysing the system with regard to correctness requirements is a challenging task due to the complexity of the system and its various unpredictable faults. In this work, we propose to use formal methods to analyse pervasive computing (PvC) systems. Firstly, a formal modelling framework is proposed to cover the main characteristics of such systems (e.g., context-awareness, concurrent communications, layered architectures). Secondly, we identify the safety requirements (e.g., free of deadlocks and conflicts) and specify them as safety and liveness properties. Furthermore, based on the modelling framework, we propose an approach of verifying reasoning rules which are used in the middleware for perceiving the environment and making adaptation decisions. Finally, we demonstrate our ideas using a case study of a smart healthcare system. Experimental results show the usefulness of our approach in exploring system behaviours and revealing system design flaws such as information inconsistency and conflicting reminder services.","PeriodicalId":192578,"journal":{"name":"French Singaporean Workshop on Formal Methods and Applications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126341833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Control of Switching Systems by Invariance Analysis (Invited Talk) 用不变性分析控制切换系统(特邀演讲)
French Singaporean Workshop on Formal Methods and Applications Pub Date : 1900-01-01 DOI: 10.4230/OASIcs.FSFMA.2013.1
L. Fribourg
{"title":"Control of Switching Systems by Invariance Analysis (Invited Talk)","authors":"L. Fribourg","doi":"10.4230/OASIcs.FSFMA.2013.1","DOIUrl":"https://doi.org/10.4230/OASIcs.FSFMA.2013.1","url":null,"abstract":"Switched systems are embedded devices widespread in industrial applications such as power electronics and automotive control. They consist of continuous-time dynamical subsystems and a rule that controls the switching between them. Under a suitable control rule, the system can improve its steady-state performance and meet essential properties such as safety and stability in desirable operating zones. We explain that such controller synthesis problems are related to the construction of appropriate invariants of the state space, which approximate the limit sets of the system trajectories. We present a new approach of invariant construction based on a technique of state space decomposition interleaved with forward fixed point computation. The method is illustrated in a case study taken from the field of power electronics.","PeriodicalId":192578,"journal":{"name":"French Singaporean Workshop on Formal Methods and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124363110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improving System-Level Verification of SystemC Models with SPIN 用SPIN改进SystemC模型的系统级验证
French Singaporean Workshop on Formal Methods and Applications Pub Date : 1900-01-01 DOI: 10.4230/OASIcs.FSFMA.2013.74
Martin Elshuber, Susanne Kandl, P. Puschner
{"title":"Improving System-Level Verification of SystemC Models with SPIN","authors":"Martin Elshuber, Susanne Kandl, P. Puschner","doi":"10.4230/OASIcs.FSFMA.2013.74","DOIUrl":"https://doi.org/10.4230/OASIcs.FSFMA.2013.74","url":null,"abstract":"SystemC is a de-facto industry standard for developing, modelling, and simulating embedded systems. As embedded systems become more and more integrated into many aspects of human lives (e.g., transportation, surveillance systems, ...), failures of embedded systems might cause dangerous hazards to individuals or groups. Guaranteeing safety of such systems makes formal verification crucial. In this paper we present a novel approach for verifying SystemC models with SPIN. Focusing on system-level verification we reuse compiled and executable code from the original model and embed it into the verifier generated by SPIN. In contrast to most other approaches, which require a complete model transformation, in our approach the transformation focuses only on the relevant parts of the model while leaving functional blocks untransformed. Our technique aims at reducing the state vector size managed by the verifier of SPIN, at improving state exploration performance by avoiding unnecessary model transformation steps, and at concentrating on verifying properties that emerge from the composition of multiple functional units.","PeriodicalId":192578,"journal":{"name":"French Singaporean Workshop on Formal Methods and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127645252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书