A process algebra for timed systems

DOI10.1006/inco.1995.1041zbMath0826.68068OpenAlexW2001026449MaRDI QIDQ1892877

Publication date: 10 July 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bb8eab15c398ac263808f411b32d676b0c9b52a9

zbMATH Keywords

process algebra

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)

Related Items (67)

Sound reasoning in \textit{tock}-CSP ⋮ Recursion induction for real-time processes ⋮ 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 ⋮ A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces ⋮ Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions ⋮ Timed testing of concurrent systems ⋮ Bisimulation on speed: Lower time bounds ⋮ Duplication of constants in process algebra ⋮ The reversible temporal process language ⋮ Discrete time process algebra ⋮ Bisimulation on speed: Worst-case efficiency ⋮ Timing and causality in process algebra ⋮ A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time ⋮ Unnamed Item ⋮ An algebraic framework for developing and maintaining real-time systems ⋮ A process algebra of communicating shared resources with dense time and priorities ⋮ Virtually timed ambients: a calculus of nested virtualization ⋮ An algebraic theory of multiple clocks ⋮ Revisiting timing in process algebra. ⋮ Composition methods for constructing characteristic formulas for dense-time models ⋮ Lang-n-Send Extended: Sending Regular Expressions to Monitors ⋮ Faster asynchronous systems. ⋮ A model of actors and grey failures ⋮ revTPL: The Reversible Temporal Process Language ⋮ A semantic theory of the Internet of things ⋮ A timed calculus for wireless systems ⋮ Testing equivalences of time Petri nets ⋮ Unnamed Item ⋮ A timed semantics of Orc ⋮ Timing-Sensitive Noninterference through Composition ⋮ A process calculus approach to detection and mitigation of PLC malware ⋮ A complete axiomatization of timed bisimulation for a class of timed regular behaviours ⋮ A brief history of Timed CSP ⋮ Unnamed Item ⋮ The Expressive Power of Urgent, Lazy and Busy-Waiting Actions in Timed Processes ⋮ On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS ⋮ A Calculus of Cyber-Physical Systems ⋮ Fast asynchronous systems in dense time ⋮ Unnamed Item ⋮ Process algebra for hybrid systems ⋮ Bisimulation on speed: a unified approach ⋮ On the semantics of durational actions ⋮ Behavioural abstraction in TCCS ⋮ Testing from a stochastic timed system with a fault model ⋮ A Timed Process Algebra for Wireless Networks with an Application in Routing ⋮ The Expressive Power of Monotonic Parallel Composition ⋮ A probabilistic calculus of cyber-physical systems ⋮ Semantics and expressiveness of ordered SOS ⋮ Generating priority rewrite systems for OSOS process languages ⋮ Semantic Analysis of Gossip Protocols for Wireless Sensor Networks ⋮ On performance congruences for process algebras ⋮ A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA ⋮ Formal models and analysis of secure multicast in wired and wireless networks ⋮ Raiders of the lost equivalence: probabilistic branching bisimilarity ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ Discrete time generative-reactive probabilistic processes with different advancing speeds ⋮ Absolute versus relative time in process algebras. ⋮ A timed concurrent constraint language. ⋮ Ordered SOS process languages for branching and eager bisimulations ⋮ Stochastic and Real Time in Process Algebra: A Conceptual Overview ⋮ Extensions of Standard Weak Bisimulation Machinery: Finite-state General Processes, Refinable Actions, Maximal-progress and Time ⋮ Executable rewriting logic semantics of Orc and formal analysis of Orc programs ⋮ Denotational fixed-point semantics for constructive scheduling of synchronous concurrency ⋮ Bisimulation indexes and their applications ⋮ Efficiency of asynchronous systems, read arcs, and the MUTEX-problem ⋮ An efficiency preorder for processes

This page was built for publication: A process algebra for timed systems