Forward Analysis of Depth-Bounded Processes-Reference-Cited by-同舟云学术

Forward Analysis of Depth-Bounded Processes

Published:2010 Issue: Volume: Page:94-108
ISSN:0302-9743
Container-title:Foundations of Software Science and Computational Structures
language:
Short-container-title:

Author:

Wies Thomas,Zufferey Damien,Henzinger Thomas A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12032-9_8

Reference26 articles.

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS, pp. 313–321 (1996)

2. Amadio, R.M., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous pi-calculus. Nord. J. Comput. 9(1), 70–101 (2002)

3. Bauer, J., Wilhelm, R.: Static analysis of dynamic communication systems by partner abstraction. In: SAS, pp. 249–264 (2007)

4. Lecture Notes in Computer Science;N. Busi,2003

5. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2008), http://tata.gforge.inria.fr/ (release November 18, 2008)

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

1. Liveness in broadcast networks;Computing;2021-08-10

2. Forward analysis for WSTS, part I: completions;Mathematical Structures in Computer Science;2020-08

3. Using session types for reasoning about boundedness in the $$\pi $$-calculus;Acta Informatica;2019-09-01

4. Liveness in Broadcast Networks;Networked Systems;2019

5. Handling infinitely branching well-structured transition systems;Information and Computation;2018-02