Reduction and synthesis of live and bounded free choice Petri nets

DOI10.1006/INCO.1994.1080MaRDI QIDQ1336048zbMATHOpenAlexFDO

Authors Javier Esparza

Publication date 12 October 1994

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1994.1080

zbMATH Keywords

reduction rulesfree choice Petri nets

Mathematics Subject Classification ID

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

Recommendations

• Synthesis of bounded choice-free Petri nets
• Free Choice Petri Nets
• Bounded choice-free Petri net synthesis: algorithmic issues
• Petri Net Synthesis for Restricted Classes of Nets
• Synthesis of live and bounded persistent systems

Cited in

(16)

• Property-preserving subnet reductions for designing manufacturing systems with shared resources
• Hierarchical reduction method for analysis and decomposition of Petri nets
• Reduction using induced subnets to systematically prove properties for free-choice nets
• Generalized Petri Net Reduction Method
• On liveness and boundedness of asymmetric choice nets
• A reduced maximality labeled transition system generation for recursive Petri nets
• Computer-based reduction technique for Petri nets
• Deciding branching time properties for asynchronous programs
• Synthesis and analysis of product-form Petri nets
• Structural reductions revisited
• Structure and behavior preservation by Petri-net-based refinements in system design
• Reduction rules for reset/inhibitor nets
• Liveness and boundedness analysis of Petri net synthesis
• Computing Petri net languages by reductions
• Reachability in live and safe free-choice Petri nets is NP-complete
• Automated Technology for Verification and Analysis

This page was built for publication: Reduction and synthesis of live and bounded free choice Petri nets

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