Pages that link to "Item:Q1884935"
From MaRDI portal
The following pages link to An efficient algorithm for computing bisimulation equivalence (Q1884935):
Displaying 44 items.
- Bisimulations for fuzzy automata (Q423147) (← links)
- HYPE: hybrid modelling by composition of flows (Q470011) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations (Q622073) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
- Reduction of fuzzy automata by means of fuzzy quasi-orders (Q726556) (← links)
- Is hyper-extensionality preservable under deletions of graph elements? (Q737091) (← links)
- A space-efficient algorithm for finding strongly connected components (Q888958) (← links)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
- An implementation of an efficient algorithm for bisimulation equivalence (Q922711) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Fuzzy relation equations and reduction of fuzzy automata (Q988575) (← links)
- Bisimulation and effectiveness (Q1118393) (← links)
- Bisimulation indexes and their applications (Q1606119) (← links)
- Fuzzy approximations of fuzzy relational structures (Q1644888) (← links)
- Applying model-checking to solve queries on semistructured data (Q1749228) (← links)
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences (Q1794961) (← links)
- A partition refinement algorithm for the \(\pi\)-calculus (Q1854406) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures (Q2219195) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Bisimulation of type 2 for BL-general fuzzy automata (Q2297988) (← links)
- On the relations between Markov chain lumpability and reversibility (Q2406431) (← links)
- An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
- An efficient fully symbolic bisimulation algorithm for non-deterministic systems (Q2842000) (← links)
- Computing the Maximum Bisimulation with Spiking Neural P Systems (Q3009343) (← links)
- Optimizing Pointer Analysis Using Bisimilarity (Q3392929) (← links)
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains (Q3523111) (← links)
- New Bisimulation Semantics for Distributed Systems (Q3614847) (← links)
- Bisimilarity Minimization in O(m logn) Time (Q3636842) (← links)
- (Q4037401) (← links)
- Bisimilarity in Fresh-Register Automata (Q4635800) (← links)
- Minimality Notions via Factorization Systems and Examples (Q5043590) (← links)
- BISIMULATIONS FOR KNOWING HOW LOGICS (Q5078817) (← links)
- Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
- (Q5146599) (← links)
- (Q5214815) (← links)
- An Incremental Bisimulation Algorithm (Q5458835) (← links)
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application (Q5863634) (← links)
- Characterization and computation of approximate bisimulations for fuzzy automata (Q6079413) (← links)
- Lowerbounds for Bisimulation by Partition Refinement (Q6135758) (← links)
- Generic partition refinement and weighted tree automata (Q6535955) (← links)
- Isomorphism between two vector general fuzzy automata (Q6549292) (← links)
