The following pages link to Monoid-labeled transition systems (Q4917038):
Displaying 19 items.
- A coalgebraic perspective on linear weighted automata (Q418134) (← links)
- Structural operational semantics for non-deterministic processes with quantitative aspects (Q507377) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- Copower functors (Q1006640) (← links)
- A complete logic for behavioural equivalence in coalgebras of finitary set functors (Q1683709) (← links)
- Predicate liftings and functor presentations in coalgebraic expression languages (Q1798785) (← links)
- Resource bisimilarity and graded bisimilarity coincide (Q1944040) (← links)
- Free-lattice functors weakly preserve epi-pullbacks (Q2136297) (← links)
- Combining semilattices and semimodules (Q2233397) (← links)
- The monads of classical algebra are seldom weakly Cartesian (Q2255534) (← links)
- Connected monads weakly preserve products (Q2310433) (← links)
- Distributive laws for monotone specifications (Q2329307) (← links)
- On final coalgebras of power-set functors and saturated trees (Q2516577) (← links)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
- Minimality Notions via Factorization Systems and Examples (Q5043590) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- Convexity via Weak Distributive Laws (Q5060194) (← links)
- Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
- On the category of \(L\)-fuzzy automata, coalgebras and dialgebras (Q6081535) (← links)
