Efficient and modular coalgebraic partition refinement
From MaRDI portal
Computational methods in Markov chains (60J22) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Analysis of algorithms (68W40)
Recommendations
- Efficient Coalgebraic Partition Refinement
- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
- From generic partition refinement to weighted tree automata minimization
- A partition refinement algorithm for the -calculus
Cites work
- A calculus of communicating systems
- A distributed algorithm for strong bisimulation reduction of state spaces
- A final coalgebra theorem
- A hierarchy of probabilistic system types
- A new foundation for finitary corecursion and iterative algebras
- An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
- An efficient algorithm for computing bisimulation equivalence
- An efficient algorithm to determine probabilistic bisimulation
- An optimal lower bound on the number of variables for graph identification
- Backward and forward bisimulation minimization of tree automata
- Bisimilarity Minimization in O(m logn) Time
- Bisimulation for labelled Markov processes
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- Bisimulation minimization and symbolic model checking
- Bisimulation relations for weighted automata
- Bisimulation through probabilistic testing
- CCS expressions, finite state processes, and three problems of equivalence
- Deciding bisimilarity and similarity for probabilistic processes.
- Describing an algorithm by Hopcroft
- Efficient and modular coalgebraic partition refinement
- Formal verification of timed properties of randomized distributed algorithms
- From generic partition refinement to weighted tree automata minimization
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
- scientific article; zbMATH DE number 5761737 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 46168 (Why is no real title available?)
- scientific article; zbMATH DE number 149518 (Why is no real title available?)
- scientific article; zbMATH DE number 575948 (Why is no real title available?)
- scientific article; zbMATH DE number 1064116 (Why is no real title available?)
- scientific article; zbMATH DE number 1971280 (Why is no real title available?)
- scientific article; zbMATH DE number 1927574 (Why is no real title available?)
- scientific article; zbMATH DE number 195102 (Why is no real title available?)
- Introduction to coalgebra. Towards mathematics of states and observation
- Introduction to extensive and distributive categories
- Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
- Monoid-labeled transition systems
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- On the final sequence of a finitary set functor
- Optimal state-space lumping in Markov chains
- Re-describing an algorithm by Hopcroft
- Sheaves in geometry and logic: a first introduction to topos theory
- Simple O(m n) time Markov chain lumping
- Structural Operational Semantics for Weighted Transition Systems
- Three Partition Refinement Algorithms
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Universal coalgebra: A theory of systems
Cited in
(11)- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
- From generic partition refinement to weighted tree automata minimization
- Playing with abstraction and representation
- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
- Minimality Notions via Factorization Systems and Examples
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
- Efficient Coalgebraic Partition Refinement
- Efficient and modular coalgebraic partition refinement
- Lowerbounds for Bisimulation by Partition Refinement
- Distributed coalgebraic partition refinement
- Generic partition refinement and weighted tree automata
This page was built for publication: Efficient and modular coalgebraic partition refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214815)
