Author:
Finkel Alain,Goubault-Larrecq Jean
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Lecture Notes in Computer Science;P. Abdulla,1998
2. Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation 160(1–2), 109–127 (2000)
3. Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Formal Methods in System Design 25(1), 39–65 (2004)
4. Lecture Notes in Computer Science;P.A. Abdulla,2004
5. Abdulla, P.A., Nylén, A.: Better is better than well: On efficient verification of infinite-state systems. In: 14th LICS, pp. 132–140 (2000)
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Handling infinitely branching well-structured transition systems;Information and Computation;2018-02
2. Formalization of Karp-Miller tree construction on petri nets;Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs;2017-01-16
3. WELL BEHAVED TRANSITION SYSTEMS;LOG METH COMPUT SCI;2017
4. Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture;Application and Theory of Petri Nets and Concurrency;2016
5. The Ideal Theory for WSTS;Lecture Notes in Computer Science;2016