On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions

DOI10.18255/1818-1015-2020-2-234-253OpenAlexW3037203494MaRDI QIDQ5060067FDOQ5060067

Authors: Vladimir A. Bashkin 

Publication date: 17 January 2023

Published in: Modeling and Analysis of Information Systems (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mais715

Recommendations

• Resource equivalences in Petri nets
• scientific article; zbMATH DE number 1555184
• On minimality and equivalence of Petri nets
• On complexity of reachability of transition restricted Petri nets
• A Reachability Algorithm for General Petri Nets Based on Transition Invariants
• scientific article; zbMATH DE number 1432334
• Approximating Petri net reachability along context-free traces
• Approximate transient analysis for subclasses of deterministic and stochastic Petri nets
• Nonprimitive recursive complexity and undecidability for Petri net equivalences
• A notion of equivalence for stochastic Petri nets

zbMATH Keywords

approximationPetri netsinvisible transitionsresource equivalence

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A calculus of communicating systems
• Title not available (Why is that?)
• Resource equivalences in Petri nets
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Resource bisimulation in Petri nets
• Resource equivalences in Petri nets

This page was built for publication: On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions

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