Decidability Results for Well-Structured Transition Systems with Auxiliary Storage

DOI10.1007/978-3-540-74407-8_10zbMath1151.68515OpenAlexW1925933118MaRDI QIDQ3525634

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

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

Related Items (8)

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

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