Modular specification of concurrent systems with observational logic

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

Volumn 1589, Issue , 1999, Pages 310-325

  Resende, Pedro ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; RECONFIGURABLE HARDWARE; SPECIFICATIONS;

COMPOSITIONALITY; CONCURRENT SYSTEMS; LABELLED TRANSITION SYSTEMS; MODULAR SPECIFICATIONS; NON-OBSERVABLE; OBSERVATIONAL LOGIC; PARALLEL COMPOSITION; PROOF SYSTEM;

COMPUTER CIRCUITS;

EID: 84957667918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48483-3_20     Document Type: Conference Paper

References (24)

1. S. Abramsky, Domain theory in logical form, Ann. Pure Appl. Logic 51 (1991) 1-77. 310, 311
2. S. Abramsky and S. Vickers, Quantales, observational logic and process semantics, Math. Structures Comput. Sci. 3 (1993) 161-227. 310, 310, 311, 313, 315, 316
3. E. Astesiano, A. Giovini, and G. Reggio, Observational structures and their logic. Theoret. Comput. Sci. 96 (1992) 249-283. 310
4. B. Bloom, S. Istrail, and A.R. Meyer, Bisimulation can't be traced, J. ACM 42 (1995) 232-268. 311
5. R.J. van Glabbeek, The linear time - branching time spectrum, in: J.C.M. Baeten and J.W. Klop, ed., Proc. CONCUR'90, LNCS 458 (Springer, Berlin, 1990) 278297. 314
6. R.J. van Glabbeek, The linear time - branching time spectrum II; the semantics of sequential systems with silent moves, Tech. Report, Stanford University, 1993. Extended abstract in: E. Best, ed., Proc. CONCUR'93, LNCS 715 (Springer, Berlin, 1993) 66-81. 314
7. J. Goguen and R. Burstall, Institutions: abstract model theory for specification and programming. J. ACM, 39 (1992) 95-146. 319
8. J.F. Groote, Transition system specifications with negative premises, Theoret. Comput. Sci. 118 (1993) 263-299. 310
9. J.F. Groote and F. Vaandrager, Structured operational semantics and bisimulation as a congruence, Inform. and Comput. 100 (1992) 202-260. 310
10. M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, J. ACM 32 (1985) 137-161. 310
11. C.A.R. Hoare, Communicating Sequential Processes (Prentice Hall, New York, 1985). 311
12. P. Johnstone, Stone Spaces (Cambridge University Press, Cambridge, 1982). 316
13. A. Kurz, Specifying coalgebras with modal logic. Electronic Notes in Theoret. Comput. Sci. 11 (1998). 310
14. A. Mazurkiewicz, Concurrent program schemes and their interpretations. Tech. Report DAIMI PB-78, Aarhus University, Computer Science Department, 1977. 320
15. P. Menezes, A. Sernadas, and J.-F. Costa, Nonsequential automata semantics for a concurrent object-based language. To appear in Electronic Notes in Theoret. Comput. Sci. 320
16. R. Milner, A modal characterisation of observable machine behaviour, in: G. Astesiano and C. Bohm, ed., Proc. CAAP 81, LNCS 112 (Springer, Berlin, 1981) 25-34. 314
17. R. Milner, Communication and Concurrency (Prentice Hall, New York, 1989). 313, 321
18. C. Mulvey, & C Rend. Circ. Mat. Palermo (2) Suppl., No. 12 (1986) 99-104. 311
19. P. Resende, Quantales, finite observations and strong bisimulation. Preprint 26/97, Dep. Math. Tech. Univ. Lisbon, 1997. Submitted
20. P. Resende, Tropological Systems and Observational Logic in Concurrency and Specification. Ph.D. thesis, Universidade Tecnica de Lisboa, 1997. 311, 319
21. K. Rosenthal, Quantales and Their Applications (Longman Scientific & Technical, London, 1990). 311, 312, 312
22. M. Smyth, Powerdomains and predicate transformers: a topological view. In J. Diaz, ed., Automata, Languages and Programming, LNCS 154 (Springer, Berlin, 1983) 662-675. 311
23. S. Vickers, Topology Via Logic (Cambridge University Press, Cambridge, 1989). 310, 311, 311, 313
24. G. Winskel and M. Nielsen, Models for concurrency. In Handbook of Logic in Computer Science, Vol. 4. (Oxford University Press, Oxford, 1995). 320, 321