scientific article

zbMath1006.68100MaRDI QIDQ2760247

C. A. Middelburg, Jos C. M. Baeten

Publication date: 21 March 2002

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

zbMATH Keywords

ACP

Mathematics Subject Classification ID

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

Related Items (19)

Expired data collection in shared dataspaces. ⋮ Decidability and complexity of action-based temporal planning over dense time ⋮ Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation ⋮ Continuity controlled hybrid automata ⋮ Bisimulation on speed: Lower time bounds ⋮ Bisimulation on speed: Worst-case efficiency ⋮ Revisiting timing in process algebra. ⋮ An alternative formulation of operational conservativity with binding terms. ⋮ Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination ⋮ Variable binding operators in transition system specifications ⋮ A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets ⋮ Real time process algebra with time-dependent conditions ⋮ Process algebra for hybrid systems ⋮ Decidability of performance equivalence for basic parallel processes ⋮ Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format ⋮ Generating priority rewrite systems for OSOS process languages ⋮ Bialgebraic methods and modal logic in structural operational semantics ⋮ Discussion on: ``Formal specification method for systems automation ⋮ Process-algebraic approaches for multi-agent systems: an overview

This page was built for publication: