Parameterized Verification of Communicating Automata under Context Bounds

DOI10.1007/978-3-319-11439-2_4zbMath1448.68286OpenAlexW131957635MaRDI QIDQ3447694

Paul Gastin, Jana Schubert, Benedikt Bollig

Publication date: 28 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11439-2_4

Mathematics Subject Classification ID

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Unnamed Item, Verification of Parameterized Communicating Automata via Split-Width

Cites Work

• Haskell overloading is DEXPTIME-complete
• Verifying programs with unreliable channels
• Bounded Phase Analysis of Message-Passing Programs
• All for the Price of Few
• Parameterized Model Checking of Token-Passing Systems
• Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
• On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks
• Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
• On Communicating Finite-State Machines
• Logic for communicating automata with parameterized topology
• Parameterized Verification of Broadcast Networks of Register Automata
• Computer Science Logic
• The tree width of auxiliary storage
• Context-Bounded Analysis of Concurrent Queue Systems
• On Reasoning About Rings
• Tools and Algorithms for the Construction and Analysis of Systems
• Reachability Analysis of Communicating Pushdown Systems