-
1
-
-
33744938690
-
Causal closure for MSC languages
-
LNCS 3821
-
B. Adsul, M. Mukund, K. Narayan Kumar and V. Narayanan. Causal closure for MSC languages. Proc. of FSTTCS'05, LNCS 3821, pp. 335-347, 2005.
-
(2005)
Proc. of FSTTCS'05
, pp. 335-347
-
-
Adsul, B.1
Mukund, M.2
Kumar, K.N.3
Narayanan, V.4
-
3
-
-
0020735797
-
On communicating finite-state machines
-
D. Brand and P. Zafiropulo. On communicating finite-state machines. In J. of the ACM, 30(2):323-342, 1983.
-
(1983)
J. of the ACM
, vol.30
, Issue.2
, pp. 323-342
-
-
Brand, D.1
Zafiropulo, P.2
-
4
-
-
0000871613
-
Asynchronous mappings and asynchronous cellular automata
-
R. Cori, Y. Métivier and W. Zielonka. Asynchronous Mappings and Asynchronous Cellular Automata. In Inf. and Comput., 106(2): 159-202, 1993.
-
(1993)
Inf. and Comput.
, vol.106
, Issue.2
, pp. 159-202
-
-
Cori, R.1
Métivier, Y.2
Zielonka, W.3
-
6
-
-
35048904112
-
A kleene theorem and model checking for a class of communicating automata
-
LNCS 3340
-
B. Genest, D. Kuske and A. Muscholl. A Kleene Theorem and Model Checking for a Class of Communicating Automata. Proc. of DLT'04, LNCS 3340, pp. 30-48, 2004.
-
(2004)
Proc. of DLT'04
, pp. 30-48
-
-
Genest, B.1
Kuske, D.2
Muscholl, A.3
-
7
-
-
33746358778
-
-
Journal version to appear
-
Journal version to appear in Inf. and Comput., 2006.
-
(2006)
Inf. and Comput.
-
-
-
8
-
-
24944567728
-
A theory of regular MSC languages
-
J. G. Henriksen, M. Mukund, K. Narayan Kumar, M. Sohoni and P. S. Thiagarajan. A Theory of Regular MSC Languages. In Inf. and Comput. 202(1):1-38, 2005.
-
(2005)
Inf. and Comput.
, vol.202
, Issue.1
, pp. 1-38
-
-
Henriksen, J.G.1
Mukund, M.2
Kumar, K.N.3
Sohoni, M.4
Thiagarajan, P.S.5
-
9
-
-
0344981321
-
Regular sets of infinite message sequence charts
-
D. Kuske. Regular sets of infinite message sequence charts. In Inf. and Comput., 187(1):80-109, 2003.
-
(2003)
Inf. and Comput.
, vol.187
, Issue.1
, pp. 80-109
-
-
Kuske, D.1
-
10
-
-
1642588257
-
Bounded MSC communication
-
M. Lohrey and A. Muscholl. Bounded MSC communication. In Inf. and Comput., (189):135-263, 2004.
-
(2004)
Inf. and Comput.
, Issue.189
, pp. 135-263
-
-
Lohrey, M.1
Muscholl, A.2
-
11
-
-
0003862813
-
Concurrent program schemes and their interpretation
-
DAIMI Report PB-78, Aarhus University
-
A. Mazurkiewicz. Concurrent program schemes and their interpretation. Technical report, DAIMI Report PB-78, Aarhus University, 1977.
-
(1977)
Technical Report
-
-
Mazurkiewicz, A.1
-
12
-
-
84944038064
-
Beyond message sequence graphs
-
LNCS 2245
-
P. Madhusudan and B. Meenakshi. Beyond Message Sequence Graphs. Proc. of FSTTCS'01, LNCS 2245, pp. 256-267, 2001.
-
(2001)
Proc. of FSTTCS'01
, pp. 256-267
-
-
Madhusudan, P.1
Meenakshi, B.2
-
14
-
-
0037209792
-
Synthesizing distributed finite-state systems from MSCs
-
M. Mukund, K. Narayan Kumar and M. Sohoni. Synthesizing Distributed Finite-State Systems from MSCs. TCS 290(1):221-239 (2003).
-
(2003)
TCS
, vol.290
, Issue.1
, pp. 221-239
-
-
Mukund, M.1
Kumar, K.N.2
Sohoni, M.3
-
15
-
-
33746379023
-
-
Extended abstract LNCS 1877
-
Extended abstract in CONCUR'00, LNCS 1877, pp. 521-535, 2000.
-
(2000)
CONCUR'00
, pp. 521-535
-
-
-
16
-
-
0031120345
-
Keeping track of the latest gossip in a distributed system
-
M. Mukund and M. Sohoni. Keeping Track of the Latest Gossip in a Distributed System. In Distr. Computing 10(3):137-148, 1997.
-
(1997)
Distr. Computing
, vol.10
, Issue.3
, pp. 137-148
-
-
Mukund, M.1
Sohoni, M.2
-
17
-
-
35248842355
-
Synthesis of distributed algorithms using asynchronous automata
-
LNCS 2761
-
A. Stefanescu, J. Esparza, and A. Muscholl. Synthesis of distributed algorithms using asynchronous automata. Proc. of CONCUR'03, LNCS 2761, pp. 27-41, 2003.
-
(2003)
Proc. of CONCUR'03
, pp. 27-41
-
-
Stefanescu, A.1
Esparza, J.2
Muscholl, A.3
|