-
1
-
-
15744383238
-
Realizability and verification of MSC graphs
-
DOI 10.1016/j.tcs.2004.09.034, PII S030439750400670X, Automata, Languages and Programming
-
Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. Theoretical Computer Science 331(1), 97-114 (2005) (Pubitemid 40415264)
-
(2005)
Theoretical Computer Science
, vol.331
, Issue.1
, pp. 97-114
-
-
Alur, R.1
Etessami, K.2
Yannakakis, M.3
-
2
-
-
84856637515
-
Context-bounded analysis for concurrent programs with dynamic creation of threads
-
Atig, M.F., Bouajjani, A., Qadeer, S.: Context-bounded analysis for concurrent programs with dynamic creation of threads. Logical Methods in Computer Science 7(4) (2011)
-
(2011)
Logical Methods in Computer Science
, vol.7
, Issue.4
-
-
Atig, M.F.1
Bouajjani, A.2
Qadeer, S.3
-
3
-
-
84875637641
-
Dynamic communicating automata and branching high-level MSCs
-
LSV November
-
Bollig, B., Cyriac, A., Héloüet, L., Kara, A., Schwentick, T.: Dynamic Communicating Automata and Branching High-Level MSCs. Research Report LSV-12-20, LSV (November 2012)
-
(2012)
Research Report LSV-12-20
-
-
Bollig, B.1
Cyriac, A.2
Héloüet, L.3
Kara, A.4
Schwentick, T.5
-
4
-
-
77954581078
-
Realizability of dynamic MSC languages
-
Ablayev, F., Mayr, E.W. (eds.) LNCS Springer, Heidelberg
-
Bollig, B., Héloüet, L.: Realizability of Dynamic MSC Languages. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, Vol. 6072, pp. 48-59. Springer, Heidelberg (2010)
-
(2010)
CSR 2010
, vol.6072
, pp. 48-59
-
-
Bollig, B.1
Héloüet, L.2
-
5
-
-
38149037113
-
A chart semantics for the pi-calculus
-
Borgström, J., Gordon, A., Phillips, A.: A chart semantics for the Pi-calculus. Electronic Notes in Theoretical Computer Science 194(2), 3-29 (2008)
-
(2008)
Electronic Notes in Theoretical Computer Science
, vol.194
, Issue.2
, pp. 3-29
-
-
Borgström, J.1
Gordon, A.2
Phillips, A.3
-
6
-
-
48449099517
-
Verification of well-formed communicating recursive state machines
-
Bozzelli, L., La Torre, S., Peron, A.: Verification of well-formed communicating recursive state machines. Theoretical Computer Science 403(2-3), 382-405 (2008)
-
(2008)
Theoretical Computer Science
, vol.403
, Issue.2-3
, pp. 382-405
-
-
Bozzelli, L.1
La Torre, S.2
Peron, A.3
-
7
-
-
0020735797
-
On communicating finite-state machines
-
Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30(2) (1983)
-
(1983)
Journal of the ACM
, vol.30
, Issue.2
-
-
Brand, D.1
Zafiropulo, P.2
-
8
-
-
33750983446
-
High-level petri nets as type theories in the join calculus
-
Foundations of Software Science and Computation Structures 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001 Proceedings
-
Buscemi, M.G., Sassone, V.: High-Level Petri Nets as Type Theories in the Join Calculus. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, Vol. 2030, pp. 104-120. Springer, Heidelberg (2001) (Pubitemid 33254625)
-
(2001)
Lecture Notes in Computer Science
, Issue.2030
, pp. 104-120
-
-
Buscemi, M.G.1
Sassone, V.2
-
9
-
-
84855204486
-
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
-
DOI 10.1016/j.ic.2006.01.005, PII S0890540106000290
-
Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Information and Computation 204(6), 920-956 (2006) (Pubitemid 43744512)
-
(2006)
Information and Computation
, vol.204
, Issue.6
, pp. 920-956
-
-
Genest, B.1
Kuske, D.2
Muscholl, A.3
-
10
-
-
33646164193
-
Infinite-state high-level MSCs: Model-checking and realizability
-
Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level MSCs: Model-checking and realizability. Journal of Computer and System Sciences 72(4), 617-647 (2006)
-
(2006)
Journal of Computer and System Sciences
, vol.72
, Issue.4
, pp. 617-647
-
-
Genest, B.1
Muscholl, A.2
Seidl, H.3
Zeitoun, M.4
-
11
-
-
0012974485
-
Conditions for synthesis of communicating automata from HMSCs
-
Springer (2000)
-
Héloüet, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: Proceedings of FMICS 2000, pp. 203-224. Springer (2000)
-
(2000)
Proceedings of FMICS
, pp. 203-224
-
-
Héloüet, L.1
Jard, C.2
-
12
-
-
24944567728
-
A theory of regular MSC languages
-
DOI 10.1016/j.ic.2004.08.004, PII S089054010500088X
-
Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M.A., Thiagarajan, P.S.: A theory of regular MSC languages. Inf. Comput. 202(1), 1-38 (2005) (Pubitemid 41328759)
-
(2005)
Information and Computation
, 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
-
14
-
-
84877733238
-
Dynamic message sequence charts
-
Leucker, M., Madhusudan, P., Mukhopadhyay, S.: Dynamic Message Sequence Charts. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, Vol. 2556, pp. 253-264. Springer, Heidelberg (2002) (Pubitemid 36021142)
-
(2002)
Lecture Notes in Computer Science
, Issue.2556
, pp. 253-264
-
-
Leucker, M.1
Madhusudan, P.2
Mukhopadhyay, S.3
-
15
-
-
0000673486
-
Series-parallel languages and the bounded-width property
-
Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theoretical Computer Science 237(1-2), 347-380 (2000)
-
(2000)
Theoretical Computer Science
, vol.237
, Issue.1-2
, pp. 347-380
-
-
Lodaya, K.1
Weil, P.2
-
16
-
-
0035895139
-
Rationality in algebras with a series operation
-
Lodaya, K., Weil, P.: Rationality in algebras with a series operation. Information and Computation 171(2), 269-293 (2001)
-
(2001)
Information and Computation
, vol.171
, Issue.2
, pp. 269-293
-
-
Lodaya, K.1
Weil, P.2
-
17
-
-
0242440296
-
Realizability of high-level message sequence charts: Closing the gaps
-
Lohrey, M.: Realizability of high-level message sequence charts: closing the gaps. Theoretical Computer Science 309(1-3), 529-554 (2003)
-
(2003)
Theoretical Computer Science
, vol.309
, Issue.1-3
, pp. 529-554
-
-
Lohrey, M.1
-
18
-
-
48249156600
-
On boundedness in depth in the π-calculus
-
Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds.) Springer, Boston
-
Meyer, R.: On Boundedness in Depth in the π-Calculus. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds.) Proceedings of IFIP TCS 2008, Vol. 273, pp. 477-489. Springer, Boston (2008)
-
(2008)
Proceedings of IFIP TCS 2008
, vol.273
, pp. 477-489
-
-
Meyer, R.1
-
19
-
-
44049114041
-
A calculus of mobile processes, I
-
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I. Information and Computation 100(1), 1-40 (1992)
-
(1992)
Information and Computation
, vol.100
, Issue.1
, pp. 1-40
-
-
Milner, R.1
Parrow, J.2
Walker, D.3
-
20
-
-
84937403715
-
Recognizable sets of message sequence charts
-
Alt, H., Ferreira, A. (eds.) LNCS Springer, Heidelberg
-
Morin, R.: Recognizable Sets of Message Sequence Charts. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, Vol. 2285, pp. 523-534. Springer, Heidelberg (2002)
-
(2002)
STACS 2002
, vol.2285
, pp. 523-534
-
-
Morin, R.1
-
21
-
-
33750309940
-
Automata and logics for words and trees over an infinite alphabet
-
Computer Science Logic - 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Proceedings
-
Segoufin, L.: Automata and Logics for Words and Trees over an Infinite Alphabet. In: Ésik, Z. (ed.) CSL 2006. LNCS, Vol. 4207, pp. 41-57. Springer, Heidelberg (2006) (Pubitemid 44617548)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.4207 LNCS
, pp. 41-57
-
-
Segoufin, L.1
|