Improved verification of linear-time properties within fairness: weakly continuation-closed behaviour abstractions computed from trace reductions-Reference-Cited by-同舟云学术

Improved verification of linear-time properties within fairness: weakly continuation-closed behaviour abstractions computed from trace reductions

Published:2003 Issue:4 Volume:13 Page:241-255
ISSN:0960-0833
Container-title:Software Testing, Verification and Reliability
language:en
Short-container-title:Softw. Test. Verif. Reliab.

Author:

Ultes-Nitsche Ulrich,St James Simon

Publisher

Wiley

Subject

Safety, Risk, Reliability and Quality,Software

Reference35 articles.

1. Relative liveness and behavior abstraction (extended abstract). Proceedings of the 16th ACM Symposium on Principles of Distributed Computing (PODC'97), Santa Barbara, CA, 1997. ACM Press: New York, 1997; 45-52.

2. Application of formal verification and behaviour abstraction to the service interaction problem in intelligent networks

3. Approximately satisfied properties of systems and simple language homomorphisms

4. Satisfaction up to liveness?automatic verification based on exhaustive testing. Proceedings of the IFIP TC6/WG6.1 International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing and Verification (FORTE/PSTV2000), Pisa, Italy, 2000. Kluwer: Boston, MA, 2000; 237-248.

5. Lecture Notes;Alur,1995

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. k-counting automata;RAIRO - Theoretical Informatics and Applications;2012-10

2. On Combining State Space Reductions with Global Fairness Assumptions;Lecture Notes in Computer Science;2011

3. Fair Model Checking with Process Counter Abstraction;FM 2009: Formal Methods;2009

4. A power-set construction for reducing Büchi automata to non-determinism degree two;Information Processing Letters;2007-02