Pages that link to "Item:Q3801084"
From MaRDI portal
The following pages link to Three Partition Refinement Algorithms (Q3801084):
Displaying 50 items.
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- A large-scale assessment of exact lumping of quantitative models in the biomodels repository (Q2238205) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation (Q2254614) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Unwinding biological systems (Q2348024) (← links)
- Employing behavioral preorders to define controllability for nondeterministic discrete-event systems (Q2348368) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Doubly lexical ordering of dense 0--1 matrices (Q2366069) (← links)
- Testing equivalence as a bisimulation equivalence (Q2366163) (← links)
- Priority and abstraction in process algebra (Q2381506) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- On the relations between Markov chain lumpability and reversibility (Q2406431) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Deadlock-freedom in component systems with architectural constraints (Q2441719) (← links)
- Rainbow domination and related problems on strongly chordal graphs (Q2446318) (← links)
- A logical framework for privacy-preserving social network publication (Q2447175) (← links)
- Deciding orthogonal bisimulation (Q2461535) (← links)
- Bisimulation relations for weighted automata (Q2481957) (← links)
- Fast algorithms for identifying maximal common connected sets of interval graphs (Q2499592) (← links)
- Evaluating the quality of image matrices in blockmodeling (Q2516355) (← links)
- A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
- An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC (Q2633503) (← links)
- A tableau construction for finite linear-time temporal logic (Q2669249) (← links)
- Quantitative Abstractions for Collective Adaptive Systems (Q2822665) (← links)
- An efficient fully symbolic bisimulation algorithm for non-deterministic systems (Q2842000) (← links)
- Two Observations in Dioid Based Model Refinement (Q2915147) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- A Normal Form for Stateful Connectors (Q2945707) (← links)
- Differential Bisimulation for a Markovian Process Algebra (Q2946344) (← links)
- On the complexity of variations of mixed domination on graphs<sup>†</sup> (Q2958268) (← links)
- Positional Dominance: Concepts and Algorithms (Q2971635) (← links)
- Computing the Maximum Bisimulation with Spiking Neural P Systems (Q3009343) (← links)
- Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation (Q3012928) (← links)
- Signed clique-transversal functions in graphs (Q3056375) (← links)
- The degree-preserving spanning tree problem in strongly chordal and directed path graphs (Q3057180) (← links)
- Connection between logical and algebraic approaches to concurrent systems (Q3060196) (← links)
- Construction of tree automata from regular expressions (Q3095043) (← links)
- Modelling declassification policies using abstract domain completeness (Q3103614) (← links)
- COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS (Q3166754) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- Forward Bisimulations for Nondeterministic Symbolic Finite Automata (Q3303912) (← links)
- Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes (Q3382788) (← links)
- Optimizing Pointer Analysis Using Bisimilarity (Q3392929) (← links)
