Author:
Cotton-Barratt Conrad,Murawski Andrzej S.,Ong C.-H. Luke
Publisher
Springer International Publishing
Reference18 articles.
1. Araki, T., Kasami, T.: Some decision problems related to the reachability problem for Petri nets. Theor. Comput. Sci. 3(1), 85–104 (1976)
2. Lecture Notes in Computer Science;H Björklund,2007
3. Björklund, H., Schwentick, T.: On notions of regularity for data languages. Theor. Comput. Sci. 411(4–5), 702–715 (2010)
4. Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS. pp. 7–16. IEEE Computer Society (2006)
5. Lecture Notes in Computer Science;N Decker,2014
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Verifying higher-order concurrency with data automata;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
2. Leafy automata for higher-order concurrency;Lecture Notes in Computer Science;2021
3. ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States;ACM Transactions on Programming Languages and Systems;2019-06-21
4. ML and Extended Branching VASS;Programming Languages and Systems;2017
5. Class-Memory Automata Revisited;Claudio Moraga: A Passion for Multi-Valued Logic and Soft Computing;2016-10-21