Verifying lossy channel systems has nonprimitive recursive complexity
Top Cited Papers
- 15 September 2002
- journal article
- research article
- Published by Elsevier BV in Information Processing Letters
- Vol. 83 (5), 251-261
- https://doi.org/10.1016/s0020-0190(01)00337-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Well-structured transition systems everywhere!Theoretical Computer Science, 2001
- Nonprimitive recursive complexity and undecidability for Petri net equivalencesTheoretical Computer Science, 2001
- Algorithmic Analysis of Programs with Well Quasi-ordered DomainsInformation and Computation, 2000
- Undecidable Verification Problems for Programs with Unreliable ChannelsInformation and Computation, 1996
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- Unreliable Channels Are Easier to Verify Than Perfect ChannelsInformation and Computation, 1996
- Decidability of the termination problem for completely specified protocolsDistributed Computing, 1994
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- The equality problem for vector addition systems is undecidableTheoretical Computer Science, 1976
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952