Three measures for synchronic dependence in Petri nets

DOI10.1007/BF00290730zbMath0504.68032MaRDI QIDQ1836303

Ichiro Suzuki, Tadao Kasami

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

complexityreachabilityweight vectortransition firings

Mathematics Subject Classification ID

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

Related Items (6)

Deciding a class of path formulas for conflict-free Petri nets ⋮ A unified approach for deciding the existence of certain petri net paths ⋮ \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems ⋮ Refinement of Synchronizable Places with Multi-workflow Nets ⋮ ON YEN'S PATH LOGIC FOR PETRI NETS ⋮ Fair relation and modified synchronic distances in a Petri net

Cites Work

• Some decision problems related to the reachability problem for Petri nets
• Parallel program schemata
• The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three measures for synchronic dependence in Petri nets