Communicating sequential processes
Communicating sequential processes
Bisimulation through probabilistic testing
Information and Computation
On the solution of GSPN reward models
Performance Evaluation
Specification styles in distributed systems design and verification
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
Model checking
Distributed Algorithms
Communication and Concurrency
Modelling with Generalized Stochastic Petri Nets
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
An Algebra-Based Method to Associate Rewards with EMPA Terms
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Priority in process algebras
Compositional Asymmetric Cooperations for Process Algebras with Probabilities, Priorities, and Time
Compositional Asymmetric Cooperations for Process Algebras with Probabilities, Priorities, and Time
An Asynchronous Calculus for Generative-Reactive Probabilistic Systems
An Asynchronous Calculus for Generative-Reactive Probabilistic Systems
Reward Based Congruences: Can We Aggregate More?
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Stochastic Process Algebra: From an Algebraic Formalism to an Architectural Description Language
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Experimenting different software architectures performance techniques: a case study
WOSP '04 Proceedings of the 4th international workshop on Software and performance
QoS evaluation of IP telephony services: a specification language based simulation software tool
Systems Analysis Modelling Simulation
Metrics for finite Markov decision processes
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Modal Logic Characterization of Markovian Testing and Trace Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
Mixing logics and rewards for the component-oriented specification of performance measures
Theoretical Computer Science
Mathematical Structures in Computer Science
Combining Timed Coordination Primitives and Probabilistic Tuple Spaces
Trustworthy Global Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
A Framework for the Integration of Functional and Non-functional Analysis of Software Architectures
Electronic Notes in Theoretical Computer Science (ENTCS)
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Performance-oriented comparison of web services via client-specific testing preorders
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
A probabilistic energy-aware model for mobile ad-hoc networks
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
A methodology based on formal methods for predicting the impact of dynamic power management
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
Weak markovian bisimulation congruences and exact CTMC-Level aggregations for sequential processes
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Evaluating resistance to jamming and casual interception in mobile wireless networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Synthesizing self-adaptive connectors meeting functional and performance concerns
Proceedings of the 8th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
Behavioural equivalences and interference metrics for mobile ad-hoc networks
Performance Evaluation
| Hi-index | 5.23 |
The modeling and analysis experience with process algebras has shown the necessity of extending them with priority, probabilistic internal/external choice, and time while preserving compositionality. The purpose of this paper is to make a further step by introducing a way to express performance measures, in order to allow the modeler to capture the QoS metrics of interest. We show that the standard technique of expressing stationary and transient performance measures as weighted sums of state probabilities and transition frequencies can be imported in the process algebra framework. Technically speaking, if we denote by n ∈ N the number of performance measures of interest, in this paper we define a family of extended Markovian process algebras with generative master-reactive slaves synchronization mechanism called EMPAgrn including probabilities, priorities, exponentially distributed durations, and sequences of rewards of length n. Then we show that the Markovian bisimulation equivalence ∼MBn is a congruence for EMPAgrn which preserves the specified performance measures and we give a sound and complete axiomatization for finite EMPAgrn terms. Finally, we present a case study conducted with the software tool Two Towers in which we contrast the average performance of a selection of distributed algorithms for mutual exclusion modeled with EMPAgrn.