Reduction and synthesis of live and bounded free choice Petri nets

DOI10.1006/INCO.1994.1080zbMATH Open0820.68084OpenAlexW2011589240MaRDI QIDQ1336048FDOQ1336048

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

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

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)

Cited In (13)

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

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)