Pages that link to "Item:Q3801084"
From MaRDI portal
The following pages link to Three Partition Refinement Algorithms (Q3801084):
Displaying 50 items.
- COMPOSED BISIMULATION FOR TREE AUTOMATA (Q3395139) (← links)
- Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems (Q3449627) (← links)
- BISIMULATION MINIMIZATION OF TREE AUTOMATA (Q3503087) (← links)
- Reducing Acyclic Cover Transducers (Q3503893) (← links)
- An Implementation of Deterministic Tree Automata Minimization (Q3503900) (← links)
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains (Q3523111) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- A Space-Efficient Probabilistic Simulation Algorithm (Q3541022) (← links)
- On the Minimisation of Acyclic Models (Q3541025) (← links)
- Towards State Space Reduction Based on T-Lumpability-Consistent Relations (Q3543307) (← links)
- Modelling and Verifying Mobile Systems Using π-Graphs (Q3599092) (← links)
- Thread algebra for noninterference (Q3625692) (← links)
- Bisimilarity Minimization in O(m logn) Time (Q3636842) (← links)
- An set refinement algorithm with applications (Q3991118) (← links)
- Models for machine-part grouping in cellular manufacturing (Q4230175) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)
- (Q4553282) (← links)
- Converging from branching to linear metrics on Markov chains (Q4559599) (← links)
- Hybrid automata with finite bisimulations (Q4645189) (← links)
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets (Q4671274) (← links)
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS (Q4786303) (← links)
- Rank-Based Symbolic Bisimulation (Q4916208) (← links)
- An Efficient Algorithm for the Construction of the Equation Tree Automaton (Q4963261) (← links)
- Approximated Reachability on Hybrid Automata: Falsification meets Certification (Q4982085) (← links)
- (Q5005172) (← links)
- (Q5016383) (← links)
- Regular fuzzy equivalences on two - mode fuzzy Networksi (Q5024949) (← links)
- Morphisms and Minimisation of Weighted Automata (Q5038573) (← links)
- Minimality Notions via Factorization Systems and Examples (Q5043590) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Minimal transition systems for history-preserving bisimulation (Q5048942) (← links)
- Quasifibrations of graphs to find symmetries and reconstruct biological networks (Q5055404) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- On the decidability of process equivalences for the π-calculus (Q5096384) (← links)
- Interleaving vs True Concurrency: Some Instructive Security Examples (Q5100754) (← links)
- A Study on Team Bisimulations for BPP Nets (Q5100755) (← links)
- Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
- Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
- An aperiodic set of 11 Wang tiles (Q5162865) (← links)
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems (Q5164166) (← links)
- Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata (Q5170274) (← links)
- Checking equivalences between concurrent systems of finite agents (Extended abstract) (Q5204358) (← links)
- (Q5214815) (← links)
- PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997) (← links)
- An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES (Q5358087) (← links)
- Generic top-down discrimination for sorting and partitioning in linear time (Q5398338) (← links)