loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Application of Concurrency to System Design (ACSD'05)
Complexity Results for Checking Distributed Implementability
St. Malo, France
June 07-June 09
ISBN: 0-7695-2363-3
ASCII Text
x 
 
Keijo Heljanko, Alin Stefanescu, "Complexity Results for Checking Distributed Implementability," Application of Concurrency to System Design, International Conference on, pp. 78-87, Fifth International Conference on Application of Concurrency to System Design (ACSD'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ACSD.2005.7,
author = {Keijo Heljanko and Alin Stefanescu},
title = {Complexity Results for Checking Distributed Implementability},
journal ={Application of Concurrency to System Design, International Conference on},
volume = {0},
year = {2005},
issn = {1550-4808},
pages = {78-87},
doi = {http://doi.ieeecomputersociety.org/10.1109/ACSD.2005.7},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Application of Concurrency to System Design, International Conference on
TI - Complexity Results for Checking Distributed Implementability
SN - 1550-4808
SP78
EP87
A1 - Keijo Heljanko,
A1 - Alin Stefanescu,
PY - 2005
KW - null
VL - 0
JA - Application of Concurrency to System Design, International Conference on
ER -
 
Keijo Heljanko, Helsinki University of Technology
Alin Stefanescu, University of Stuttgart
We consider the distributed implementability problem: Given a labeled transition system TS together with a distribution ? of its actions over a set of processes, does there exist a distributed system over ? such that its global transition system is ?equivalent? to TS? We work with the distributed system models of synchronous products of transition systems [1] and asynchronous automata [18]. In this paper we provide complexity bounds for the above problem with three interpretations of ?equivalent?: as transition system isomorphism, as language equivalence, and as bisimilarity. In particular, we solve problems left open in [4, 10].
Citation:
Keijo Heljanko, Alin Stefanescu, "Complexity Results for Checking Distributed Implementability," acsd, pp.78-87, Fifth International Conference on Application of Concurrency to System Design (ACSD'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.