Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/iandc/AbdullaCJT00, #quickstatements; #temporary_batch_1731468600454
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/inco.1999.2843 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052306562 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56901005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable verification problems for programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra of communicating processes with abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding properties of integral relational automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction and covering of infinite reachability trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid automata with finite bisimulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of a temporal logic problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property preserving abstractions for the verification of concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a class of communicating finite state machines / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/iandc/AbdullaCJT00 / rank
 
Normal rank

Latest revision as of 04:54, 13 November 2024

scientific article
Language Label Description Also known as
English
Algorithmic analysis of programs with well quasi-ordered domains.
scientific article

    Statements

    Identifiers