Reduction and covering of infinite reachability trees
- 1 December 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 89 (2) , 144-179
- https://doi.org/10.1016/0890-5401(90)90009-7
Abstract
No abstract availableKeywords
This publication has 10 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
- The residue of vector sets with applications to decidability problems in Petri netsActa Informatica, 1985
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Homomorphisms between models of parallel computationJournal of Computer and System Sciences, 1982
- Coloured petri nets and the invariant-methodTheoretical Computer Science, 1981
- Formal verification of parallel programsCommunications of the ACM, 1976
- 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
- Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 1913