Symbolic bisimulations
From MaRDI portal
Recommendations
Cites work
- A theory of timed automata
- Automated analysis of mutual exclusion algorithms using CCS
- Deciding bisimulation equivalences for a class of non-finite-state programs
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- Local model checking for infinite state spaces
- Modal logics for mobile processes
Cited in
(98)- Quantifying information leakage in process calculi
- A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems
- On performance congruences for process algebras
- Bisimulations for a calculus of broadcasting systems
- A \(\pi\)-calculus with explicit substitutions
- On the decidability of process equivalences for the \(\pi\)-calculus
- A semantic theory for value-passing processes based on the late approach
- Complete inference systems for weak bisimulation equivalences in the -calculus.
- A complexity analysis of bisimilarity for value-passing processes
- Testing congruence for mobile processes
- Bisimulation indexes and their applications
- A complete symbolic bisimulation for full applied pi calculus
- Proof systems for message-passing process algebras
- Bisimilarity of open terms.
- Vertical implementation
- On the expressiveness of choice quantification
- Tau laws for pi calculus
- An efficient algorithm for computing bisimulation equivalence
- An approach to deciding the observational equivalence of Algol-like languages
- Variations on mobile processes
- Symbolic transition graph and its early bisimulation checking algorithms for the \(\pi\)-calculus
- Computing bisimulations for finite-control -calculus
- Inference systems for observation equivalences in the \(\pi\)-calculus
- An axiomatization for quantum processes to unifying quantum and classical computing
- Probabilistic process algebra to unifying quantum and classical computing in closed systems
- A thesis for interaction
- SMT-based generation of symbolic automata
- On well-founded and recursive coalgebras
- Replacement freeness: a criterion for separating process calculi
- Verifying quantum communication protocols with ground bisimulation
- Executable structural operational semantics in Maude
- A semantic framework for open processes
- Open bisimulation, revisited
- Explicit fusions
- Compositional equivalences based on open pNets
- Decomposing monolithic processes in a process algebra with multi-actions
- A theory for the composition of concurrent processes
- The Value-Passing Calculus
- Coalgebraic symbolic semantics
- On the complexity of bisimilarity for value-passing processes
- Symbolic Semantics for Multiparty Interactions in the Link-Calculus
- On Beta-Binders Communications
- Sigref – A Symbolic Bisimulation Tool Box
- On Communicating Finite-State Machines
- scientific article; zbMATH DE number 44290 (Why is no real title available?)
- Decision procedures and graph reductions for bisimulation equivalences part 1
- scientific article; zbMATH DE number 1231555 (Why is no real title available?)
- scientific article; zbMATH DE number 1231561 (Why is no real title available?)
- Value-passing CCS with noisy channels
- A generic framework for n-protocol compatibility checking
- scientific article; zbMATH DE number 2020181 (Why is no real title available?)
- Computing strong and weak bisimulations for psi-calculi
- Symbolic bounded synthesis
- Distributed processes and location failures
- scientific article; zbMATH DE number 7015161 (Why is no real title available?)
- scientific article; zbMATH DE number 2085276 (Why is no real title available?)
- Program verification using symbolic game semantics
- INQUISITIVE BISIMULATION
- Bisimulations for probabilistic and quantum processes (invited paper)
- Discovering ePassport vulnerabilities using bisimilarity
- Conditional bisimilarity for reactive systems
- On the decidability of process equivalences for the \(\pi\)-calculus
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus
- Consistently-detecting monitors
- scientific article; zbMATH DE number 7204939 (Why is no real title available?)
- Symbolic bisimulation for quantum processes
- A complete symbolic bisimilarity for an extended spi calculus
- Symbolic semantic rules for producing compact STGLAs from value passing process descriptions
- Analyzing divergence in bisimulation semantics
- The algorithmics of bisimilarity
- Symbolic Semantics Revisited
- 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
- Global Computing
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA
- On quasi-open bisimulation
- Non-deterministic structures of computation
- From rewrite rules to bisimulation congruences
- Explicit substitutions for -congruences
- Distributed processes and location failures
- Models for name-passing processes: Interleaving and causal
- Symbolic transition graph with assignment
- Equivalence checking 40 years after: a review of bisimulation tools
- Comparing the expressiveness of the \(\pi \)-calculus and CCS
- Refinements for open automata
- Conditional bisimilarity for reactive systems
- Effect semantics for quantum process calculi
- Contextual behavioural metrics
- Open bisimilarity for the -calculus with mismatch
- Two case studies of semantics execution in Maude: CCS and LOTOS
- On process equivalence = equation solving in CCS
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
- Preferential choice and coordination conditions
- Theory of interaction
- On the expressiveness of interaction
This page was built for publication: Symbolic bisimulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674194)
