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-8zbMATH Open0902.68075OpenAlexW2109142454MaRDI QIDQ1128976FDOQ1128976
Authors: 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
Recommendations
- Extended Markovian Process Algebra
- Corrigendum to ``A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time
- scientific article; zbMATH DE number 1696898
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Process algebra for synchronous communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- Three Partition Refinement Algorithms
- Priorities in process algebras
- A timed model for communicating sequential processes
- TIC: a tImed calculus
- The algebra of timed processes, ATP: Theory and application
- A process algebra for timed systems
- Real time process algebra
- Title not available (Why is that?)
- A theory of processes with durational actions
- Reactive, generative, and stratified models of probabilistic processes
- An implementation of an efficient algorithm for bisimulation equivalence
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Probabilistic communicating processes
- Title not available (Why is that?)
- Processes with probabilities, priority and time
- Extended Markovian Process Algebra
- Probabilistic and prioritized models of timed CSP
- Title not available (Why is that?)
- CCS with priority choice
- LOTOS extended with probabilistic behaviours
- A resource-based prioritized bisimulation for real-time systems
- Specification styles in distributed systems design and verification
- Title not available (Why is that?)
- A process algebra with distributed priorities
Cited In (51)
- Reflections on the future of concurrency theory in general and process calculi in particular
- Structural analysis for stochastic process algebra models
- A theory of stochastic systems. II: Process algebra
- The how and why of interactive Markov chains
- Extended Markovian Process Algebra
- Linear Structures for Concurrency in Probabilistic Programming Languages
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- Performance preserving equivalence for stochastic process algebra dtsdPBC
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions
- An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Performance analysis of concurrent systems in algebra dtsiPBC
- On the Semantics of Markov Automata
- Equivalence relations for modular performance evaluation in dtsPBC
- Probabilistic mobile ambients
- Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time
- The theory of interactive generalized semi-Markov processes
- Formal techniques for performance analysis: blending SAN and PEPA
- Corrigendum to ``A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Weak bisimulation for probabilistic timed automata
- Solving systems of bilinear equations for transition rate reconstruction
- Process algebras for systems diagnosis.
- Optimal state-space lumping in Markov chains
- Fluid Analysis for a PEPA Model
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors
- Categories of timed stochastic relations
- Quantitative Analysis of Concurrent Reversible Computations
- Exact fluid lumpability in Markovian process algebra
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Turning back time in Markovian process algebra.
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- A brief history of process algebra
- Performance measure sensitive congruences for Markovian process algebras
- Separable equilibrium state probabilities via time reversal in Markovian process algebra
- An expressiveness study of priority in process calculi
- Reconciling real and stochastic time: the need for probabilistic refinement
- Performance evaluation in stochastic process algebra dtsdPBC
- Discrete time stochastic and deterministic Petri box calculus dtsdPBC
- Taking decisions late: end-based choice combined with action refinement
- A congruence relation for sPBC
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
- Testing from a stochastic timed system with a fault model
- Fluid approximation of broadcasting systems
- An algebra-based method to associate rewards with EMPA terms
- Process algebra for performance evaluation
- Structural operational semantics for non-deterministic processes with quantitative aspects
- Structural operational semantics for stochastic and weighted transition systems
- A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems
- Tackling continuous state-space explosion in a Markovian process algebra
- It Sometimes Works: A Lifting Algorithm for Repair of Stochastic Process Algebra Models
Uses Software
This page was built for publication: A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128976)
