A New Unfolding Approach to LTL Model Checking-Reference-Cited by-同舟云学术

A New Unfolding Approach to LTL Model Checking

Published:2000 Issue: Volume: Page:475-486
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Esparza Javier,Heljanko Keijo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45022-X_40

Reference18 articles.

1. Bibliography on the net unfolding method. Available on the Internet at http://wwwbrauer.in.tum.de/gruppen/theorie/pom/pom.shtml .

2. J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23:151–195, 1994.

3. Lect Notes Comput Sci;J. Esparza,1999

4. Lect Notes Comput Sci;J. Esparza,1996

5. Javier Esparza and Keijo Heljanko. A new unfolding approach to LTL model checking. Research Report A60, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. Available at http://www.tcs.hut.fi/pub/reports/A60.ps.gz .

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

1. Model Checking $$\omega $$-Regular Properties with Decoupled Search;Computer Aided Verification;2021

2. Generalised Computation of Behavioural Profiles Based on Petri-Net Unfoldings;Lecture Notes in Computer Science;2011

3. A False History of True Concurrency: From Petri to Tools;Model Checking Software;2010

4. Tight Local Approximation Results for Max-Min Linear Programs;Algorithmic Aspects of Wireless Sensor Networks;2008

5. A negative result on depth-first net unfoldings;International Journal on Software Tools for Technology Transfer;2007-02-27