Inevitability in concurrent systems

DOI10.1016/0020-0190(87)90164-5zbMATH Open0653.68011OpenAlexW2029123368MaRDI QIDQ1107977FDOQ1107977

Authors: Edward Ochmański 

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90164-5

Recommendations

• Inevitability in diamond processes
• Concurrent systems and inevitability
• Structure of concurrency
• scientific article; zbMATH DE number 23767
• scientific article; zbMATH DE number 1185853

zbMATH Keywords

partially ordered setsPetri netconcurrent systemsconcurrent processinevitability

Mathematics Subject Classification ID

Partial orders, general (06A06) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Trace consistency and inevitability
• Progress assumption in concurrent systems
• Inevitability in diamond processes
• Concurrent systems and inevitability
• Unavoidable languages, cuts and innocent sets of words
• Inventories of unavoidable languages and the word-extension conjecture
• Title not available (Why is that?)
• Detecting causal relationships in distributed computations: In search of the holy grail

This page was built for publication: Inevitability in concurrent systems

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