Path category for free - Open morphisms from coalgebras with non-deterministic branching

@inproceedings{Wimann2019PathCF,
  title={Path category for free - Open morphisms from coalgebras with non-deterministic branching},
  author={Thorsten Wi{\ss}mann and J{\'e}r{\'e}my Dubut and Shin-ya Katsumata and Ichiro Hasuo},
  booktitle={FoSSaCS},
  year={2019}
}
There are different categorical approaches to variations of transition systems and their bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span of G-coalgebra homomorphism. Another one is in terms of path categories and open morphisms, where a bisimulation is defined as a span of open morphisms. This similarity is no coincidence: given a functor G, fulfilling certain conditions, we derive a path-category for pointed G-coalgebras and lax homomorphisms, such… 
Bisimilarity of Diagrams
TLDR
It is proved that checking bisimilarity and satisfiability of a positive formula by a diagram are both decidable by reducing to a problem of existence of invertible matrices with linear conditions, which in turn reduces to the existential theory of the reals.
A coalgebraic view on reachability
TLDR
This work provides an iterative construction of the reachable part of a given pointed coalgebra that is inspired by and resembles the standard breadth-first search procedure to compute the Reachable partof a graph.
Minimality Notions via Factorization Systems
TLDR
This article relates the two aspects of minimization on coalgebras by defining an abstract notion of minimality, and finds criteria on the category that ensure uniqueness, existence, and functoriality of the minimization aspects.
Codensity Games for Bisimilarity
TLDR
This paper presents a general framework that uniformly describes game characterizations of bisimilarity-like notions, formalized categorically using fibrations and coalgebras and allows us to derive codensity bis similarity games: a general categorical game characterization of bis similarity.
Minimality Notions via Factorization Systems and Examples
TLDR
This article relates the two aspects of minimization on coalgebras by defining an abstract notion of minimality, and finds criteria on the category that ensure uniqueness, existence, and functoriality of the minimization aspects.

References

SHOWING 1-10 OF 27 REFERENCES
Regular Behaviours with Names
TLDR
A concrete description of the rational fixpoint for functors arising from so-called binding signatures with exponentiation, such as those arising in coalgebraic models of infinitary λ-terms and various flavours of automata is obtained.
Generic Trace Semantics and Graded Monads
TLDR
A notion of graded algebras is introduced and it is shown how they play the role of formulas in trace logics and how they come with a notion of depth that corresponds, e.g., to trace length or bisimulation depth.
Universal coalgebra: a theory of systems
Pointwise extensions of GSOS-defined operations
TLDR
It is shown that given an abstract GSOS specification ρ that defines operations σ on a final F-coalgebra, it is possible to systematically construct aGSOS specificationπ that defines the pointwise extension σ of ρ on afinal FA-coal algebra.
Bisimulation from Open Maps
TLDR
A logic, generalising Hennessy?Milner logic, which is characteristic for the generalised notion of bisimulation is presented, which makes possible a uniform definition of bisIMulation across a range of different models for parallel computation presented as categories.
Generic Trace Semantics via Coinduction
TLDR
The application field of coalgebras is extended, providing a new instance of the principle "process semantics via coinduction" of bisimilarity, namely coinductions in a Kleisli category.
On path-based coalgebras and weak notions of bisimulation
TLDR
It is shown that recording executions (up to a notion of stuttering), rather than the set of successor states, from a state is sufficient to characterise branching bisimulation in both cases.
Nominal Automata with Name Binding
TLDR
An automaton model over nominal sets is introduced, regular nondeterministic nominal automata RNNA, which have a natural coalgebraic definition using abstraction sets to capture transitions that read a fresh letter from the input word.
Bisimulation and Open Maps for Timed Transition Systems
TLDR
A category of timed transition systems is defined, and it is shown how to characterise standard timed bisimulation in terms of spans of open maps with a natural choice of a path category.
A new approach to abstract syntax involving binders
  • M. Gabbay, A. Pitts
  • Computer Science
    Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
  • 1999
TLDR
It is shown that in FM-set theory one can express statements quantifying over 'fresh' names and this is used to give a novel set-theoretic interpretation of name abstraction.
...
...