期刊文献+

Translating Linear Temporal Logic Formula s into Automata 被引量:1

Translating Linear Temporal Logic Formula s into Automata
在线阅读 下载PDF
导出
摘要 To combat the well-known state-space explosion problem in Prop ositional Linear T emp o- ral Logic (PLTL) model checking, a novel algo- rithm capable of translating PLTL formulas into Nondeterministic Automata (NA) in an efficient way is proposed. The algorithm firstly transforms PLTL formulas into their non-free forms, then it further translates the non-free formulas into their Normal Forms (NFs), next constructs Normal Form Graphs (NFGs) for NF formulas, and it fi- nally transforms NFGs into the NA which ac- cepts both finite words and int-mite words. The experimental data show that the new algorithm re- duces the average number of nodes of target NA for a benchmark formula set and selected formulas in the literature, respectively. These results indi- cate that the PLTL model checking technique em- ploying the new algorithm generates a smaller state space in verification of concurrent systems. To combat the well-known state-space explosion problem in Propositional Linear Temporal Logic (PLTL) model checking, a novel algorithm capable of translating PLTL formulas into Nondeterministic Automata (NA) in an efficient way is proposed. The algorithm firstly transforms PLTL formulas into their non-free forms, then it further translates the non-free formulas into their Normal Forms (NFs), next constructs Normal Form Graphs (NFGs) for NF formulas, and it finally transforms NFGs into the NA which accepts both finite words and infinite words. The experimental data show that the new algorithm reduces the average number of nodes of target NA for a benchmark formula set and selected formulas in the literature, respectively. These results indicate that the PLTL model checking technique employing the new algorithm generates a smaller state space in verification of concurrent systems.
出处 《China Communications》 SCIE CSCD 2012年第6期100-113,共14页 中国通信(英文版)
基金 The first author of this paper would like to thank the follow- ing scholars, Prof. Joseph Sifakis, 2007 Turing Award Winner, for his invaluable help with my research and Dr. Kevin Lu at Brunel University, UK for his excellent suggestions on this paper. This work was supported by the National Natural Sci- ence Foundation of China under Grant No.61003079 the Chi- na Postdoctoral Science Foundation under Grant No. 2012M511588.
关键词 theoretical computer science modelchecking normal form graph AUTOMATA proposi-tional linear temporal logic 逻辑公式 线性 翻译 状态空间爆炸 时序 模型检查 非确定性 并发系统
  • 相关文献

参考文献41

  • 1朱维军,王忠勇,张海宾.Intrusion Detection Algorithm Based on Model Checking Interval Temporal Logic[J].China Communications,2011,8(3):66-72. 被引量:5
  • 2MARKUS M, DAVID S, BERNHARD S. Model-Chec- king a Tutorial Introduction[C]//Proceedings of the 6th In- ternational Symposium on Static Analysis. LNCS, 1999, 1694: 330-354.
  • 3HOLZMANN G. The Model Checker SP1N [J]. IEEE Transactions on Software Engineering, 1997, 23 (5): 279- 295.
  • 4PITERMAN N. From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata[J]. Logical Methods in Comouter Science. 2007.3(3): 5.
  • 5CLARKE E, GRUMBER O, LONG D.Verification Tools for Finite-State Concurrent Systems [C]// A Decade of Concurrency, Reflections and Perspectives, REX School/ Symposium. LNCS, 1993, 803: 124-175.
  • 6CLARKE E, GRUMBER O, PELED D. Model Checking [M]. Massachusetts: the MIT press, 1999.
  • 7STEM U, DILL D. A New Scheme for Memory-Efficient Probabilistic Verification[C]// Proceedings of the Interna- tional Conference on Formal Description Techniques for Distributed Systems. London, Chapman & Hall, 1996: 333 -348.
  • 8GODEFROID P, HOLZMANN G, PIROTT1N D. State- Space Caching Revisited [J]. Formal Methods in System Design, 1995, 7(3): 227-241.
  • 9EDELKAMPA S, SULEWSKI D, BARNAT J, et al. Flash Memory Efficient LTL Model Checking [J]. Scienceof Computer Programming, 2011, 76,136-157.
  • 10PELED D. Combining Partial Order Reductions with On- the-Fly Model-Checking [J]. Formal Methods in System Design, 1996, 8(1): 39-64.

二级参考文献33

  • 1张燕,傅建明,孙晓梅.一种基于模型检查的入侵检测方法[J].武汉大学学报(理学版),2005,51(3):319-322. 被引量:4
  • 2ROGER M,GOUBAULT-LARRECQ J.Log Auditing through Model-Checking. Proceedings of the 14th IEEE workshop on Computer Security Foundations . 2001
  • 3MOSZKOWSKI B C.Reasoning about Digital Circuits. . 1983
  • 4SOLANKI M,TESCO S.A Framework for Defining Tem- poral Semantics in Owl Enabled Services. Proceed- ing of W3C Workshop on Frameworks for Semantics in Web Services . 2005
  • 5SOLANKI M,CAU A,ZEDAN H.Semantically Annota- ting Reactive Web Services with Temporal Specifications. Proceedings of the IEEE ICWS 2005,Second In- ternational Workshop on Semantic and Dynamic Web Processes . 2005
  • 6Oleg Sheyner,Joshua Haines,Somesh Jha,et al.Automated generation and analysis of attack graphs. Proceedings of the 2002 IEEE Symposium on Security and Privacy . 2002
  • 7Clarke EM,Grumberg O,Peled D.Model Checking. . 1999
  • 8Bowman,H.,Thompson,S.A decision procedure and complete axiomatization of finite interval temporal logic with projection. J. Log. Comput . 2003
  • 9G.T.Rohrmair,G.Lowe.Using data-independence in the analysis of intrusion detection. Theoretical Computer Science . 2005
  • 10Hira M,Sarkar D.Verification of Tempura Specification of SequentialCircuits. IEEE Transcations on Computer Aided Design of Integrated Circuits and Systems . 1997

共引文献5

同被引文献20

  • 1朱维军,王忠勇,张海宾.Intrusion Detection Algorithm Based on Model Checking Interval Temporal Logic[J].China Communications,2011,8(3):66-72. 被引量:5
  • 2FORREST S, HOFMEYR S A, SOMAYAJI A, et al. A Sense of Self for Unix Processes[C]// Proceedings of 1996 IEEE Symposium on Security and Privacy: May 6-8, 1996. Oakland, CA, USA. IEEE Press, 1996: 120-128.
  • 3HOFMEYR S A, FORREST S, SOMAYAJI A. Intrusion Detection Using Sequences of System Calls[J]. Journal of Computer Security, 1998, 6(3): 151-180.
  • 4HELMAN P, BHANGOO J. A Statistically Based System for Prioritizing Information Exploration under Uncertainty[J]. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, 1997, 27(4): 449-466.
  • 5LEE W, STOLFO S J. Data Mining Approaches for Intrusion Detection[C]// Proceedings of the 7th USENIX Security Symposium: January 26- 29, 1998. San Antonio, TX, USA, 1998: 26-40.
  • 6LEE W, STOLFO S J, CHAN P K. Learning Patterns from U nix Process Execution Traces for Intrusion Detection[C]// Proceedings of the AAAI Workshop on AI Approaches to Fraud and Risk Management: July 27-28, 1997. Providence, Rhode Island, USA. AAAI Press, 1997: 50-56.
  • 7SEKAR R, BENDRE M, BOLLINENI P. et al. A Fast Automaton-Based Method for Detecting Anomalous Program Behaviors[c]// Proceedings of 2001 IEEE Symposium on Security and Privacy (S&P 2001): May 14-16, 2001. Oakland, CA, USA. IEEE Press, 2001: 144-155.
  • 8WAGNER D, DEAN D. Intrusion Detection via Static Analysis[C]// Proceedings of 2001 IEEE Symposium on Security and Privacy (S&P 2001): May 14-16, 2001.0akland, CA, USA. IEEE Press, 2001: 156-168.
  • 9GIFFIN J, JHA S, MILLER B. Detecting Manipulated Remote Call Streams[C]// Proceedings of the 11th USENIX Security Symposium: August 8-12,2002. San Francisco, CA, USA, 2002: 61-79.
  • 10GIFFIN J, JHA S, MILLER B. Efficient ContextSensitive Intrusion Detection[C]// Proceedings of the 11th Network and Distributed System Security Symposium: February 5-6, 2004. San Diego, CA, USA, 2004.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部