Undecidable verification problems for programs with unreliable channels

DOI10.1007/3-540-58201-0_78zbMath1418.68123OpenAlexW2688386367MaRDI QIDQ4632436

Bengt Jonsson, Parosh Aziz Abdulla

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_78

zbMATH Keywords

model checkinglabeled transition systemsafety propertycomputation-tree logiceventuality property

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) Temporal logic (03B44)

Related Items (2)

Well-structured transition systems everywhere! ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Undecidable verification problems for programs with unreliable channels
• On some variants of Post's correspondence problem
• Symbolic model checking: \(10^{20}\) states and beyond
• Deciding bisimulation equivalences for a class of non-finite-state programs
• Boundedness, empty channel detection, and synchronization for communicating finite automata
• Verifying programs with unreliable channels
• Parallel program schemata
• On Communicating Finite-State Machines
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Reasoning about systems with many processes

This page was built for publication: Undecidable verification problems for programs with unreliable channels