scientific article

zbMath1062.68079MaRDI QIDQ2760249

No author found.

Publication date: 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

process algebraparallelism

Mathematics Subject Classification ID

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

Related Items (21)

Specification, testing and implementation relations for symbolic-probabilistic systems ⋮ Branching time and orthogonal bisimulation equivalence ⋮ Rigorous Discretization of Hybrid Systems Using Process Calculi ⋮ Priority and abstraction in process algebra ⋮ Preferential choice and coordination conditions ⋮ Unnamed Item ⋮ QoS negotiation in service composition ⋮ Algebraic theory of probabilistic processes. ⋮ On the axiomatisability of priority. III: Priority strikes again ⋮ Foundational aspects of multiscale modeling of biological systems with process algebras ⋮ Replacement freeness: a criterion for separating process calculi ⋮ CCS with priority guards ⋮ Unnamed Item ⋮ On the axiomatizability of priority. II ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Stochastic biological modelling in the presence of multiple compartments ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ Encoding Catalytic P Systems in π@ ⋮ Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems ⋮ Stochastic and Real Time in Process Algebra: A Conceptual Overview ⋮ Efficient Stochastic Simulation of Biological Systems with Multiple Variable Volumes

This page was built for publication: