Reachability Analysis of Communicating Pushdown Systems
From MaRDI portal
Publication:5894957
DOI10.2168/LMCS-8(3:23)2012zbMath1248.68330MaRDI QIDQ5894957
Alexander Heußner, Grégoire Sutre, Anca Muscholl, Jérôme Leroux
Publication date: 22 October 2012
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Realizability of concurrent recursive programs, Parameterized Verification of Communicating Automata under Context Bounds, Ordered multi-stack visibly pushdown automata, The complexity of model checking multi-stack systems, Multiparty half-duplex systems and synchronous communications, Unnamed Item, Reachability relations of timed pushdown automata, Bounded Context Switching for Valence Systems, Reachability analysis of reversal-bounded automata on series-parallel graphs, On the path-width of integer linear programming, Unnamed Item, Data Multi-Pushdown Automata
