Process algebra with timing

zbMath1021.68063MaRDI QIDQ1847280

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

Publication date: 17 November 2002

Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

zbMATH Keywords

operational semanticstiming model

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (36)

Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation ⋮ Continuity controlled hybrid automata ⋮ Syntax and consistent equation semantics of hybrid Chi ⋮ Specification, testing and implementation relations for symbolic-probabilistic systems ⋮ On Rule Formats for Zero and Unit Elements ⋮ Service oriented computing from a process algebraic perspective ⋮ Duplication of constants in process algebra ⋮ SOS formats and meta-theory: 20 years after ⋮ A process calculus with finitary comprehended terms ⋮ Unnamed Item ⋮ Virtually timed ambients: a calculus of nested virtualization ⋮ Revisiting timing in process algebra. ⋮ An alternative formulation of operational conservativity with binding terms. ⋮ SAT-based verification for timed component connectors ⋮ Rule formats for determinism and idempotence ⋮ Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions ⋮ Repairing time-determinism in the process algebra for hybrid systems ⋮ A timed calculus for wireless systems ⋮ Process algebra with strategic interleaving ⋮ Hybrid process algebra ⋮ Notions of bisimulation and congruence formats for SOS with data ⋮ SOS rule formats for zero and unit elements ⋮ Fixing Zeno gaps ⋮ A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? ⋮ A brief history of process algebra ⋮ Process algebra for hybrid systems ⋮ Bisimulation on speed: a unified approach ⋮ Suitability of mCRL2 for Concurrent-System Design: A 2 × 2 Switch Case Study ⋮ An algebra of hybrid systems ⋮ A barred operational semantics for a subset of WS-CDL with time restrictions ⋮ Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption ⋮ Process algebraic modelling of attentional capture and human electrophysiology in interactive systems ⋮ Extending Timed Process Algebra with Discrete Stochastic Time ⋮ Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi ⋮ Executable rewriting logic semantics of Orc and formal analysis of Orc programs

This page was built for publication: Process algebra with timing