Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

IANDC
2010

favoriteEmaildiscussreport

57views more IANDC 2010»

Non-interleaving bisimulation equivalences on Basic Parallel Processes

13 years 2 months ago

Non-interleaving bisimulation equivalences on Basic Parallel Processes

Download www.cs.vsb.cz

Sibylle B. Fröschle, Petr Jancar, Slawomir La

Real-time Traffic

IANDC 2010 |

claim paper

Related Content

» Refining the Undecidability Border of Weak Bisimilarity

» Decidability of Bisimulation Equivalence for Processes Generating ContextFree Languages

» Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP

» Axiomatizations for the Perpetual Loop in Process Algebra

» PartiallyCommutative ContextFree Processes

» Weak Bisimulation Approximants

» Network Applications of Graph Bisimulation

» Bisimulation Equivalence is Decidable for all ContextFree Processes

» Basic Observables for a Calculus for Global Computing

Post Info
More Details (n/a)

Added	25 Jan 2011
Updated	25 Jan 2011
Type	Journal
Year	2010
Where	IANDC
Authors	Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa

Comments (0)