Behavioural abstraction in TCCS

DOI10.1007/3-540-55719-9_104zbMath1425.68299OpenAlexW1554376394WikidataQ59557035 ScholiaQ59557035MaRDI QIDQ5204347

Chris Tofts, Faron Moller

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_104

zbMATH Keywords

choice operatorcongruence relationequational theorycomputation pathsilent action

Mathematics Subject Classification ID

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

Related Items (6)

Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions ⋮ Bisimulation on speed: Worst-case efficiency ⋮ A Calculus of Countable Broadcasting Systems ⋮ On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi ⋮ Behavioural abstraction in TCCS ⋮ Congruent weak bisimulation with dense real-time

Cites Work

• Calculi for synchrony and asynchrony
• A process algebra for timed systems
• Real time process algebra
• Behavioural abstraction in TCCS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Behavioural abstraction in TCCS