Homomorphisms between models of parallel computation

DOI10.1016/0022-0000(82)90014-9zbMATH Open0506.68047OpenAlexW2061093638MaRDI QIDQ1836982FDOQ1836982

Authors: Takumi Kasai, Raymond E. Miller 

Publication date: 1982

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(82)90014-9

zbMATH Keywords

Petri netsvector addition systemsvector replacement systemsgeneralized Petri nets

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Parallel program schemata
• Formal verification of parallel programs
• Title not available (Why is that?)
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• The equality problem for vector addition systems is undecidable
• Reduction
• On reduction of asynchronous systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Comparison of Some Theoretical Models of Parallel Computation
• Title not available (Why is that?)

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 \(\lambda\)-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)