Recursive Petri nets

DOI10.1007/S00236-007-0055-YMaRDI QIDQ2464034zbMATH OpenOpenAlexFDO

Authors Denis Poitrenaud, Serge Haddad

Publication date 10 December 2007

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-007-0055-y

zbMATH Keywords

bisimulationdecidabilityfinitenessreachability

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1836397
• Recursive nested Petri Nets: Analysis of semantic properties and expessibility
• scientific article; zbMATH DE number 1341756
• Coverability, termination, and finiteness in recursive Petri nets
• Dynamic Recursive Petri Nets

Cites work

• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2004
• scientific article; zbMATH DE number 1686274 (Why is no real title available?)
• scientific article; zbMATH DE number 3646295 (Why is no real title available?)
• scientific article; zbMATH DE number 46872 (Why is no real title available?)
• scientific article; zbMATH DE number 3612451 (Why is no real title available?)
• scientific article; zbMATH DE number 3628412 (Why is no real title available?)
• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• scientific article; zbMATH DE number 1231560 (Why is no real title available?)
• scientific article; zbMATH DE number 1341756 (Why is no real title available?)
• scientific article; zbMATH DE number 559221 (Why is no real title available?)
• scientific article; zbMATH DE number 1049168 (Why is no real title available?)
• scientific article; zbMATH DE number 1088051 (Why is no real title available?)
• scientific article; zbMATH DE number 1522994 (Why is no real title available?)
• scientific article; zbMATH DE number 1383199 (Why is no real title available?)
• scientific article; zbMATH DE number 1836397 (Why is no real title available?)
• Petri nets and regular processes
• Process rewrite systems.
• Rational sets in commutative monoids
• The covering and boundedness problems for vector addition systems
• Undecidability of bisimilarity for Petri nets and some related problems

Cited in

(23)

• Finite Petri nets as models for recursive causal behaviour
• Recursive nested Petri Nets: Analysis of semantic properties and expessibility
• A well-structured framework for analysing Petri net extensions
• Boundedness of adaptive nets is decidable
• Formal verification of complex business processes based on high-level Petri nets
• Petri nets with name creation for transient secure association
• The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
• Time Recursive Petri Nets
• Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
• scientific article; zbMATH DE number 4055006 (Why is no real title available?)
• scientific article; zbMATH DE number 1341756 (Why is no real title available?)
• Solving recursive net equations
• scientific article; zbMATH DE number 1836397 (Why is no real title available?)
• Coverability, termination, and finiteness in recursive Petri nets
• Dynamic Recursive Petri Nets
• Forward analysis for WSTS. III: Karp-Miller trees
• Forward analysis for WSTS. III: Karp-Miller trees
• On functions weakly computable by pushdown Petri nets and related systems
• Process net reconstruction from the sequence of Petri net transition triggerings
• Recursion and Petri nets
• Coverability and Termination in Recursive Petri Nets
• Verifying unboundedness via amalgamation
• A reduced maximality labeled transition system generation for recursive Petri nets

Describes a project that uses

Uses Software

• Renew
• UMDES
• SYROCO

This page was built for publication: Recursive Petri nets

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