Absolute versus relative time in process algebras.

DOI10.1006/inco.1999.2821zbMath1046.68618OpenAlexW1970078694MaRDI QIDQ1854325

Flavio Corradini

Publication date: 14 January 2003

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

Full work available at URL: https://doi.org/10.1006/inco.1999.2821

zbMATH Keywords

real-time systemsclosed interval process algebratemporal CCSTimed process algebras

Mathematics Subject Classification ID

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

Related Items

Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions ⋮ Duplication of constants in process algebra ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Strategy based semantics for mobility with time and access permissions ⋮ revTPL: The Reversible Temporal Process Language ⋮ Timed mobility in process algebra and Petri nets ⋮ The Expressive Power of Urgent, Lazy and Busy-Waiting Actions in Timed Processes ⋮ On the semantics of durational actions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of processes with durational actions
• Transition system specifications with negative premises
• A timed model for communicating sequential processes
• A calculus of mobile processes. I
• On performance congruences for process algebras
• An efficiency preorder for processes
• A process algebra for timed systems
• Timed testing of concurrent systems
• Timing and causality in process algebra
• Real time process algebra
• Branching time and abstraction in bisimulation semantics
• Dynamic matrices and the cost analysis of concurrent programs

This page was built for publication: Absolute versus relative time in process algebras.