Symbolic bisimulations
From MaRDI portal
Publication:674194
DOI10.1016/0304-3975(94)00172-FzbMath0874.68187OpenAlexW2913663755MaRDI QIDQ674194
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00172-f
Related Items (74)
On the expressiveness of choice quantification ⋮ Coalgebraic Symbolic Semantics ⋮ Executable structural operational semantics in Maude ⋮ Tau laws for pi calculus ⋮ An efficient algorithm for computing bisimulation equivalence ⋮ An approach to deciding the observational equivalence of Algol-like languages ⋮ On process equivalence = equation solving in CCS ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ A \(\pi\)-calculus with explicit substitutions ⋮ Preferential choice and coordination conditions ⋮ Models for name-passing processes: Interleaving and causal ⋮ SMT-based generation of symbolic automata ⋮ On the decidability of process equivalences for the π-calculus ⋮ Complete inference systems for weak bisimulation equivalences in the π-calculus ⋮ On the decidability of process equivalences for the \(\pi\)-calculus ⋮ Symbolic transition graph with assignment ⋮ Theory of interaction ⋮ Compositional equivalences based on open pNets ⋮ Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus. ⋮ On Beta-Binders Communications ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Comparing the expressiveness of the \(\pi \)-calculus and CCS ⋮ On well-founded and recursive coalgebras ⋮ Value-passing CCS with noisy channels ⋮ Decomposing monolithic processes in a process algebra with multi-actions ⋮ Unnamed Item ⋮ A generic framework for \(n\)-protocol compatibility checking ⋮ Unnamed Item ⋮ Symbolic Semantics for Multiparty Interactions in the Link-Calculus ⋮ Computing strong and weak bisimulations for psi-calculi ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Variations on mobile processes ⋮ Symbolic transition graph and its early bisimulation checking algorithms for the \(\pi\)-calculus ⋮ Computing bisimulations for finite-control \(\pi\)-calculus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Program verification using symbolic game semantics ⋮ Inference systems for observation equivalences in the \(\pi\)-calculus ⋮ Verifying quantum communication protocols with ground bisimulation ⋮ A semantic framework for open processes ⋮ Open bisimulation, revisited ⋮ On the expressiveness of interaction ⋮ A complete symbolic bisimulation for full applied pi calculus ⋮ Symbolic Bisimulation for Quantum Processes ⋮ A Complete Symbolic Bisimilarity for an Extended Spi Calculus ⋮ Non-deterministic structures of computation ⋮ An axiomatization for quantum processes to unifying quantum and classical computing ⋮ Probabilistic process algebra to unifying quantum and classical computing in closed systems ⋮ On quasi-open bisimulation ⋮ Explicit substitutions for \(\pi\)-congruences ⋮ Distributed processes and location failures ⋮ Distributed processes and location failures ⋮ Open Bisimulation for the Concurrent Constraint Pi-Calculus ⋮ Equivalence Checking for a Finite Higher Order π-Calculus ⋮ Symbolic Bisimulation for the Applied Pi Calculus ⋮ An Incremental Bisimulation Algorithm ⋮ Unnamed Item ⋮ A thesis for interaction ⋮ Proof systems for message-passing process algebras ⋮ Quantifying information leakage in process calculi ⋮ A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems ⋮ A Theory for the Composition of Concurrent Processes ⋮ On performance congruences for process algebras ⋮ Bisimulations for a calculus of broadcasting systems ⋮ A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA ⋮ A complexity analysis of bisimilarity for value-passing processes ⋮ On Communicating Finite-State Machines ⋮ The Value-Passing Calculus ⋮ Consistently-detecting monitors ⋮ Explicit fusions ⋮ Bisimilarity of open terms. ⋮ Vertical implementation ⋮ Testing congruence for mobile processes ⋮ Two case studies of semantics execution in Maude: CCS and LOTOS
Cites Work
This page was built for publication: Symbolic bisimulations
