Deciding observational congruence of finite-state CCS expressions by rewriting

DOI10.1016/0304-3975(94)00074-SMaRDI QIDQ673974zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A rewriting strategy to verify observational congruence
• scientific article; zbMATH DE number 3878352
• A modal characterization of observational congruence on finite terms of CCS
• Rewriting approximations for properties verification over CCS specifications
• CCS expressions, finite state processes, and three problems of equivalence

Cites work

• scientific article; zbMATH DE number 4164155 (Why is no real title available?)
• scientific article; zbMATH DE number 3986627 (Why is no real title available?)
• scientific article; zbMATH DE number 4056992 (Why is no real title available?)
• scientific article; zbMATH DE number 8327 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 58291 (Why is no real title available?)
• scientific article; zbMATH DE number 176143 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 3448081 (Why is no real title available?)
• A calculus of communicating systems
• A complete axiomatisation for observational congruence of finite-state behaviours
• A note on the notation of recursion in process algebras
• A rewriting strategy to verify observational congruence
• Algebraic laws for nondeterminism and concurrency
• Branching time and abstraction in bisimulation semantics
• Conditional rewriting logic as a unified model of concurrency
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Testing equivalences for processes

Cited in

(6)

• A rewriting strategy to verify observational congruence
• A complete axiomatisation for observational congruence of finite-state behaviours
• A modal characterization of observational congruence on finite terms of CCS
• scientific article; zbMATH DE number 3878352 (Why is no real title available?)
• Rewriting approximations for properties verification over CCS specifications
• 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)