A semantic theory for heterogeneous system design

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

Volumn 1974, Issue , 2000, Pages 312-324

  Cleaveland, Rance ^a   Lüttgen, Gerald ^b  

^a Stony Brook University   (United States)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; SEMANTICS; SOFTWARE ENGINEERING; SYSTEMS ANALYSIS;

COMMUNICATIONS PROTOCOLS; HETEROGENEOUS SYSTEMS; LABELED TRANSITION SYSTEMS; PREORDERS; SEMANTIC THEORIES; TESTING THEORIES;

TEMPORAL LOGIC;

EID: 84947749282     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44450-5_25     Document Type: Conference Paper

References (27)

1. [1] M. Abadi and L. Lamport. Composing specifications. TOPLAS, 15(1):73–132, 1993. See also: Conjoining Specifications, TOPLAS, 17(3):507–534, 1995.
2. [2] J.A. Bergstra, A. Ponse, and S.A. Smolka. Handbook of Process Algebra. Elsevier Science, 2000.
3. [3] E. Brinksma, A. Rensink, and W. Vogler. Fair testing. In CONCUR’95, volume 962 of LNCS, pages 313–328. Springer-Verlag, 1995.
4. [4] S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. J. of the ACM, 31(3):560–599, 1984.
5. [5] E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
6. [6] E.M. Clarke, D.E. Long, and K.L. McMillan. Compositional model checking. In LICS’89, pages 353–362. IEEE Computer Society Press, 1989.
7. [7] R. Cleaveland and G. Lüttgen. Model checking is refinement: Relating Büchi testing and linear-time temporal logic. Technical Report 2000-14, Institute for Computer Applications in Science and Engineering, March 2000.
8. [8] R. DeNicola and M.C.B. Hennessy. Testing equivalences for processes. TCS, 34:83–133, 1983.
9. [9] R. DeNicola and F. Vaandrager. Three logics for branching bisimulation. J. of the ACM, 42(2):458–487, 1995.
10. [10] O. Grumberg and D.E. Long. Model checking and modular verification. TOPLAS, 16(3):843–871, 1994.
11. [11] M.C.B. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. of the ACM, 32(1):137–161, 1985.
12. [12] R. Kaivola and A. Valmari. The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In CONCUR’92, volume 630 of LNCS, pages 207–221. Springer-Verlag, 1992.
13. [13] O. Kupferman and M.Y. Vardi. Modular model checking. In Compositionality: The Significant Difference, volume 1536 of LNCS. Springer-Verlag, 1997.
14. [14] R.P. Kurshan. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, 1994.
15. [15] L. Lamport. The temporal logic of actions. TOPLAS, 16(3):872–923, 1994.
16. [16] K.G. Larsen. The expressive power of implicit specifications. TCS, 114(1):119–147, 1993.
17. [17] O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Workshop on Logics of Programs, volume 193 of LNCS, pages 196–218. Springer-Verlag, 1985.
18. [18] M.G. Main. Trace, failure and testing equivalences for communicating processes. J. of Par. Comp., 16(5):383–400, 1987.
19. [19] R. Milner. Communication and Concurrency. Prentice Hall, 1989.
20. [20] K. Narayan Kumar, R. Cleaveland, and S.A. Smolka. Infinite probabilistic and nonprobabilistic testing. In FSTTCS’98, volume 1530 of LNCS, pages 209–220. Springer-Verlag, 1998.
21. [21] V. Natarajan and R. Cleaveland. Divergence and fair testing. In ICALP’95, volume 944 of LNCS, pages 684–695. Springer-Verlag, 1995.
22. [22] A. Pnueli. The temporal logic of programs. In FOCS’77, pages 46–57. IEEE Computer Society Press, 1977.
23. [23] A. Puhakka and A. Valmari. Weakest-congruence results for livelock-preserving equivalences. In CONCUR’99, volume 1664 of LNCS, pages 510–524. Springer-Verlag, 1999.
24. [24] B. Steffen and A. Ingólfsdóttir. Characteristic formulae for CCS with divergence. Inform. & Comp., 110(1):149–163, 1994.
25. [25] C. Stirling. Modal logics for communicating systems. TCS, 49:311–347, 1987.
26. [26] A. Valmari and M. Tiernari. Compositional failure-based semantics models for basic LOTOS. FAC, 7(4):440–468, 1995.
27. [27] M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In LICS’86, pages 332–344. IEEE Computer Society Press, 1986.