Monoid-labeled transition systems

DOI10.1016/S1571-0661(04)80908-3MaRDI QIDQ4917038zbMATH OpenOpenAlexFDO

Authors H. Peter Gumm, T. 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

zbMATH Keywords

bisimulationcoalgebrafuzzy transitionmultisetrefinable monoid, distributive latticetransition systemweak pullback preservation

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Coalgebras for fuzzy transition systems
• Copower functors
• Bisimulation of labelled state-to-function transition systems coalgebraically
• Enhanced coalgebraic bisimulation
• An exercise on transition systems

Cites work

• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Coalgebraic logic
• Functors for coalgebras
• scientific article; zbMATH DE number 3717392 (Why is no real title available?)
• scientific article; zbMATH DE number 3758407 (Why is no real title available?)
• scientific article; zbMATH DE number 45228 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 626734 (Why is no real title available?)
• scientific article; zbMATH DE number 1497879 (Why is no real title available?)
• L-fuzzy sets
• Operations with structures
• Universal coalgebra: A theory of systems

Cited in

(32)

• Copower functors
• A complete logic for behavioural equivalence in coalgebras of finitary set functors
• Predicate liftings and functor presentations in coalgebraic expression languages
• Resource bisimilarity and graded bisimilarity coincide
• Free-lattice functors weakly preserve epi-pullbacks
• Combining semilattices and semimodules
• The monads of classical algebra are seldom weakly Cartesian
• Connected monads weakly preserve products
• Distributive laws for monotone specifications
• On final coalgebras of power-set functors and saturated trees
• Coalgebras for fuzzy transition systems
• Multiplicative transition systems
• Deriving Syntax and Axioms for Quantitative Regular Behaviours
• scientific article; zbMATH DE number 4201644 (Why is no real title available?)
• A coalgebraic perspective on linear weighted automata
• scientific article; zbMATH DE number 1107491 (Why is no real title available?)
• Distributive laws for monotone specifications
• Minimality Notions via Factorization Systems and Examples
• Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
• Convexity via Weak Distributive Laws
• Structural operational semantics for non-deterministic processes with quantitative aspects
• Efficient Coalgebraic Partition Refinement
• Efficient and modular coalgebraic partition refinement
• Quantitative Kleene coalgebras
• Enhanced coalgebraic bisimulation
• STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
• Over Which Monoids is the Transducer Determinization Procedure Applicable?
• On the category of \(L\)-fuzzy automata, coalgebras and dialgebras
• On L-fuzzy automata, coalgebras and dialgebras: associated categories and L-fuzzy topologies
• Proving behavioural apartness
• Identity-preserving Lax extensions and where to find them
• A no-go theorem for coalgebraic product construction

This page was built for publication: Monoid-labeled transition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917038)