Branching vs. Linear Time: Final Showdown-Reference-Cited by-同舟云学术

Branching vs. Linear Time: Final Showdown

Published:2001 Issue: Volume: Page:1-22
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Vardi Moshe Y.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45319-9_1

Reference106 articles.

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253–284, 1991.

2. R. Armoni, L. Fix, A. Flaisher, R. Gerth, T. Kanza, A. Landver, S. Mador-Haim, A. Tiemeyer, M.Y. Vardi, and Y. Zbar. The ForSpec compiler. Submitted, 2001.

3. R. Armoni, L. Fix, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, A. Tiemeyer, E. Singerman, and M.Y. Vardi. The ForSpec temporal language: A new temporal property-specification language. Submitted, 2001.

4. B. Banieqbal and H. Barringer. Temporal logic with fixed points. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, volume 398 of LectureNotes in Computer Science, pages 62–74. Springer-Verlag, 1987.

5. Lect Notes Comput Sci;H. Barringer,1985

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

1. Misconceptions in Finite-Trace and Infinite-Trace Linear Temporal Logic;Lecture Notes in Computer Science;2024-09-11

2. Query-by-Gaming;Encyclopedia of Computer Graphics and Games;2024

3. Verifiably Safe and Trusted Human-AI Systems: A Socio-technical Perspective;Proceedings of the First International Symposium on Trustworthy Autonomous Systems;2023-07-11

4. State-based verification of industrial control programs with the use of a digital model;International Journal of Computer Integrated Manufacturing;2023-05-09

5. Impossible Made Possible: Encoding Intractable Specifications via Implied Domain Constraints;Formal Methods for Industrial Critical Systems;2023