FORWARD ANALYSIS OF DYNAMIC NETWORK OF PUSHDOWN SYSTEMS IS EASIER WITHOUT ORDER

DOI10.1142/S0129054111008453zbMath1216.68192MaRDI QIDQ3016220

Denis Lugiez

Publication date: 14 July 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

concurrent programsstatic analysisweighted tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Model checking dynamic pushdown networks

Cites Work

• XML schema, tree logic and sheaves automata
• Semigroups, Presburger formulas, and languages
• Unnamed Item

This page was built for publication: FORWARD ANALYSIS OF DYNAMIC NETWORK OF PUSHDOWN SYSTEMS IS EASIER WITHOUT ORDER