Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
From MaRDI portal
(Redirected from Publication:5060192)
Recommendations
- Efficient Coalgebraic Partition Refinement
- Efficient and modular 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
- Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas
Cites work
- A final coalgebra theorem
- A hierarchy of probabilistic system types
- Algebra and Coalgebra in Computer Science
- Algebra and Coalgebra in Computer Science
- An n! lower bound on formula size
- Bisimulation for labelled Markov processes
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation through probabilistic testing
- CCS expressions, finite state processes, and three problems of equivalence
- Coalgebra learning via duality
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Coproducts of monads on Set
- Describing an algorithm by Hopcroft
- Efficient and modular coalgebraic partition refinement
- Efficient Coalgebraic Partition Refinement
- Efficient minimization of DFAs with partial transition
- Evidence for Fixpoint Logic
- Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas
- Expressive logics for coalgebras via terminal sequence induction
- Expressivity of coalgebraic modal logic: the limits and beyond
- From generic partition refinement to weighted tree automata minimization
- Generating diagnostic information for behavioral preorders
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177532 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 3367098 (Why is no real title available?)
- scientific article; zbMATH DE number 7730634 (Why is no real title available?)
- Lax extensions of coalgebra functors and their logic
- Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
- Monoid-labeled transition systems
- On the size of shortest modal descriptions
- On the succinctness of some modal logics
- Predicate liftings and functor presentations in coalgebraic expression languages
- Re-describing an algorithm by Hopcroft
- Relating apartness and bisimulation
- Simple O(m n) time Markov chain lumping
- Simulations and bisimulations for coalgebraic modal logics
- Terminal coalgebras in well-founded set theory
- Three Partition Refinement Algorithms
- Universal coalgebra: A theory of systems
Cited in
(6)- Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- scientific article; zbMATH DE number 7730634 (Why is no real title available?)
- Proving behavioural apartness
- Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable
- Relating apartness and branching bisimulation games
This page was built for publication: Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060192)
