Amanote Research

Amanote Research

    RegisterSign In

The Bisimulation Proof Method: Enhancements and Open Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/11768869_3
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2006

Authors
Davide Sangiorgi
Publisher

Springer Berlin Heidelberg


Related search

On the Bisimulation Proof Method

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
1998English

Using Bisimulation Proof Techniques for the Analysis of Distributed Abstract Machines

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2008English

Questioned Document Problems: The Discovery and Proof of the Facts

University of Toronto Law Journal
LawSociologyPolitical Science
1946English

Polyprograms and Polyprogram Bisimulation

Modeling and Analysis of Information Systems
2018English

Bisimulation and Language Equivalence

2003English

Neighbourhood Contingency Bisimulation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Open Diophantine Problems

Moscow Mathematical Journal
Mathematics
2004English

Enhancements to the Localized Genetic Algorithm for Large Scale Capacitated Vehicle Routing Problems

International Journal of Applied Evolutionary Computation
2013English

Enhanced Coalgebraic Bisimulation

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy