On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
A compositional approach to performance modelling
A compositional approach to performance modelling
Theoretical Computer Science
Discrete time process algebra with silent step
Proof, language, and interaction
Process Algebra with Timing
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
General distributions in process algebra
Lectures on formal methods and performance analysis
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Model checking stochastic automata
ACM Transactions on Computational Logic (TOCL)
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems
IEEE Transactions on Software Engineering
Real-Time Process Algebra with Stochastic Delays
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Extending Timed Process Algebra with Discrete Stochastic Time
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
A theory of Stochastic systems. Part II: Process algebra
Information and Computation
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Hi-index | 0.00 |
We present a process-algebraic framework for performance evaluation of discrete-time discrete-event systems. The modeling of the system builds on a process algebra with conditionallydistributed discrete-time delays and generally-distributed stochastic delays. In the general case, the performance analysis is done with the toolset of the modeling language χ by means of discrete-event simulation. The process-algebraic setting allows for expansion laws for the parallel composition and the maximal progress operator, so one can directly manipulate the process terms and transform the specification in a required form. This approach is illustrated by specifying and solving the recursive specification of the G/G/1/∞ queue, as well as by specifying a variant of the concurrent alternating bit protocol with generally-distributed unreliable channels. In a specific situation when all delays are assumed deterministic, we turn to performance analysis of probabilistic timed systems. This work employs discrete-time probabilistic reward graphs, which comprise deterministic delays and immediate probabilistic choices. Here, we extend previous investigations on the topic, which only touched long-run analysis, to tackle transient analysis as well. The theoretical results obtained allow us to extend the χ-toolset. For illustrative purposes, we analyze the concurrent alternating bit protocol in the extended environment of the χ-toolset using discrete-event simulation for generallydistributed channels, the developed analytical method for deterministic channels, and Markovian analysis for exponentially-distributed delays.