Handling Infinitely Branching WSTS-Reference-Cited by-同舟云学术

Handling Infinitely Branching WSTS

Published:2014 Issue: Volume: Page:13-25
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Blondin Michael,Finkel Alain,McKenzie Pierre

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-43951-7_2

Reference27 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. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1-2), 109–127 (2000)

3. Abramsky, S., Jung, A.: Domain theory. In: Handbook of Logic in Comp. Sci., vol. 3, pp. 1–168. Oxford University Press (1994)

4. Bertrand, N., Delzanno, G., König, B., Sangnier, A., Stückrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: RTA, pp. 101–116 (2012)

5. Bertrand, N., Schnoebelen, P.: Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design 43(2), 233–267 (2013)

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

1. Branch-Well-Structured Transition Systems and Extensions;Formal Techniques for Distributed Objects, Components, and Systems;2022

2. The Complexity of Coverability in ν-Petri Nets;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05

3. The Ideal Theory for WSTS;Lecture Notes in Computer Science;2016

4. The Ideal View on Rackoff’s Coverability Technique;Lecture Notes in Computer Science;2015