Bounded concurrency

DOI10.1007/BFB0036184MaRDI QIDQ5055935zbMATH OpenOpenAlexFDO

Authors Damas Gruska

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0036184

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 17792
• Resource control for synchronous cooperative threads
• CONCUR 2004 - Concurrency Theory
• Alternation and bounded concurrency are reverse equivalent.
• Applying Formal Methods: Testing, Performance, and M/E-Commerce

Cites work

• A theory of processes with durational actions
• Discrete time process algebra
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 108007 (Why is no real title available?)
• scientific article; zbMATH DE number 176137 (Why is no real title available?)
• scientific article; zbMATH DE number 176759 (Why is no real title available?)
• The difference between splitting in \(n\) and \(n+1\)

Cited in

(4)

• Alternation and bounded concurrency are reverse equivalent.
• Constraints meet concurrency
• Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
• CONCUR 2004 - Concurrency Theory

This page was built for publication: Bounded concurrency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055935)