Timing and causality in process algebra

DOI10.1007/s002360050047zbMath0858.68036OpenAlexW2155852086MaRDI QIDQ1924998

Luca Aceto, David J. Murphy

Publication date: 27 October 1996

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050047

zbMATH Keywords

concurrency theorytimed process algebratransition system semantics

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions ⋮ Semantic domains of timed event structures ⋮ Bisimulation on speed: Lower time bounds ⋮ Bisimulation on speed: Worst-case efficiency ⋮ Timing and causality in process algebra ⋮ On the coarsest congruence within global-clock-bounded equivalence ⋮ revTPL: The Reversible Temporal Process Language ⋮ Timed mobility in process algebra and Petri nets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi ⋮ The Expressive Power of Urgent, Lazy and Busy-Waiting Actions in Timed Processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unifying behavioral equivalences of timed transition systems ⋮ Refinement of actions for real-time concurrent systems with causal ambiguity ⋮ Metric semantics for true concurrent real time ⋮ On testing urgency through laziness over processes with durational actions ⋮ Decidability of performance equivalence for basic parallel processes ⋮ Bisimulation on speed: a unified approach ⋮ On the semantics of durational actions ⋮ On performance congruences for process algebras ⋮ Absolute versus relative time in process algebras. ⋮ A timed concurrent constraint language.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models for concurrency: Towards a classification
• A complete axiomatization of timed bisimulation for a class of timed regular behaviours
• Observing localities
• Failures semantics based on interval semiwords is a congruence for refinement
• A partial ordering semantics for CCS
• On interprocess communication. I: Basic formalism
• Substitution revisited
• Global renaming operators in concrete process algebra
• Petri net semantics of priority systems
• Unique decomposition of processes
• The algebra of timed processes, ATP: Theory and application
• An operational semantics for timed CSP
• A process algebra for timed systems
• Timing and causality in process algebra
• Towards action-refinement in process algebras
• Real time process algebra
• Distributed bisimulations
• Axiomatising Finite Concurrent Processes
• Process Algebra