Apartness and distinguishing formulas in Hennessy-Milner logic

DOI10.1007/978-3-031-15629-8_14zbMath1524.68216MaRDI QIDQ6163888

Herman Geuvers

Publication date: 26 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal Separating Sequences for All Pairs of States
• Algebraic laws for nondeterminism and concurrency
• Testing Software Design Modeled by Finite-State Machines
• Three logics for branching bisimulation
• Branching time and abstraction in bisimulation semantics
• An O(m log n) algorithm for branching bisimilarity on labelled transition systems
• Tools and algorithms for the construction and analysis of systems. 28th international conference, TACAS 2022, held as part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2--7, 2022. Proceedings. Part I

This page was built for publication: Apartness and distinguishing formulas in Hennessy-Milner logic