Decidability Results for Well-Structured Transition Systems with Auxiliary Storage

DOI10.1007/978-3-540-74407-8_10MaRDI QIDQ3525634zbMATH OpenOpenAlexFDO

Authors Rohit Chadha, Mahesh Viswanathan

Publication date 18 September 2008

Published in CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2142/11342

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Well-structured transition systems everywhere!
• Handling infinitely branching WSTS
• Algorithmic analysis of programs with well quasi-ordered domains.
• scientific article; zbMATH DE number 6790161
• Handling infinitely branching well-structured transition systems

Cited in

(9)

• Verifying parallel programs with dynamic communication structures
• General decidability results for asynchronous shared-memory programs: higher-order and beyond
• Data flow analysis of asynchronous systems using infinite abstract domains
• On the Reachability Analysis of Acyclic Networks of Pushdown Systems
• General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
• Verification of timed asynchronous programs
• The tree width of auxiliary storage
• Context-Bounded Analysis of Concurrent Queue Systems
• Deciding branching time properties for asynchronous programs

This page was built for publication: Decidability Results for Well-Structured Transition Systems with Auxiliary Storage

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