Homomorphisms between models of parallel computation
From MaRDI portal
(Redirected from Publication:1836982)
Cites work
- scientific article; zbMATH DE number 3466521 (Why is no real title available?)
- scientific article; zbMATH DE number 3557247 (Why is no real title available?)
- scientific article; zbMATH DE number 3624775 (Why is no real title available?)
- scientific article; zbMATH DE number 3420254 (Why is no real title available?)
- A Comparison of Some Theoretical Models of Parallel Computation
- Formal verification of parallel programs
- On reduction of asynchronous systems
- Parallel program schemata
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Reduction
- The equality problem for vector addition systems is undecidable
Cited in
(6)- Testing for unboundedness of fifo channels
- Reduction and covering of infinite reachability trees
- Simulation, reduction and preservation of correctness properties of parallel systems
- An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
- A polynomial -bisimilar normalization for reset Petri nets
- On termination and phase changes in the presence of unreliable communication
This page was built for publication: Homomorphisms between models of parallel computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836982)