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 50 items.
- 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)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Compositional failure-based semantic models for basic LOTOS (Q1903079) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- Translating between models of concurrency (Q2182666) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Revisiting causality, coalgebraically (Q2257982) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
- Unwinding biological systems (Q2348024) (← links)
- Testing equivalence as a bisimulation equivalence (Q2366163) (← links)
- Priority and abstraction in process algebra (Q2381506) (← links)
- Undecidable equivalences for basic parallel processes (Q2389334) (← links)
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
- Depletable channels: dynamics, behaviour, and efficiency in network design (Q2422775) (← links)
- Deadlock-freedom in component systems with architectural constraints (Q2441719) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
- An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
- Interface automata for shared memory (Q2675806) (← links)
- Coalgebraic Symbolic Semantics (Q2888486) (← links)
- A Tutorial on Interactive Markov Chains (Q2937729) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- Computing the Maximum Bisimulation with Spiking Neural P Systems (Q3009343) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- Model Refinement Using Bisimulation Quotients (Q3067468) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- Dynamics Security Policies and Process Opacity for Timed Process Algebras (Q3179174) (← links)
- Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems (Q3449627) (← links)
- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence (Q3498448) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- Formal Verification for Components and Connectors (Q3638992) (← links)
- On the expressive power of recursion, replication and iteration in process calculi (Q3655762) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)
- (Q4553282) (← links)
- Deciding true concurrency equivalences on finite safe nets (preliminary report) (Q4630288) (← links)
- Distribution and locality of concurrent systems (Q4632423) (← links)
- Compositionality in state space verification methods (Q4633153) (← links)
- Hybrid automata with finite bisimulations (Q4645189) (← links)
- Approximated Reachability on Hybrid Automata: Falsification meets Certification (Q4982085) (← links)
- Minimal transition systems for history-preserving bisimulation (Q5048942) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- 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)
