Equivalence of recursive specifications in process algebra

van der Poorten, Alf; Usenko, Yaroslav

We define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution. Then we extend this equivalence to the specification language $mu$CRL.

Additional Metadata
ACM	Software/Program Verification (acm D.2.4), Formal Definitions and Theory (acm D.3.1), Language Constructs and Features (acm D.3.3), Semantics of Programming Languages (acm F.3.2), Expressions and Their Representation (acm I.1.1)
MSC	Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (msc 68Q10), Abstract data types; algebraic specification (msc 68Q65), Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (msc 68Q85)
Publisher	CWI
Series	Software Engineering [SEN]
Organisation	Specification and Analysis of Embedded Systems
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	van der Poorten, A.& Usenko, Y. (2001). Equivalence of recursive specifications in process algebra. In Software Engineering [SEN] (R 0107). CWI.

Free Full Text ( Final Version , 220kb )

Equivalence of recursive specifications in process algebra

Publication

Publication

Address

CWI researchers

Questions or comments?

Equivalence of recursive specifications in process algebra

Publication

Publication

Workflow

Workflow

Add Content