Reduction and synthesis of live and bounded free choice Petri nets

DOI10.1006/inco.1994.1080zbMath0820.68084OpenAlexW2011589240MaRDI QIDQ1336048

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)

Related Items (6)

On liveness and boundedness of asymmetric choice nets ⋮ Computing Petri net languages by reductions ⋮ Synthesis and Analysis of Product-Form Petri Nets ⋮ Structure and behavior preservation by Petri-net-based refinements in system design ⋮ Property-preserving subnet reductions for designing manufacturing systems with shared resources ⋮ Deciding branching time properties for asynchronous programs

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