Process algebra for performance evaluation

DOI10.1016/S0304-3975(00)00305-4zbMath0992.68149OpenAlexW2160136100WikidataQ57802062 ScholiaQ57802062MaRDI QIDQ5958464

Joost-Pieter Katoen, Holger Hermanns, Ulrich Herzog

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00305-4

zbMATH Keywords

process algebraperformance evaluationbisimulationsemanticsaxiomatisationcontinuous-time Markov chainlumpabilityresource-sharing systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (26)

Stuttering for Abstract Probabilistic Automata ⋮ Behavioural equivalences of a probabilistic pi-calculus ⋮ Structural operational semantics for stochastic and weighted transition systems ⋮ Quantitative Analysis of Concurrent Reversible Computations ⋮ On the use of MTBDDs for performability analysis and verification of stochastic systems. ⋮ Model-checking large structured Markov chains. ⋮ Mirrors and memory in quantum automata ⋮ Stuttering for abstract probabilistic automata ⋮ Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains ⋮ Parameter and Controller Synthesis for Markov Chains with Actions and State Labels. ⋮ On the Relationships Between Lumpability and Filtering of Finite Stochastic Systems ⋮ A compositional modelling and analysis framework for stochastic hybrid systems ⋮ Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses ⋮ Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking ⋮ A congruence relation for sPBC ⋮ Performability assessment by model checking of Markov reward models ⋮ Constraint Markov chains ⋮ Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines ⋮ Model checking mobile stochastic logic ⋮ The How and Why of Interactive Markov Chains ⋮ On fluidization of discrete event models: Observation and control of continuous Petri nets ⋮ Compositional Abstraction for Stochastic Systems ⋮ A theory of stochastic systems. II: Process algebra ⋮ Structural operational semantics for continuous state stochastic transition systems ⋮ Bisimulation and Simulation Relations for Markov Chains ⋮ YMCA

Uses Software

• PEPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic and prioritized models of timed CSP
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Bisimulation through probabilistic testing
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• LOTOS extended with probabilistic behaviours
• Formal performance modelling and evaluation of an adaptive mechanism for packetised audio over the internet
• A theory of timed automata
• Computer performance evaluation - modelling techniques and tools. 7th International Conference, Vienna, Austria, May 3-6, 1994. Proceedings
• Processes with probabilities, priority and time
• A general conservative extension theorem in process algebras with inequalities
• Composition and behaviors of probabilistic I/O automata
• An operational semantics for timed CSP
• Reactive, generative, and stratified models of probabilistic processes
• Axiomatizing probabilistic processes: ACP with generative probabilities
• Automated compositional Markov chain generation for a plain-old telephone system
• Finite state Markovian decision processes
• Real time process algebra
• Finite Continuous Time Markov Chains
• Specifications in stochastic process algebra for a robot control problem
• Exact and ordinary lumpability in finite Markov chains
• Branching time and abstraction in bisimulation semantics
• An algebra-based method to associate rewards with EMPA terms
• Compositional performance modelling with the TIPPtool
• Product form solution for a class of PEPA models

This page was built for publication: Process algebra for performance evaluation