
AbstractFor an arbitrary set endofunctor F we give a sufficient and necessary criterium for the existence of products of F-coalgebras. In the case of transition systems, where F=P is the covariant powerset functor, we introduce impeding paths whose existence impedes the existence of the product. Moreover we show, that the product A⊗A of a finite transition system A exists if and only if the product A⊗B for each finite transition system B exists.
products, Coalgebras, transition systems, Theoretical Computer Science, Computer Science(all)
products, Coalgebras, transition systems, Theoretical Computer Science, Computer Science(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
