-
1
-
-
84958750808
-
An analyzer for message sequence charts
-
International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS)
-
R. Alur, G.J. Holzmann, and D.A. Peled. An analyzer for message sequence charts. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), LNCS 1055, 1996.
-
(1996)
LNCS
, vol.1055
-
-
Alur, R.1
Holzmann, G.J.2
Peled, D.A.3
-
2
-
-
84888232448
-
Model checking of message sequence charts
-
International Conference on Concurrency Theory (CONCUR)
-
R. Alur and M. Yannakakis. Model checking of message sequence charts. In International Conference on Concurrency Theory (CONCUR), LNCS 1664, 1999.
-
(1999)
LNCS
, vol.1664
-
-
Alur, R.1
Yannakakis, M.2
-
6
-
-
0035393979
-
LSCs: Breathing life into message sequence charts
-
W. Damm and D. Harel. LSCs: Breathing life into message sequence charts. Formal Methods in System Design, 19(1), 2001.
-
Formal Methods in System Design
, vol.19
, Issue.1
, pp. 2001
-
-
Damm, W.1
Harel, D.2
-
8
-
-
0023365727
-
Statecharts: A visual formalism for complex ystems
-
D. Harel. Statecharts: A visual formalism for complex ystems. Science of Computer Programming, 8, 1987.
-
(1987)
Science of Computer Programming
, vol.8
-
-
Harel, D.1
-
9
-
-
35048870528
-
From play-in scenarios to code: An achievable dream
-
Fundamental Approaches to Software Engineering (FASE)
-
D. Harel and H. Kugler. From play-in scenarios to code: An achievable dream. In Fundamental Approaches to Software Engineering (FASE), LNCS 1783, 2000.
-
(2000)
LNCS
, vol.1783
-
-
Harel, D.1
Kugler, H.2
-
10
-
-
84954414901
-
Synthesizing state-based object systems from LSC specifications
-
International Conference on Implementation and Applications of Automata (CIAA)
-
D. Harel and H. Kugler. Synthesizing state-based object systems from LSC specifications. In International Conference on Implementation and Applications of Automata (CIAA), LNCS 2088, 2001.
-
(2001)
LNCS
, vol.2088
-
-
Harel, D.1
Kugler, H.2
-
11
-
-
35248853976
-
-
Technical report, Weizmann Institute of Science
-
D. Harel, H. Kugler, R. Marelly, and A. Pnueli. Smart play-out of behavioral requirements. Technical report, Weizmann Institute of Science, 2002.
-
(2002)
Smart Play-out of Behavioral Requirements
-
-
Harel, D.1
Kugler, H.2
Marelly, R.3
Pnueli, A.4
-
13
-
-
84974633278
-
Message sequence graphs and finitely generated regular MSC languages
-
International Colloquium on Automata, Languages and Programming (ICALP)
-
J.G. Hendriksen, M. Mukund, K.N. Kumar, and P.S. Thiagarajan. Message sequence graphs and finitely generated regular MSC languages. In International Colloquium on Automata, Languages and Programming (ICALP), LNCS 1853, 2000.
-
(2000)
LNCS
, vol.1853
-
-
Hendriksen, J.G.1
Mukund, M.2
Kumar, K.N.3
Thiagarajan, P.S.4
-
14
-
-
84959181355
-
Regular collections of message sequence charts
-
Mathematical Foundations of Computer Science (MFCS)
-
J.G. Hendriksen, M. Mukund, K.N. Kumar, and P.S. Thiagarajan. Regular collections of message sequence charts. In Mathematical Foundations of Computer Science (MFCS), LNCS 1893, 2000.
-
(2000)
LNCS
, vol.1893
-
-
Hendriksen, J.G.1
Mukund, M.2
Kumar, K.N.3
Thiagarajan, P.S.4
-
16
-
-
0003765895
-
-
Technical report, University of Waterloo, Tech Report 98-06
-
S. Leue, L. Mehrmann, and M. Ressi. Synthesizing ROOM models from message sequence chart specifications. Technical report, University of Waterloo, Tech Report 98-06, 1998.
-
(1998)
Synthesizing ROOM Models from Message Sequence Chart Specifications
-
-
Leue, S.1
Mehrmann, L.2
Ressi, M.3
-
17
-
-
84879533305
-
Reasoning about sequential and branching behaviours of message sequence graphs
-
International Colloquium on Automata, Languages and Programming (ICALP)
-
P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In International Colloquium on Automata, Languages and Programming (ICALP), LNCS 2076, 2001.
-
(2001)
LNCS
, vol.2076
-
-
Madhusudan, P.1
-
19
-
-
84949223390
-
Message sequence graphs and decision problems on Mazurkiewicz traces
-
Mathematical Foundations of Computer Science(MFCS)
-
A. Muscholl and D.A. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In Mathematical Foundations of Computer Science(MFCS), LNCS 1672, 1999.
-
(1999)
LNCS
, vol.1672
-
-
Muscholl, A.1
Peled, D.A.2
-
20
-
-
84879531972
-
From finite state communication protocols to high-level message sequence charts
-
International Colloquium on Automata, Languages and Programming (ICALP)
-
A. Muscholl and D.A. Peled. From finite state communication protocols to high-level message sequence charts. In International Colloquium on Automata, Languages and Programming (ICALP), LNCS 2076, 2001.
-
(2001)
LNCS
, vol.2076
-
-
Muscholl, A.1
Peled, D.A.2
|