Deciding branching time properties for asynchronous programs
type: Item
instance of: scholarly article
title: Deciding branching time properties for asynchronous programs
zbMATH Open document ID: 1187.68313
author: Rohit Chadha
author: Mahesh Viswanathan
published in: Theoretical Computer Science
publication date: 2009-10-09T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68N19
zbMATH DE Number: 5612510
zbMATH Keywords: asynchronous programs
zbMATH Keywords: well-structured transition systems
zbMATH Keywords: model checking
MaRDI profile type: MaRDI publication profile
full work available at URL: j.tcs.2009.01.021
OpenAlex ID: W2166873473
cites work: Algorithmic analysis of programs with well quasi-ordered domains.
cites work: Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
cites work: Reduction and synthesis of live and bounded free choice Petri nets
cites work: Well-structured transition systems everywhere!
cites work: Interprocedural analysis of asynchronous programs
cites work: The theory of well-quasi-ordering: a frequently discovered concept
cites work: Model Checking Multithreaded Programs with Asynchronous Atomic Methods
cites work: Context-Bounded Analysis of Concurrent Queue Systems
DOI: 10.1016/J.TCS.2009.01.021
Recommended article: Verifying liveness for asynchronous programs
Recommended article: General decidability results for asynchronous shared-memory programs: higher-order and beyond
Recommended article: Verification of asynchronous programs with nested locks
Recommended article: Analyzing Asynchronous Programs with Preemption
Recommended article: Model Checking Multithreaded Programs with Asynchronous Atomic Methods
description: scientific article; zbMATH DE number 5612510