Recursive nested Petri Nets: Analysis of semantic properties and expessibility

DOI10.1023/A:1010914603293MaRDI QIDQ1403182zbMATH OpenFDO

Authors Irina A. Lomazova

Publication date 1 September 2003

Published in Programming and Computer Software (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Recursive Petri nets
• scientific article; zbMATH DE number 1522994
• Nested Petri nets: Multi-level and recursive systems.
• scientific article; zbMATH DE number 1836397
• Coverability, termination, and finiteness in recursive Petri nets

Cited in

(8)

• scientific article; zbMATH DE number 4055006 (Why is no real title available?)
• Recursive Petri nets
• Coverability and Termination in Recursive Petri Nets
• Solving recursive net equations
• scientific article; zbMATH DE number 1522994 (Why is no real title available?)
• scientific article; zbMATH DE number 1836397 (Why is no real title available?)
• Coverability, termination, and finiteness in recursive Petri nets
• Nested Petri nets: Multi-level and recursive systems.

This page was built for publication: Recursive nested Petri Nets: Analysis of semantic properties and expessibility

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