Deciding observational congruence of finite-state CCS expressions by rewriting

DOI10.1016/0304-3975(94)00074-SzbMATH Open0874.68155OpenAlexW2006283215MaRDI QIDQ673974FDOQ673974

P. Inverardi, Monica Nesi

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00074-s

zbMATH Keywords

term rewritingobservational congruence

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic laws for nondeterminism and concurrency
• A calculus of communicating systems
• Testing equivalences for processes
• Branching time and abstraction in bisimulation semantics
• Conditional rewriting logic as a unified model of concurrency
• A complete axiomatisation for observational congruence of finite-state behaviours
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• A note on the notation of recursion in process algebras
• A rewriting strategy to verify observational congruence

Cited In (2)

• Title not available (Why is that?)
• Infinite normal forms for non-linear term rewriting systems

This page was built for publication: Deciding observational congruence of finite-state CCS expressions by rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673974)