Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
From MaRDI portal
Publication:5060192
DOI10.46298/lmcs-18(4:6)2022OpenAlexW4309680698MaRDI QIDQ5060192
Stefan Milius, Thorsten Wißmann, Lutz Schröder
Publication date: 9 January 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.11175v3
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the succinctness of some modal logics
- Expressive logics for coalgebras via terminal sequence induction
- A hierarchy of probabilistic system types
- CCS expressions, finite state processes, and three problems of equivalence
- Bisimulation through probabilistic testing
- Universal coalgebra: A theory of systems
- Re-describing an algorithm by Hopcroft
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Predicate liftings and functor presentations in coalgebraic expression languages
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- From generic partition refinement to weighted tree automata minimization
- Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas
- Coalgebra learning via duality
- Lax extensions of coalgebra functors and their logic
- Terminal coalgebras in well-founded set theory
- Expressivity of coalgebraic modal logic: the limits and beyond
- Bisimulation for labelled Markov processes
- Describing an algorithm by Hopcroft
- Simulations and Bisimulations for Coalgebraic Modal Logics
- Coproducts of Monads on Set
- Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
- Simple O(m logn) Time Markov Chain Lumping
- Three Partition Refinement Algorithms
- Efficient Minimization of DFAs with Partial Transition Functions
- Monoid-labeled transition systems
- A final coalgebra theorem
- Efficient Coalgebraic Partition Refinement
- Generating diagnostic information for behavioral preorders
- An n ! lower bound on formula size
- Evidence for Fixpoint Logic
- Algebra and Coalgebra in Computer Science
- Algebra and Coalgebra in Computer Science
