Transformations and decompositions of nets
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Free choice Petri nets
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Soundness and separability of workflow nets in the stepwise refinement approach
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Workflow soundness revisited: checking correctness in the presence of data while staying conceptual
CAiSE'10 Proceedings of the 22nd international conference on Advanced information systems engineering
Construction of asynchronous communicating systems: weak termination guaranteed!
SC'10 Proceedings of the 9th international conference on Software composition
Soundness-preserving refinements of service compositions
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Designing weakly terminating ROS systems
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Refinement of Synchronizable Places with Multi-workflow Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
Hi-index | 0.00 |
Stepwise refinement is a well-known strategy in system modeling. The refinement rules should preserve essential behavioral properties, such as deadlock freedom, boundedness and weak termination. A well-known example is the refinement rule that replaces a safe place of a Petri net with a sound workflow net. In this case a token on the refined place undergoes a procedure that is modeled in detail by the refining workflow net. We generalize this rule to component-based systems, where in the first, high-level, refinement iterations we often encounter in different components places that represent in fact the counterparts of the same procedure "simultaneously" executed by the components. The procedure involves communication between these components. We model such a procedure as a multi-workflow net, which is actually a composition of communicating workflows. Behaviorally correct multiworkflow nets have the weak termination property. The weak termination requirement is also applied to the system being refined. We want to refine selected places in different components with a multi-workflow net in such a way that the weak termination property is preserved through refinements. We introduce the notion of synchronizable places and show that a sufficient condition for preserving weak termination is that the places to be refined are synchronizable. We give a method to decide if a given set of places is synchronizable.