A method for stepwise refinement and abstraction of Petri nets
From MaRDI portal
Publication:1052100
DOI10.1016/0022-0000(83)90029-6zbMath0515.68051OpenAlexW1997871183MaRDI QIDQ1052100
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
Related Items (20)
On liveness and boundedness of asymmetric choice nets ⋮ Property-preserving transformations of elementary net systems based on morphisms ⋮ A mathematical model for system design and refinement ⋮ Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets ⋮ Functional equivalences of Petri nets ⋮ Nested-unit Petri nets ⋮ Reduction of Workflow Nets for Generalised Soundness Verification ⋮ Adequacy-preserving transformations of COSY path programs ⋮ Composition colored Petri nets for the refinement of reaction-based models ⋮ Refinement of Synchronizable Places with Multi-workflow Nets ⋮ Design and implementation of a Petri net based supervisor for a flexible manufacturing system ⋮ Methods for behavior descriptions of structure-complex 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 ⋮ Petri net reactive modules ⋮ Refining and verifying regular Petri nets ⋮ A coordination theory for intelligent machines ⋮ Failures semantics based on interval semiwords is a congruence for refinement ⋮ Translation validation of coloured Petri net models of programs on integers ⋮ Zero-safe nets: Comparing the collective and individual token approaches.
Cites Work
- Unnamed Item
- Relevance of network theory to models of distributed/parallel processing
- 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
- Analysis of Petri nets by stepwise refinements
- Reduction and expansion of live and safe marked graphs
- Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance
This page was built for publication: A method for stepwise refinement and abstraction of Petri nets