Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45500-0_19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Weak Bisimulation for Probabilistic Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

New Bisimulation Semantics for Distributed Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Branching Bisimulation for Probabilistic Systems: Characteristics and Decidability

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2006English

Bisimulation Relations for Dynamical, Control, and Hybrid Systems

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2005English

Low Dimensional Hybrid Systems – Decidable, Undecidable, Donʼt Know

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2012English

Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Systematic Lossy Source/Channel Coding

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1998English

Equivalences of Pushdown Systems Are Hard

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Equivalences of C*-Dynamical Systems

Banach Center Publications
1989English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy