Distributed coalgebraic partition refinement
From MaRDI portal
Publication:6535613
DOI10.1007/978-3-030-99527-0_9zbMATH Open1547.68467MaRDI QIDQ6535613
Stefan Milius, Hans-Peter Deifel, Fabian Birkmann
Publication date: 1 February 2024
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- CCS expressions, finite state processes, and three problems of equivalence
- Optimal state-space lumping in Markov chains
- A calculus of communicating systems
- Bisimulation through probabilistic testing
- Deciding bisimilarity is P-complete
- Universal coalgebra: A theory of systems
- Re-describing an algorithm by Hopcroft
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- From generic partition refinement to weighted tree automata minimization
- Bisimulation relations for weighted automata
- Bisimulation for labelled Markov processes
- Describing an algorithm by Hopcroft
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- A distributed algorithm for strong bisimulation reduction of state spaces
- A hierarchy of probabilistic system types
- Distributed branching bisimulation reduction of state spaces
- Simple Bisimilarity Minimization in O(m log n) Time
- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
- Sigref – A Symbolic Bisimulation Tool Box
- Simple O(m logn) Time Markov Chain Lumping
- Bisimilarity Minimization in O(m logn) Time
- Three Partition Refinement Algorithms
- Efficient Coalgebraic Partition Refinement
- Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
- Bisimulation Minimisation for Weighted Tree Automata
This page was built for publication: Distributed coalgebraic partition refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535613)
