Priority in process algebra.
From MaRDI portal
Publication:2760249
zbMATH Open1062.68079MaRDI QIDQ2760249FDOQ2760249
Gerald Lüttgen, V. Natarajan, Rance Cleaveland
Publication date: 2001
Cited In (25)
- Title not available (Why is that?)
- Stochastic biological modelling in the presence of multiple compartments
- Compositional verification of priority systems using sharp bisimulation
- Efficient stochastic simulation of biological systems with multiple variable volumes
- Foundational aspects of multiscale modeling of biological systems with process algebras
- On the axiomatizability of priority. II
- A process algebra with distributed priorities
- Preferential choice and coordination conditions
- Title not available (Why is that?)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- QoS negotiation in service composition
- Replacement freeness: a criterion for separating process calculi
- CCS with priority guards
- Priority and abstraction in process algebra
- Expressing priorities and external probabilities in process algebra via mixed open/closed systems
- An expressiveness study of priority in process calculi
- Rigorous Discretization of Hybrid Systems Using Process Calculi
- Encoding catalytic P systems in {\(\pi\)}\@
- On the axiomatisability of priority. III: Priority strikes again
- Branching time and orthogonal bisimulation equivalence
- Stochastic and Real Time in Process Algebra: A Conceptual Overview
- Revisiting interactive Markov chains
- Ensuring liveness properties of distributed systems: open problems
- Algebraic theory of probabilistic processes.
- Specification, testing and implementation relations for symbolic-probabilistic systems
This page was built for publication: Priority in process algebra.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760249)
