A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes

Mathematical Structures in Computer Science - United Kingdom
doi 10.1017/s0960129500000992
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Deciding Orthogonal Bisimulation

Formal Aspects of Computing
Theoretical Computer ScienceSoftware
2007English

Bisimulation and Language Equivalence

2003English

Strong Splitting Bisimulation Equivalence

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

A Polynomial Time Algorithm for Fault Diagnosability

1984English

A Polynomial-Time Algorithm for Global Value Numbering

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Polynomial-Time Parsing Algorithm for TT-MCTAG

2009English

A Polynomial Time Algorithm for Spatio-Temporal Security Games

2017English

Bisimulation Metrics for Continuous Markov Decision Processes

SIAM Journal on Computing
MathematicsComputer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy