On the integration of observability and reachability concepts

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

Volumn 2303, Issue , 2002, Pages 21-36

  Bidoit, Michel ^a   Hennicker, Rolf ^b  

^a CNRS   (France)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; OBSERVABILITY; SEMANTICS; SPECIFICATIONS;

BEHAVIORAL PROPERTIES; IDEALIZED MODELS; PROOF SYSTEM; REACHABILITY; SOFTWARE SYSTEMS; SOUND AND COMPLETE;

BEHAVIORAL RESEARCH;

EID: 84948956767     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45931-6_3     Document Type: Conference Paper

References (20)

1. [1] E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brückner, P.D. Mosses, D. Sannella, and A. Tarlecki. Casl: The Common Algebraic Specification Language. Theoretical Computer Science, 2002. To appear.
2. [2] E. Astesiano, H.-J. Kreowski, and B. Krieg-Brückner, editors. Algebraic Foundations of Systems Specification. Springer, 1999.
3. [3] M. Bidoit and R. Hennicker. Observer complete definitions are behaviourally coherent. In Proc. OBJ/CafeOBJ/Maude Workshop at FM’99, pages 83–94. THETA, 1999. http://www.lsv.ens-cachan.fr/Publis/PAPERS/CafeOBJ.ps.
4. [4] M. Bidoit and R. Hennicker. On the integration ofobserv ability and reachability concepts. Research Report LSV-02-2, 2002. Long version ofthis paper. http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/rr-lsv-2002-2.rr.ps.
5. [5] M. Bidoit, R. Hennicker, and A. Kurz. On the duality between observability and reachability. In Proc. FOSSACS’01, LNCS 2030, pages 72–87. Springer, 2001. Long version: http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/ rr-lsv-2001-7.rr.ps.
6. [6] M. Bidoit, R. Hennicker, and M. Wirsing. Behavioural and abstractor specifications. Science of Computer Programming, 25:149–186, 1995.
7. [7] T. Borzyszkowski. Completeness ofa logical system for structured specifications. In Recent Trends in Algebraic Development Techniques, LNCS 1376, pages 107–121. Springer, 1998.
8. [8] R. Diaconescu and K. Futatsugi. CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. AMAST Series in Computing 6. World Scientific, 1998.
9. [9] J. Goguen and R. Burstall. Institutions: abstract model theory for specification and programming. Journal of the ACM, 39 (1):95–146, 1992.
10. [10] J. Goguen and G. Roşu. Hiding more ofhidden algebra. In Proc. FM’99, LNCS 1709, pages 1704–1719. Springer, 1999.
11. [11] R. Hennicker and M. Bidoit. Observational logic. In Proc. AMAST’98, LNCS 1548, pages 263–277. Springer, 1999.
12. [12] M. Hofmann and D. Sannella. On behavioural abstraction and behavioural satisfaction in higher-order logic. Theoretical Computer Science, 167:3–45, 1996.
13. [13] H. J. Keisler. Model Theory for Infinitary Logic. North-Holland, 1971.
14. [14] J. Loeckx, H.-D. Ehrich, and M. Wolf. Specification of Abstract Data Types. Wiley and Teubner, 1996.
15. [15] M.P. Nivela and F. Orejas. Initial behaviour semantics for algebraic specifications. In Recent Trends in Data Type Specification, LNCS 332, pages 184–207. Springer, 1988.
16. [16] P. Padawitz. Swinging data types: syntax, semantics, and theory. In Recent Trends in Data Type Specification, LNCS 1130, pages 409–435. Springer, 1996.
17. [17] Horst Reichel. Initial computability, algebraic specifications, and partial algebras. Oxford, Clarendon Press, 1987.
18. [18] D.T. Sannella and A. Tarlecki. On observational equivalence and algebraic specification. Journal of Computer and System Sciences, 34:150–178, 1987.
19. [19] D.T. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Computation, 76:165–210, 1988.
20. [20] M. Wirsing and M. Broy. A modular framework for specification and information. In Proc. TAPSOFT’89, LNCS 351, pages 42–73. Springer, 1989.