Algorithmic Analysis of Programs with Well Quasi-ordered Domains
- 1 July 2000
- journal article
- Published by Elsevier in Information and Computation
- Vol. 160 (1-2) , 109-127
- https://doi.org/10.1006/inco.1999.2843
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Undecidable Verification Problems for Programs with Unreliable ChannelsInformation and Computation, 1996
- Property preserving abstractions for the verification of concurrent systemsFormal Methods in System Design, 1995
- Analysis of a class of communicating finite state machinesActa Informatica, 1992
- Reduction and covering of infinite reachability treesInformation and Computation, 1990
- Decidability of a temporal logic problem for Petri netsTheoretical Computer Science, 1990
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Parallel program schemataJournal of Computer and System Sciences, 1969
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952
- Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 1913