F
Filippo Bonchi
Researcher at University of Pisa
Publications - 135
Citations - 2413
Filippo Bonchi is an academic researcher from University of Pisa. The author has contributed to research in topics: Operational semantics & Bisimulation. The author has an hindex of 24, co-authored 133 publications receiving 2091 citations. Previous affiliations of Filippo Bonchi include Centrum Wiskunde & Informatica & Centre national de la recherche scientifique.
Papers
More filters
Proceedings ArticleDOI
Checking NFA equivalence with bisimulations up to congruence
Filippo Bonchi,Damien Pous +1 more
TL;DR: B bisimulation up to congruence is introduced as a technique for proving language equivalence of non-deterministic finite automata and an optimisation of the classical algorithm by Hopcroft and Karp is devised.
Journal ArticleDOI
Generalizing determinization from automata to coalgebras
TL;DR: This paper lifts the powerset construction from automata to the more general framework of coal- gebras with structured state spaces and shows how to characterize coalgebraically several equivalences which have been object of interest in the concurrency community, such as failure or ready semantics.
Journal ArticleDOI
Interacting Hopf algebras
TL;DR: The axioms of IHR are derived using Lack's approach to composing PROPs: they feature two Hopf algebra and two Frobenius algebra structures on four different monoid–comonoid pairs, instrumental in showing that IHR is isomorphic to the PROP of linear relations.
Book ChapterDOI
A Categorical Semantics of Signal Flow Graphs
TL;DR: A sound and complete graphical theory of vector subspaces over the field of polynomial fractions, with relational composition, constructed in modular fashion, using Lack's approach to composing PROPs with distributive laws.
Proceedings ArticleDOI
Full Abstraction for Signal Flow Graphs
TL;DR: This paper equips signal flow graphs with a structural operational semantics, and classifies the ways in which any graph can be realised -- rewritten, using the graphical theory, into an executable form where the operational behavior and the denotation coincides.