Stepwise development of process-algebraic specifications in decorated trace semantics

DOI10.1007/S10703-005-1631-9MaRDI QIDQ816202zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 20 February 2006

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10703-005-1631-9

zbMATH Keywords

process algebrarefinementspecificationverification

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)

Recommendations

• scientific article; zbMATH DE number 176759
• scientific article; zbMATH DE number 4180788
• Algebraic specification of concurrent systems
• scientific article; zbMATH DE number 139814
• Towards action-refinement in process algebras

Cites work

• Acceptance trees
• Adding action refinement to a finite process algebra
• An implementation of an efficient algorithm for bisimulation equivalence
• Bisimulation and divergence
• Compositional failure-based semantic models for basic LOTOS
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• Testing equivalence as a bisimulation equivalence
• The weakest deadlock-preserving congruence
• Three Partition Refinement Algorithms

Describes a project that uses

Uses Software

• CADP

This page was built for publication: Stepwise development of process-algebraic specifications in decorated trace semantics

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