Pages that link to "Item:Q918211"
From MaRDI portal
The following pages link to CCS expressions, finite state processes, and three problems of equivalence (Q918211):
Displaying 30 items.
- On the decidability of process equivalences for the π-calculus (Q5096384) (← links)
- Efficient Coalgebraic Partition Refinement (Q5111646) (← 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)
- Checking equivalences between concurrent systems of finite agents (Extended abstract) (Q5204358) (← links)
- (Q5214815) (← links)
- An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211) (← links)
- Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking (Q5415660) (← links)
- An Incremental Bisimulation Algorithm (Q5458835) (← 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)
- Branching time controllers for discrete event systems (Q5958466) (← links)
- On divergence-sensitive weak probabilistic bisimilarity (Q6040671) (← links)
- An automated quantitative information flow analysis for concurrent programs (Q6103027) (← links)
- Lowerbounds for Bisimulation by Partition Refinement (Q6135758) (← links)
- A Spatial Logic for Simplicial Models (Q6135777) (← links)
- Verifying abstractions of timed systems (Q6162104) (← links)
- Deciding bisimulation and trace equivalences for systems with many identical processes (Q6487976) (← links)
- Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis (Q6535518) (← links)
- Distributed coalgebraic partition refinement (Q6535613) (← links)
- Generic partition refinement and weighted tree automata (Q6535955) (← links)
- Decidability results in automata and process theory (Q6560390) (← links)
- Modal and temporal logics for processes (Q6560391) (← links)
- Characterizing contrasimilarity through games, modal logic, and complexity (Q6614880) (← links)
- Explicit Hopcroft's trick in categorical partition refinement (Q6666777) (← links)
