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

DOI10.1109/TSE.1980.230802zbMath0447.68063MaRDI QIDQ3893321

Tadao Murata

Publication date: 1980

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

zbMATH Keywords

performancelivenessPetri netsresourcesmarked graphssafenessdecision-free concurrent systemsmaximum resourcereachability classes

Mathematics Subject Classification ID

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

Related Items (4)

A note on the construction of marked graphs ⋮ Performance evaluation of concurrent systems using Petri nets ⋮ A method for stepwise refinement and abstraction of 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