Reachability in trace-pushdown systems

DOI10.1016/J.TCS.2026.115971MaRDI QIDQ7266643zbMATH OpenFDO

Authors Chris Köcher, Dietrich Kuske

Publication date 15 June 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115971

zbMATH Keywords

distributed systemformal verificationpushdown automatonreachability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A class of rational trace relations closed under composition
• Automatic presentations of structures
• Backwards-reachability for cooperating multi-pushdown systems
• Combinatorics on traces
• Extended finite automata over groups
• Finite automata with multiplication
• Finite presentations of infinite structures: Automata and interpretations
• First-order logic with reachability for infinite-state systems
• Formal Languages and Groups as Memory
• Formal Reductions of the General Combinatorial Decision Problem
• Forwards- and backwards-reachability for cooperating multi-pushdown systems
• Group weighted finite transducers.
• scientific article; zbMATH DE number 3970130 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 125883 (Why is no real title available?)
• scientific article; zbMATH DE number 848082 (Why is no real title available?)
• Membership problems for regular and context-free trace languages
• On direct products of automaton decidable theories
• ON GROUPS AND COUNTER AUTOMATA
• On groups whose word problem is solved by a counter automaton.
• On Relations Defined by Generalized Finite Automata
• Rational subsets of polycyclic monoids and valence automata
• Reachability analysis of pushdown automata: Application to model-checking
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Regular canonical systems
• Silent transitions in automata with storage
• The Comparability Graph of a Tree
• The emptiness problem for valence automata or: another decidable extension of Petri nets
• The emptiness problem for valence automata over graph monoids
• The subtrace order and counting first-order logic
• The theory of reachability of trace-pushdown systems
• Trace languages defined by regular string languages
• Transductions des langages de Chomsky

This page was built for publication: Reachability in trace-pushdown systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7266643)