A generalization of the procedure of karp and miller to well structured transition systems
- 1 January 1987
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 499-508
- https://doi.org/10.1007/3-540-18088-5_43
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Boundedness, empty channel detection, and synchronization for communicating finite automataTheoretical Computer Science, 1986
- An introduction to FIFO nets— monogeneous nets: A subclass of FIFO netsTheoretical Computer Science, 1985
- Priority Networks of Communicating Finite State MachinesSIAM Journal on Computing, 1985
- The residue of vector sets with applications to decidability problems in Petri netsActa Informatica, 1985
- Decidability of reachability in vector addition systems (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1982
- The theory of well-quasi-ordering: A frequently discovered conceptJournal of Combinatorial Theory, Series A, 1972
- 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