Monoid-labeled transition systems
From MaRDI portal
Publication:4917038
DOI10.1016/S1571-0661(04)80908-3zbMath1260.68240OpenAlexW1996864014MaRDI QIDQ4917038
H. Peter Gumm, Tobias Schröder
Publication date: 26 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80908-3
coalgebrabisimulationtransition systemmultisetfuzzy transitionrefinable monoid, distributive latticeweak pullback preservation
Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Minimality Notions via Factorization Systems and Examples, Free-lattice functors weakly preserve epi-pullbacks, Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence, Convexity via Weak Distributive Laws, Deriving Syntax and Axioms for Quantitative Regular Behaviours, Unnamed Item, A complete logic for behavioural equivalence in coalgebras of finitary set functors, On the category of \(L\)-fuzzy automata, coalgebras and dialgebras, A coalgebraic perspective on linear weighted automata, Resource bisimilarity and graded bisimilarity coincide, Enhanced coalgebraic bisimulation, Unnamed Item, Combining semilattices and semimodules, Structural operational semantics for non-deterministic processes with quantitative aspects, Quantitative Kleene coalgebras, The monads of classical algebra are seldom weakly Cartesian, Predicate liftings and functor presentations in coalgebraic expression languages, On final coalgebras of power-set functors and saturated trees, Copower functors, Connected monads weakly preserve products, Efficient Coalgebraic Partition Refinement, Distributive laws for monotone specifications
Cites Work
