Attacking the Dimensionality Problem of Parameterized Systems via Bounded Reachability Graphs

DOI10.1007/978-3-642-29320-7_15MaRDI QIDQ2894567zbMATH OpenOpenAlexFDO

Authors Qiusong Yang, Bei Zhang, Jian Zhai, Mingshu Li

Publication date 29 June 2012

Published in Fundamentals of Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29320-7_15

Mathematics Subject Classification ID

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

• On the reachability of a version of graph-rewriting system
• Reachability in parameterized systems: all flavors of threshold automata
• Bounded model checking with parametric data structures
• scientific article; zbMATH DE number 4128405
• Reachability of scope-bounded multistack pushdown systems
• Reachability in graph transformation systems and slice languages
• Diagram-based verification of parameterized systems
• Parameterized systems in BIP: design and model checking
• On the fixed-parameter tractability of parameterized model-checking problems
• Reachability analysis based on structured representations

Cited in

(1)

• Widening with Thresholds for Programs with Complex Control Graphs

This page was built for publication: Attacking the Dimensionality Problem of Parameterized Systems via Bounded Reachability Graphs

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