Bounded Reachability Checking with Process Semantics

机译：使用过程语义进行有界可达性检查

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems. More specifically, we translate the bounded reachability problem for 1-safe Petri nets into constrained Boolean circuit satisfiability. We consider three semantics: process, step, and interleaving semantics. We show that process semantics has often the best performance for bounded reachability checking.

机译：有界模型检查最近已被引入作为反应系统的有效验证方法。在这项工作中，我们将有界模型检查应用于异步系统。更具体地说，我们将1-安全Petri网的有界可达性问题转换成约束布尔电路可满足性。我们考虑三种语义：过程，步骤和交织语义。我们证明了过程语义通常在有限可达性检查中具有最佳性能。

著录项

来源
《12th International Conference on CONCUR 2001 - Concurrency Theory, 12th, Aug 20-25, 2001, Aalborg, Denmark》|2001年|p.218-232|共15页
会议地点 Aalborg(DK);Aalborg(DK)
作者
Keijo Heljanko;
展开▼
作者单位

Helsinki University of Technology Laboratory for Theoretical Computer Science P.O. Box 5400, FIN-02015 HUT, Finland;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类自动化技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. 使用NWA对组合web服务进行可达性分析 [J] . 杜旭涛, 邢春晓, 周立柱东南大学学报（英文版） . 2008,第003期
2. Exploiting step semantics for efficient bounded model checking of asynchronous systems [J] . Jori Dubrovin, Tommi Junttila, Keijo Heljanko Science of Computer Programming . 2012,第10a11期

机译：利用步骤语义来有效地检查异步系统的有界模型
3. Deriving Unbounded Reachability Proof of Linear Hybrid Automata during Bounded Checking Procedure [J] . Dingbao Xie, Wen Xiong, Lei Bu, IEEE Transactions on Computers . 2017,第3期

机译：边界检查过程中线性混合自动机的无穷可达性证明
4. On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability [J] . Igor Konnov, Helmut Veith, Josef Widder Information and computation . 2017,第feba期

机译：基于阈值的分布式算法的有界模型检查的完整性：可达性
5. Bounded Reachability Checking with Process Semantics [C] . Keijo Heljanko International Conference on Concurrency Theory . 2001

机译：用过程语义检查有限的可达性检查
6. Efficient reachability algorithms in symbolic model checking. [D] . Moon, In-Ho. 2000

机译：符号模型检查中的高效可达性算法。
7. Exploiting UMLS Semantics for Checking Semantic Consistency among UMLS concepts [O] . Halit Erdogan, Esra Erdem, Olivier Bodenreider -1

机译：利用UMLS语义检查UMLS概念中的语义一致性
8. Bounded Reachability Checking with Process Semantics [O] . Keijo Heljanko 2002

机译：使用过程语义进行有界可达性检查
9. Deadlock and Reachability Checking with Finite Complete Prefixes [R] . Heijanko, K. 1999

机译：使用有限完整前缀进行死锁和可达性检查

Bounded Reachability Checking with Process Semantics

摘要

著录项

相似文献

相关主题

期刊订阅