Weak and Nested Class Memory Automata-Reference-Cited by-同舟云学术

Weak and Nested Class Memory Automata

Published:2015 Issue: Volume: Page:188-199
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Cotton-Barratt Conrad,Murawski Andrzej S.,Ong C.-H. Luke

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-15579-1_14

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 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Contextual Equivalence for State and Control via Nested Data;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Verifying higher-order concurrency with data automata;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

3. Leafy automata for higher-order concurrency;Lecture Notes in Computer Science;2021

4. ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States;ACM Transactions on Programming Languages and Systems;2019-06-21

5. ML and Extended Branching VASS;Programming Languages and Systems;2017