All congruences below stability-preserving fair testing or CFFD

DOI10.1007/s00236-019-00364-4zbMath1452.68128OpenAlexW3021938598WikidataQ109285145 ScholiaQ109285145MaRDI QIDQ2182664

Antti Valmari

Publication date: 26 May 2020

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-019-00364-4

zbMATH Keywords

choicecongruencetesting equivalenceCCSlabeled transition systemsbisimilarityparallel compositiontrace equivalencestability-preserving equivalence

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

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weakest deadlock-preserving congruence
• Fair testing
• Probabilistic algorithm for testing primality
• Compositional failure-based semantic models for basic LOTOS
• Understanding concurrent systems
• On constructibility and unconstructibility of LTS operators from other LTS operators
• All Linear-Time Congruences for Familiar Operators
• The Coarsest Precongruences Respecting Safety and Liveness Properties
• Computation Tree Logic with Deadlock Detection
• The Beginning of Model Checking: A Personal Perspective
• Three logics for branching bisimulation
• Branching time and abstraction in bisimulation semantics

This page was built for publication: All congruences below stability-preserving fair testing or CFFD