Equivalence of recursive specifications in process algebra

DOI10.1016/S0020-0190(01)00218-6zbMath1003.68088MaRDI QIDQ1607118

Yaroslav S. Usenko, Alban Ponse

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

process algebraspecification language\(\mu\)CRLrecursive specifications

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Linearization in parallel pCRL ⋮ A thread calculus with molecular dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the consistency of Koomen's fair abstraction rule
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Algebraic solutions to recursion schemes
• Process Algebra
• Linearization in parallel pCRL

This page was built for publication: Equivalence of recursive specifications in process algebra