基于预同余约简的参数化过程代数验证

2009 Ninth International Conference on Application of Concurrency to System Design Pub Date : 2009-07-01 DOI:10.1109/ACSD.2009.9

Antti Siirtola, J. Kortelainen

{"title":"基于预同余约简的参数化过程代数验证","authors":"Antti Siirtola, J. Kortelainen","doi":"10.1109/ACSD.2009.9","DOIUrl":null,"url":null,"abstract":"Decidability of the parameterised verification problem is shown for a class of systems and safety properties given as (multiply) parameterised labelled transition systems with an (infinite) set of valuations representing the allowed parameter values. The idea is to reduce the set of valuations by exploiting the precongruence of the correctness relation (traces refinement). An algorithm based on the result is provided.","PeriodicalId":307821,"journal":{"name":"2009 Ninth International Conference on Application of Concurrency to System Design","volume":"147 9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Parameterised Process Algebraic Verification by Precongruence Reduction\",\"authors\":\"Antti Siirtola, J. Kortelainen\",\"doi\":\"10.1109/ACSD.2009.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Decidability of the parameterised verification problem is shown for a class of systems and safety properties given as (multiply) parameterised labelled transition systems with an (infinite) set of valuations representing the allowed parameter values. The idea is to reduce the set of valuations by exploiting the precongruence of the correctness relation (traces refinement). An algorithm based on the result is provided.\",\"PeriodicalId\":307821,\"journal\":{\"name\":\"2009 Ninth International Conference on Application of Concurrency to System Design\",\"volume\":\"147 9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Ninth International Conference on Application of Concurrency to System Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSD.2009.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Ninth International Conference on Application of Concurrency to System Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSD.2009.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

给出了一类系统的参数化验证问题的可判定性，并给出了具有(无限)赋值集表示允许参数值的(乘)参数化标记过渡系统的安全性质。其思想是通过利用正确性关系的预同余(轨迹细化)来减少估值集。给出了一种基于该结果的算法。

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

查看原文本刊更多论文

Parameterised Process Algebraic Verification by Precongruence Reduction

Decidability of the parameterised verification problem is shown for a class of systems and safety properties given as (multiply) parameterised labelled transition systems with an (infinite) set of valuations representing the allowed parameter values. The idea is to reduce the set of valuations by exploiting the precongruence of the correctness relation (traces refinement). An algorithm based on the result is provided.

求助全文

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

来源期刊

2009 Ninth International Conference on Application of Concurrency to System Design

自引率

0.00%

发文量