Author:
Blondin Michael,Finkel Alain,McKenzie Pierre
Funder
Fonds de Recherche du Québec – Nature et Technologies
Centre National de la Recherche Scientifique
ENS Cachan
Agence Nationale de la Recherche
Natural Sciences and Engineering Research Council of Canada
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference45 articles.
1. Reduction and covering of infinite reachability trees;Finkel;Inf. Comput.,1990
2. Well-structured transition systems everywhere!;Finkel;Theor. Comput. Sci.,2001
3. Algorithmic analysis of programs with well quasi-ordered domains;Abdulla;Inf. Comput.,2000
4. On the decidability status of reachability and coverability in graph transformation systems;Bertrand,2012
5. Well-structured graph transformation systems with negative application conditions;König,2012
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献