GCCS: A graphical coordination language for system specification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1906, Issue , 2000, Pages 284-298

  Cleaveland, Rance ^a   Du, Xiaoqun ^a   Smolka, Scott A ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL SYSTEMS; SEMANTICS;

CONCURRENT SYSTEMS; COORDINATION LANGUAGE; COORDINATION LAWS; COORDINATION MODEL; REAL TIME ETHERNET; STRUCTURAL OPERATIONAL SEMANTICS; SYSTEM COMPONENTS; SYSTEM SPECIFICATION;

SPECIFICATIONS;

EID: 84979300779     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45263-x_18     Document Type: Conference Paper

References (28)

1. F. Arbab, J. W. de Bakker, M. M. Bonsangue, J. J. M. M. Rutten, A. Scutella, and G. Zavattaro. A transition system semantics for the controldriven coordination language Manifold. Theoretical Computer Science, 2000. To appear.
2. R. Allen and D. Garlan. A formal basis for architectural connection. ACM Trans. on Software Engineering and Methodology., 6 (3): 213-249, 1997.
3. F. Arbab, I. Herman, and P. Spilling. An overview of Manifold and its implementation. Concurrency: Practice and Experience, 5 (1): 23-70, 1993.
4. M. Bernardo, P. Ciancarini, and L. Donatiello. Performance analysis of software architectures via a process algebraic description language. Technical Report UBLCS-99-20, University of Bologna, 1999.
5. N. Busi, R. Gorrieri, and G. Zavattaro. A process algebraic view of Linda coordination primitives. Theoretical Computer Science, 192 (2): 167-199, February 1998.
6. N. Busi, R. Gorrieri, and G. Zavattaro. Process calculi for coordination: From Linda to JavaSpaces. In Proceedings of AMAST 2000, Lecture Notes in Computer Science. Springer-Verlag, May 2000.
7. J. A. Bergstra and P. Klint. The discrete time ToolBus-A software coordination architecture. Science of Computer Programming, 31: 205-229, 1998.
8. N. Busi and G. Zavattaro. On the expressiveness of event notification in data-driven coordination languages. In Proceedings of ESOP 2000, Lecture Notes in Computer Science. Springer-Verlag, March 2000.
9. N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32 (4): 444-458, April 1989. CGL +
10. R. Cleaveland, J. N. Gada, P. M. Lewis, S. A. Smolka, O. Sokolsky, and S. Zhang. The Concurrency Factory: practical tools for specification, simulation, verification, and implementation of concurrent systems. In G. E. Blelloch, K. M. Chandy, and S. Jagannathan, editors, Proceedings of DIMACS Workshop on Specification of Parallel Algorithms, volume 18 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 75-90, Princeton, NJ, May 1994. American Mathematical Society.
11. P. Ciancarini. Coordination models and languages as software integrators. ACM Computing Surveys, 28 (2): 300-302, June 1996.
12. R. Cleaveland, P. M. Lewis, S. A. Smolka, and O. Sokolsky. The Concurrency Factory: A development environment for concurrent systems. In R. Alur and T. A. Henzinger, editors, Computer Aided Verification (CAV’96), volume 1102 of Lecture Notes in Computer Science, pages 398-401, New Brunswick, New Jersey, July 1996. Springer-Verlag.
13. R. Cleaveland, P. M. Lewis, S. A. Smolka, and O. Sokolsky. The Concurrency Factory software development environment. In T. Margaria and B. Steffen, editors, Proceedings of the Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’96), Vol. 1055 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
14. T. Chiueh and C. Venkatramani. The design, implementation and evaluation of a software-based real-time ethernet protocol. In Proceedings of ACM SIGCOMM’95, pages 27-37, 1995. DDR +99.
15. Y. Dong, X. Du, Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, O. Sokolsky, E. W. Stark, and D. S. Warren. Fighting livelock in the Protocol: A comparative study of verification tools. In Tools and Algorithms for the Construction and Analysis of Algorithms (TACAS’99), Lecture Notes in Computer Science, Amsterdam, March 1999. Springer-Verlag. DMN +97.
16. X. Du, K. T. McDonnel, E. Nanos, Y. S. Ramakrishna, and S. A. Smolka. Software design, specification, and veriffcation: Lessons learned from the Rether case study. In Proceedings of the Sixth International Conference on Algebraic Methodology and Software Technology (AMAST’97), Sydney, Australia, December 1997. Springer-Verlag.
17. X. Du, S. A. Smolka, and R. Cleaveland. Local model checking and protocol analysis. Software Tools for Technology Transfer, 2 (3): 219-241, November 1999.
18. Y. Dong, S. A. Smolka, E. Stark, and S. M. White. Practical considerations in protocol verification: The E-2C case study. In Proceedings of the Fifth IEEE International Conference on Engineering of Complex Computer Systems (ICECCS’99). IEEE Computer Society Press, 1999.
19. D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8: 231-274, 1987.
20. G. Lüttgen, M. von der Beeck, and R. Cleaveland. Statecharts via process algebra. In J. C. M. Baeten and S. Mauw, editors, CONCUR’99, volume 1664 of Lecture Notes in Computer Science, pages 399-414, Eindhoven, the Netherlands, August 1999. Springer-Verlag.
21. R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
22. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981. S +95.
23. M. Shaw et al. Abstractions for software architecture and tools to support them. IEEE Trans. Software Engineering, 21 (4): 314-335, April 1995.
24. Sun Microsystems, Inc. JavaSpaces Specifications, 1998.
25. P. Tiwari. VPL-tool support for specification and verification of concurrent systems. Master’s thesis, North Carolina State University, Raleigh, 1997.
26. A. C. Uselton and S. A. Smolka. A compositional semantics for Statecharts using labeled transition systems. In Proceedings of CONCUR’94-Fifth International Conference on Concurrency Theory, Uppsala, Sweden, August 1994.
27. A. C. Uselton and S. A. Smolka. A process-algebraic semantics for Statecharts via state refinement. In Proceedings of PROCOMET’94. North Holland/Elsevier, 1994.
28. P. Wyckoff, S. W. McLaughry, T. J. Lehman, and D. A. Ford. TSpaces. IBM Systems Journal, 37 (3), 1998.