Deriving protocol specifications from service specifications
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Using partial order techniques to improve performance of data flow analysis based verification
Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Partial-Order Methods for Temporal Verification
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
The derivation of performance expressions for communication protocols from timed petri net models
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
Performance Modeling and Evaluation of Distributed Component-Based Systems Using Queueing Petri Nets
IEEE Transactions on Software Engineering
Realizability of Collaboration-based Service Specifications
APSEC '07 Proceedings of the 14th Asia-Pacific Software Engineering Conference
Unfoldings: A Partial-Order Approach to Model Checking (Monographs in Theoretical Computer Science. An EATCS Series)
Testing Systems Specified as Partial Order Input/Output Automata
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Diagnosis using unfoldings of parametric time Petri nets
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
| Hi-index | 0.00 |
This paper deals with performance modeling of distributed applications, service compositions and workflow systems. From the functional perspective, the distributed application is modeled as a collaboration involving several roles, and its behavior is defined in terms of a composition from several sub-collaborations using the standard sequencing operators found in UML Activity Diagrams and similar formalisms. From the performance perspective, each collaboration is characterized by a certain number of independent input events and dependent output events, and the performance of the collaboration is defined by the minimum delays that apply for a given output event in respect to each input event on which it depends. We use a partial order to model these delays. The paper explains how these minimum delays can be measured through testing. It also provides general formulas by which the performance of a composed collaboration can be calculated from the performance of its constituent subcollaborations and the control structure which determines the order of execution of these sub-collaborations. Proofs of correctness for these formulas are given and a simple example is discussed throughout the paper.