A precongruence format for should testing preorder

DOI10.1016/j.jlap.2010.03.001zbMath1208.68108OpenAlexW2024848178MaRDI QIDQ974134

Xiaowei Huang, Weiming Lu, Li Jiao

Publication date: 27 May 2010

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2010.03.001

zbMATH Keywords

structural operational semanticstesting theoryrule formatshould testing preorder

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural operational semantics for weak bisimulations
• Transition system specifications with negative premises
• Fair testing
• SOS formats and meta-theory: 20 years after
• Higher-level synchronising devices in Meije-SCCS
• A calculus of communicating systems
• Structured operational semantics and bisimulation as a congruence
• Testing equivalences for processes
• Finite axiom systems for testing preorder and De Simone process languages
• Ordered SOS process languages for branching and eager bisimulations
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
• Rooted branching bisimulation as a congruence
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• Process Algebra
• Communicating sequential processes
• Bisimulation can't be traced
• Precongruence formats for decorated trace semantics
• Theoretical Aspects of Computing – ICTAC 2005
• Liveness, Fairness and Impossible Futures

This page was built for publication: A precongruence format for should testing preorder