A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
From MaRDI portal
Publication:1128976
DOI10.1016/S0304-3975(97)00127-8zbMath0902.68075OpenAlexW2109142454MaRDI QIDQ1128976
Marco Bernardo, Roberto Gorrieri
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00127-8
Related Items
Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions, A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, Performance analysis of concurrent systems in algebra dtsiPBC, Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC, Solving systems of bilinear equations for transition rate reconstruction, A compositional model to reason about end-to-end QoS in stochastic Reo connectors, An algebra-based method to associate rewards with EMPA terms, Formal techniques for performance analysis: blending SAN and PEPA, Weak bisimulation for probabilistic timed automata, Structural operational semantics for stochastic and weighted transition systems, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Tackling continuous state-space explosion in a Markovian process algebra, Quantitative Analysis of Concurrent Reversible Computations, On the use of MTBDDs for performability analysis and verification of stochastic systems., Turning back time in Markovian process algebra., Reconciling real and stochastic time: the need for probabilistic refinement, Discrete time stochastic and deterministic Petri box calculus dtsdPBC, Exact fluid lumpability in Markovian process algebra, Structural operational semantics for non-deterministic processes with quantitative aspects, On the Semantics of Markov Automata, Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses, Unnamed Item, A congruence relation for sPBC, Linear Structures for Concurrency in Probabilistic Programming Languages, Equivalence relations for modular performance evaluation in dtsPBC, A randomized encoding of the \(\pi\)-calculus with mixed choice, Corrigendum to ``A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA, A brief history of process algebra, Process algebra for performance evaluation, The How and Why of Interactive Markov Chains, Structural Analysis for Stochastic Process Algebra Models, Testing from a stochastic timed system with a fault model, Categories of Timed Stochastic Relations, Probabilistic mobile ambients, Optimal state-space lumping in Markov chains, Fluid approximation of broadcasting systems, Fluid Analysis for a PEPA Model, Performance evaluation in stochastic process algebra dtsdPBC, A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems, An expressiveness study of priority in process calculi, A theory of stochastic systems. II: Process algebra, Separable equilibrium state probabilities via time reversal in Markovian process algebra, Process algebras for systems diagnosis., It Sometimes Works: A Lifting Algorithm for Repair of Stochastic Process Algebra Models, Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular, The theory of interactive generalized semi-Markov processes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic communicating processes
- A theory of processes with durational actions
- Probabilistic and prioritized models of timed CSP
- Priorities in process algebras
- An implementation of an efficient algorithm for bisimulation equivalence
- A timed model for communicating sequential processes
- Bisimulation through probabilistic testing
- Specification styles in distributed systems design and verification
- TIC: a tImed calculus
- LOTOS extended with probabilistic behaviours
- A resource-based prioritized bisimulation for real-time systems
- The algebra of timed processes, ATP: Theory and application
- Processes with probabilities, priority and time
- CCS with priority choice
- A process algebra for timed systems
- Reactive, generative, and stratified models of probabilistic processes
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Real time process algebra
- Process algebra for synchronous communication
- Three Partition Refinement Algorithms
- A process algebra with distributed priorities
- Extended Markovian Process Algebra
