-
1
-
-
0031193084
-
A Formal Basis for Architectural Connection
-
Robert Allen and David Garlan. A Formal Basis for Architectural Connection. ACM Trans. Softw. Eng. Methodol., 6(3):213-249, 1997.
-
(1997)
ACM Trans. Softw. Eng. Methodol
, vol.6
, Issue.3
, pp. 213-249
-
-
Allen, R.1
Garlan, D.2
-
2
-
-
24144495514
-
Efficiently verifiable conditions for deadlock-freedom of large concurrent programs
-
R. Cousot, editor, proc. VMCAI'05, of
-
P.C. Attie and H. Chockler. Efficiently verifiable conditions for deadlock-freedom of large concurrent programs. In R. Cousot, editor, proc. VMCAI'05, volume 3385 of LNCS, pages 465-481, 2005.
-
(2005)
LNCS
, vol.3385
, pp. 465-481
-
-
Attie, P.C.1
Chockler, H.2
-
3
-
-
33746433645
-
Component Modell for Architectural Programming
-
A, ENTCS
-
Hubert Baumeister, Florian Hacklinger, Rolf Hennicker, Alexander Knapp, and Martin Wirsing. A Component Modell for Architectural Programming. In Proceedings of FACS 2005. ENTCS, 2005.
-
(2005)
Proceedings of FACS 2005
-
-
Baumeister, H.1
Hacklinger, F.2
Hennicker, R.3
Knapp, A.4
Wirsing, M.5
-
4
-
-
0035783442
-
-
Luca de Alfaro and Thomas A. Henzinger. Interface automata. In Proceedings of the 8th European Software Engineering Conference, Vienna, pages 109-120, 2001.
-
Luca de Alfaro and Thomas A. Henzinger. Interface automata. In Proceedings of the 8th European Software Engineering Conference, Vienna, pages 109-120, 2001.
-
-
-
-
5
-
-
0018681392
-
Semantics of non-determinism, concurrency and communication
-
N. Francez, C.A.R. Hoare, D.J. Lehmann, and W.P. de Roever. Semantics of non-determinism, concurrency and communication. Journal of Computer Science, 19:290-308, 1979.
-
(1979)
Journal of Computer Science
, vol.19
, pp. 290-308
-
-
Francez, N.1
Hoare, C.A.R.2
Lehmann, D.J.3
de Roever, W.P.4
-
6
-
-
38149136402
-
An Approach to Modelling and Verification of Component Based Systems
-
Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer, Science SOFSEM07, of
-
G. Gössler, S. Graf, M. Majster-Cederbaum, M. Martens, and J. Sifakis. An Approach to Modelling and Verification of Component Based Systems. In Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer, Science SOFSEM07, volume 4362 of LNCS, 2007.
-
(2007)
LNCS
, vol.4362
-
-
Gössler, G.1
Graf, S.2
Majster-Cederbaum, M.3
Martens, M.4
Sifakis, J.5
-
7
-
-
35048861339
-
Component-based construction of deadlock-free systems
-
proceedings of FSTTCS 2003, Mumbai, India
-
Gregor Gßler and Joseph Sifakis, Component-based construction of deadlock-free systems. In proceedings of FSTTCS 2003, Mumbai, India, LNCS 2914, pages 420-433, 2003.
-
(2003)
LNCS
, vol.2914
, pp. 420-433
-
-
Gßler, G.1
Sifakis, J.2
-
8
-
-
35048840647
-
Priority systems
-
proceedings of FMCO'03
-
Gregor Gßler and Joseph Sifakis. Priority systems. In proceedings of FMCO'03, LNCS 3188, 2004.
-
(2004)
LNCS
, vol.3188
-
-
Gßler, G.1
Sifakis, J.2
-
9
-
-
13144293121
-
Composition for component-based modeling
-
Gregor Gßler and Joseph Sifakis. Composition for component-based modeling. Sci. Comput. Program., 55(1-3):161-183, 2005.
-
(2005)
Sci. Comput. Program
, vol.55
, Issue.1-3
, pp. 161-183
-
-
Gßler, G.1
Sifakis, J.2
-
10
-
-
0001383866
-
An introduction to input/output automata
-
September
-
Nancy A. Lynch and Mark R. Tuttle. An introduction to input/output automata. CWI-Quarterly, 2(3):219-246, September 1989.
-
(1989)
CWI-Quarterly
, vol.2
, Issue.3
, pp. 219-246
-
-
Lynch, N.A.1
Tuttle, M.R.2
-
11
-
-
38149005438
-
A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems
-
Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer, Science SOFSEM07, of
-
Mila Majster-Cederbaum, Moritz Martens, and Christoph Minnameier. A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems. In Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer, Science SOFSEM07, volume 4362 of LNCS, 2007.
-
(2007)
LNCS
, vol.4362
-
-
Majster-Cederbaum, M.1
Martens, M.2
Minnameier, C.3
-
12
-
-
38149029500
-
Deciding Liveness in Component-Based Systems is NP-hard
-
Technical report TR-2006-017, Universität Mannheim
-
Moritz Martens, Christoph Minnameier, and Mila Majster-Cederbaum. Deciding Liveness in Component-Based Systems is NP-hard. Technical report TR-2006-017, Universität Mannheim, 2006.
-
(2006)
-
-
Martens, M.1
Minnameier, C.2
Majster-Cederbaum, M.3
-
13
-
-
39149124080
-
-
Christoph Minnameier. Deadlock-Detection in Component-Based Systems is NP-hard. Technical report TR-2006-015, Universität Mannheim, 2006. also submitted for publication elsewhere.
-
Christoph Minnameier. Deadlock-Detection in Component-Based Systems is NP-hard. Technical report TR-2006-015, Universität Mannheim, 2006. also submitted for publication elsewhere.
-
-
-
-
15
-
-
39149139259
-
Logics and Models for Concurrent Systems
-
transition from global to modular temporal reasoning about programs, NATO, Springer Verlag
-
A. Pnueli. In transition from global to modular temporal reasoning about programs. In Logics and Models for Concurrent Systems. NATO, ASI Series F, Vol. 13, Springer Verlag, 1985.
-
(1985)
ASI Series F
, vol.13
-
-
Pnueli, A.1
-
16
-
-
84883274848
-
-
Joseph Sifakis. A framework for component-based construction. In 3rd IEEE International Conference on Software Engineering and Formal Methods, Key note talk, Koblenz, 2005.
-
Joseph Sifakis. A framework for component-based construction. In 3rd IEEE International Conference on Software Engineering and Formal Methods, volume Key note talk, Koblenz, 2005.
-
-
-
|