Bisimulations and Unfolding in P-Accessible Categorical Models

In this paper, we propose a categorical framework for bisimulations and unfoldings that unifies the classical approach from Joyal and al. via open maps and unfoldings. This is based on a notion of categories accessible with respect to a subcategory of path shapes, i.e., for which one can define a nice notion of trees as glueing of paths. We prove that transitions systems and pre sheaf models are a particular case of our framework. We also prove that in our framework, several characterizations of bisimulation coincide, in particular an "operational one" akin to the standard definition in transition systems. Also, accessibility is preserved by coreflexions. We then design a notion of unfolding, which has good properties in the accessible case: its is a right adjoint and is a universal covering, i.e., initial among the morphisms that have the unique lifting property with respect to path shapes. As an application, we prove that the universal covering of a groupoid, a standard construction in algebraic topology, coincides with an unfolding, when the category of path shapes is well chosen.

[1]  R. Ho Algebraic Topology , 2022 .

[2]  Glynn Winskel,et al.  Models for Concurrency , 1994 .

[3]  Javier Esparza,et al.  Unfoldings - A Partial-Order Approach to Model Checking , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[4]  Ieke Moerdijk,et al.  A Completeness Theorem for Open Maps , 1994, Ann. Pure Appl. Log..

[5]  George J. Pappas,et al.  Approximate bisimulation for a class of stochastic hybrid systems , 2006, 2006 American Control Conference.

[6]  Michael Makkai,et al.  Accessible categories: The foundations of categorical model theory, , 2007 .

[7]  Glynn Winskel,et al.  A New Definition of Morphism on Petri Nets , 1984, STACS.

[8]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[9]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[10]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[11]  S. Shankar Sastry,et al.  Hybrid Systems with Finite Bisimulations , 1997, Hybrid Systems.

[12]  May,et al.  A Concise Course in Algebraic Topology , 1999 .