Algorithmic analysis of programs with well quasi-ordered domains.
type: Item
instance of: scholarly article
title: Algorithmic analysis of programs with well quasi-ordered domains.
zbMATH Open document ID: 1046.68567
author: Parosh A. Abdulla
author: Kārlis Čerāns
author: Bengt Jonsson
author: Yih-Kuen Tsay
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1853112
zbMATH Keywords: decidability
zbMATH Keywords: well-structured systems
MaRDI profile type: Publication
full work available at URL: inco.1999.2843
OpenAlex ID: W2052306562
Wikidata QID: Q56901005
cites work: Undecidable verification problems for programs with unreliable channels
cites work: Q4138073
cites work: Algebra of communicating processes with abstraction
cites work: On Communicating Finite-State Machines
cites work: Q2757803
cites work: Deciding properties of integral relational automata
cites work: Reduction and covering of infinite reachability trees
cites work: Hybrid automata with finite bisimulations
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Decidability of a temporal logic problem for Petri nets
cites work: Parallel program schemata
cites work: Property preserving abstractions for the verification of concurrent systems
cites work: Analysis of a class of communicating finite state machines
DBLP publication ID: journals/iandc/AbdullaCJT00
DOI: 10.1006/INCO.1999.2843
description: scientific article; zbMATH DE number 1853112