{"docId":8316,"paperId":6078,"url":"https:\/\/lmcs.episciences.org\/6078","doi":"10.46298\/lmcs-17(3:15)2021","journalName":"Logical Methods in Computer Science","issn":"","eissn":"1860-5974","volume":[{"vid":448,"name":"Volume 17, Issue 3"}],"section":[],"repositoryName":"arXiv","repositoryIdentifier":"2002.02512","repositoryVersion":6,"repositoryLink":"https:\/\/arxiv.org\/abs\/2002.02512v6","dateSubmitted":"2020-02-10 08:51:40","dateAccepted":"2021-03-10 21:19:02","datePublished":"2021-07-30 08:50:54","titles":["Relating Apartness and Bisimulation"],"authors":["Geuvers, Herman","Jacobs, Bart"],"abstracts":["A bisimulation for a coalgebra of a functor on the category of sets can be described via a coalgebra in the category of relations, of a lifted functor. A final coalgebra then gives rise to the coinduction principle, which states that two bisimilar elements are equal. For polynomial functors, this leads to well-known descriptions. In the present paper we look at the dual notion of \"apartness\". Intuitively, two elements are apart if there is a positive way to distinguish them. Phrased differently: two elements are apart if and only if they are not bisimilar. Since apartness is an inductive notion, described by a least fixed point, we can give a proof system, to derive that two elements are apart. This proof system has derivation rules and two elements are apart if and only if there is a finite derivation (using the rules) of this fact. We study apartness versus bisimulation in two separate ways. First, for weak forms of bisimulation on labelled transition systems, where silent (tau) steps are included, we define an apartness notion that corresponds to weak bisimulation and another apartness that corresponds to branching bisimulation. The rules for apartness can be used to show that two states of a labelled transition system are not branching bismilar. To support the apartness view on labelled transition systems, we cast a number of well-known properties of branching bisimulation in terms of branching apartness and prove them. Next, we also study the more general categorical situation and show that indeed, apartness is the dual of bisimilarity in a precise categorical sense: apartness is an initial algebra and gives rise to an induction principle. In this analogy, we include the powerset functor, which gives a semantics to non-deterministic choice in process-theory."],"keywords":["Computer Science - Logic in Computer Science","Computer Science - Formal Languages and Automata Theory","D.2.4","D.3.1","F.3.1"]}