Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Inter-operability of Workflow Applications: Local Criteria for Global Soundness
Business Process Management, Models, Techniques, and Empirical Studies
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
A survey of behaviour and equivalence preserving refinements of Petri nets
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Information and Computation
Proof Techniques for Adapter Generation
Web Services and Formal Methods
Deciding service composition and substitutability using extended operating guidelines
Data & Knowledge Engineering
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
The Computer Journal
Trading Off Concurrency to Generate Behavioral Adapters
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
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
Operating guidelines for finite-state services
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Contract based multi-party service composition
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Workflow model compositions preserving relaxed soundness
BPM'06 Proceedings of the 4th international conference on Business Process Management
Constructing replaceable services using operating guidelines and maximal controllers
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Refinement of synchronizable places with multi-workflow nets: weak termination preserved
PETRI NETS'11 Proceedings of the 32nd international conference on Applications 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
Analyzing Compatibility of Services via Resource Conformance
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |
Soundness is one of the well-studied properties of processes; it denotes that a final state can be reached from every state that is reachable from the initial state. Soundness-preserving refinements are important for enabling the compositional design of systems. In this paper we concentrate on refinements of service compositions. We model service compositions using Petri nets, and consider specific pairs of places that belong to different services. Starting from a sound service composition, we show how to check whether such a pair of places can be refined by another sound service composition, so that soundness is preserved through the refinement.