The following pages link to Symbolic bisimulations (Q674194):
Displaying 50 items.
- Value-passing CCS with noisy channels (Q428864) (← links)
- A generic framework for \(n\)-protocol compatibility checking (Q433347) (← links)
- Computing strong and weak bisimulations for psi-calculi (Q444457) (← links)
- Program verification using symbolic game semantics (Q477213) (← links)
- On quasi-open bisimulation (Q557789) (← links)
- Models for name-passing processes: Interleaving and causal (Q598191) (← links)
- Two case studies of semantics execution in Maude: CCS and LOTOS (Q816216) (← links)
- On process equivalence = equation solving in CCS (Q839034) (← links)
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves (Q843097) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Theory of interaction (Q896903) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- Quantifying information leakage in process calculi (Q1023286) (← links)
- A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems (Q1271643) (← links)
- On performance congruences for process algebras (Q1275822) (← links)
- Bisimulations for a calculus of broadcasting systems (Q1276256) (← links)
- A \(\pi\)-calculus with explicit substitutions (Q1350998) (← links)
- On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099) (← links)
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus. (Q1400579) (← links)
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Testing congruence for mobile processes (Q1599646) (← links)
- A complete symbolic bisimulation for full applied pi calculus (Q1758155) (← links)
- Proof systems for message-passing process algebras (Q1815341) (← links)
- Bisimilarity of open terms. (Q1854331) (← links)
- Vertical implementation (Q1854462) (← links)
- On the expressiveness of choice quantification (Q1874242) (← links)
- Tau laws for pi calculus (Q1884877) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Variations on mobile processes (Q1960530) (← links)
- Symbolic transition graph and its early bisimulation checking algorithms for the \(\pi\)-calculus (Q1962485) (← links)
- Computing bisimulations for finite-control \(\pi\)-calculus (Q1966507) (← links)
- Inference systems for observation equivalences in the \(\pi\)-calculus (Q1974214) (← links)
- An axiomatization for quantum processes to unifying quantum and classical computing (Q2010952) (← links)
- Probabilistic process algebra to unifying quantum and classical computing in closed systems (Q2010969) (← links)
- A thesis for interaction (Q2055962) (← links)
- SMT-based generation of symbolic automata (Q2182674) (← links)
- On well-founded and recursive coalgebras (Q2200809) (← links)
- Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
- Verifying quantum communication protocols with ground bisimulation (Q2233434) (← links)
- Executable structural operational semantics in Maude (Q2369036) (← links)
- A semantic framework for open processes (Q2463561) (← links)
- Open bisimulation, revisited (Q2465030) (← links)
- Explicit fusions (Q2566040) (← links)
- Compositional equivalences based on open pNets (Q2683032) (← links)
- Decomposing monolithic processes in a process algebra with multi-actions (Q2693301) (← links)
- A Theory for the Composition of Concurrent Processes (Q2827466) (← links)
- The Value-Passing Calculus (Q2842635) (← links)
- Coalgebraic Symbolic Semantics (Q2888486) (← links)
- Symbolic Semantics for Multiparty Interactions in the Link-Calculus (Q2971125) (← links)
