A method for stepwise refinement and abstraction of Petri nets

DOI10.1016/0022-0000(83)90029-6MaRDI QIDQ1052100zbMATH OpenOpenAlexFDO

Authors Ichiro Suzuki, Tadao Murata

Publication date 1983

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(83)90029-6

zbMATH Keywords

abstractionPetri netsstepwise refinementanalysis of Petri netssynthesis of Petri nets

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3557247 (Why is no real title available?)
• Analysis of Petri nets by stepwise refinements
• Net theory and applications. Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, October 8-19, 1979. Ed. by Wilfried Brauer
• Reduction and expansion of live and safe marked graphs
• Relevance of network theory to models of distributed/parallel processing
• Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance

Cited in

(20)

• Failures semantics based on interval semiwords is a congruence for refinement
• Functional equivalences of Petri nets
• Nested-unit Petri nets
• Structure and behavior preservation by Petri-net-based refinements in system design
• Refining and verifying regular Petri nets
• Composition colored Petri nets for the refinement of reaction-based models
• Reduction of workflow nets for generalised soundness verification
• Property-preserving subnet reductions for designing manufacturing systems with shared resources
• Zero-safe nets: Comparing the collective and individual token approaches.
• Refinement of synchronizable places with multi-workflow nets. Weak termination preserved!
• Design and implementation of a Petri net based supervisor for a flexible manufacturing system
• Property-preserving transformations of elementary net systems based on morphisms
• Petri net reactive modules
• Adequacy-preserving transformations of COSY path programs
• A mathematical model for system design and refinement
• On liveness and boundedness of asymmetric choice nets
• Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
• Methods for behavior descriptions of structure-complex Petri nets
• A coordination theory for intelligent machines
• Translation validation of coloured Petri net models of programs on integers

This page was built for publication: A method for stepwise refinement and abstraction of Petri nets

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