Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance

DOI10.1109/TSE.1980.230802MaRDI QIDQ3893321zbMATH OpenFDO

Authors Tadao Murata

Publication date 1980

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSE.1980.230802

zbMATH Keywords

decision-free concurrent systemslivenessmarked graphsmaximum resourceperformancePetri netsreachability classesresourcessafeness

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(4)

• A method for stepwise refinement and abstraction of Petri nets
• A note on the construction of marked graphs
• Performance evaluation of concurrent systems using Petri nets
• A theory of bipolar synchronization scheme

This page was built for publication: Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance

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