Stepwise development of process-algebraic specifications in decorated trace semantics

DOI10.1007/S10703-005-1631-9zbMath1083.68080OpenAlexW2022068375MaRDI QIDQ816202

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

verificationprocess algebrarefinementspecification

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)

Uses Software

• CADP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weakest deadlock-preserving congruence
• Bisimulation and divergence
• An implementation of an efficient algorithm for bisimulation equivalence
• Adding action refinement to a finite process algebra
• Compositional failure-based semantic models for basic LOTOS
• Testing equivalence as a bisimulation equivalence
• Acceptance trees
• Three Partition Refinement Algorithms

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