Pages that link to "Item:Q3801084"
From MaRDI portal
The following pages link to Three Partition Refinement Algorithms (Q3801084):
Displaying 38 items.
- Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking (Q5415660) (← links)
- Deriving Bisimulations by Simplifying Partitions (Q5452714) (← links)
- Computing Simulations over Tree Automata (Q5458323) (← links)
- An Incremental Bisimulation Algorithm (Q5458835) (← links)
- The Secret Life of Keys: On the Calculation of Mechanical Lock Systems (Q5738136) (← links)
- Minimization of Finite State Automata Through Partition Aggregation (Q5738999) (← links)
- Equivalence relations for modular performance evaluation in dtsPBC (Q5740349) (← links)
- (Q5856411) (← links)
- Timing-Sensitive Information Flow Analysis for Synchronous Systems (Q5862523) (← links)
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application (Q5863634) (← links)
- Time abstracted bisimulation: Implicit specifications and decidability (Q5890046) (← links)
- Symbolic computation of differential equivalences (Q5920213) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q5967094) (← links)
- On divergence-sensitive weak probabilistic bisimilarity (Q6040671) (← links)
- An algebraic theory of multiple clocks (Q6044116) (← links)
- A process algebra with distributed priorities (Q6104364) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
- Formal lumping of polynomial differential equations through approximate equivalences (Q6113017) (← links)
- Lowerbounds for Bisimulation by Partition Refinement (Q6135758) (← links)
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs (Q6151151) (← links)
- Robust stutter bisimulation for abstraction and controller synthesis with disturbance (Q6152513) (← links)
- Compatibility of refining and controlling plant automata with bisimulation quotients (Q6174416) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices (Q6202755) (← links)
- Computing the fuzzy partition corresponding to the greatest fuzzy auto-bisimulation of a fuzzy graph-based structure under the Gödel semantics (Q6496169) (← links)
- A new genetic algorithm encoding for coalition structure generation problems (Q6534466) (← links)
- Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis (Q6535518) (← links)
- Incremental dead state detection in logarithmic time (Q6535537) (← links)
- Distributed coalgebraic partition refinement (Q6535613) (← links)
- Generic partition refinement and weighted tree automata (Q6535955) (← links)
- Sparse suffix and LCP array: simple, direct, small, and fast (Q6547927) (← links)
- Incremental NFA minimization (Q6558632) (← links)
- Decidability results in automata and process theory (Q6560390) (← links)
- Performance preserving equivalence for stochastic process algebra dtsdPBC (Q6587404) (← links)
- Relation coarsest partition method to observability of probabilistic Boolean networks (Q6588406) (← links)
- Two simple but efficient algorithms to recognize Robinson dissimilarities (Q6657924) (← links)