On the duality between observability and reachability

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

Volumn 2030, Issue , 2001, Pages 72-87

  Bidoit, Michel ^a   Hennicker, Rolf ^b   Kurz, Alexander ^c  

^a CNRS   (France)

^b UNIVERSITY OF MUNICH   (Germany)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; OBSERVABILITY;

DATA TYPE; OBSERVABLE BEHAVIOR; OBSERVATIONAL LOGIC; REACHABILITY;

SOFTWARE DESIGN;

EID: 84945254486     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45315-6_5     Document Type: Conference Paper

References (19)

1. J. Adámek, H. Herrlich, and G. Strecker. Abstract and Concrete Categories. John Wiley & Sons, 1990.
2. M.A. Arbib and E.G. Manes. Adjoint machines, state-behaviour machines, and duality. Journ. of Pure and Applied Algebra, 6:313-344, 1975.
3. M. Bidoit and R. Hennicker. Observer complete definitions are behaviourally coherent. In OBJ/CafeOBJ/Maude at Formal Methods '99, pages 83-94. THETA, 1999.
4. M. Bidoit, R. Hennicker, and M. Wirsing. Behavioural and abstractor specifications. Science of Computer Programming, 25:149-186, 1995.
5. J. Goguen and R. Burstall. Institutions: abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39 (1):95-146, 1992.
6. J. Goguen and G. Roşu. Hiding more of hidden algebra. In J.M. Wing, J. Woodcock, and J. Davies, editors, Formal Methods (FM'99), volume 1709 of LNCS, pages 1704-1719. Springer, 1999.
7. R. Hennicker and M. Bidoit. Observational logic. In Armando Haeberer, editor, Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of LNCS. Springer, 1999.
8. R. Hennicker and A. Kurz. (Ω, Ξ)-logic: On the algebraic extension of coalgebraic specifications. In B. Jacobs and J. Rutten, editors, Coalgebraic Methods in Computer Science (CMCS'99), volume 19 of Electronic Notes in Theoretical Computer Science, pages 195-211, 1999.
9. C.A.R. Hoare. Proofs of correctness of data representations. Acta Informatica, 1:271-281, 1972.
10. M. Hofmann and D.T. Sannella. On behavioural abstraction and behavioural satisfaction in higher-order logic. In TAPSOFT '95, volume 915 of LNCS, pages 247-261. Springer, 1995.
11. B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. EATCS Bulletin, 62, 1997.
12. R. E. Kalman, P. L. Falb, and M. A. Arbib. Topics in Mathematical System Theory. McGraw-Hill, 1969.
13. J. Loeckx, H.-D. Ehrich, and M. Wolf. Specification of Abstract Data Types. Wiley and Teubner, 1996.
14. Grant Malcolm. Behavioural equivalence, bisimulation, and minimal realisation. In M. Haveraaen, O. Owe, and O.-J. Dahl, editors, Recent Trends in Data Type Specification, volume 1130 of LNCS, pages 359-378. Springer, 1996.
15. CoFI Task Group on Language Design. Casl - the cofi algebraic specification language - summary. http://www.brics.dk/Projects/CoFI/Documents/CASL/Summary/.
16. Horst Reichel. Initial computability, algebraic specifications, and partial algebras. Oxford, Clarendon Press, 1987.
17. D.T. Sannella and A. Tarlecki. On observational equivalence and algebraic specification. Journal Comput. System Sci., 34:150-178, 1987.
18. D.T. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Computation, 76:165-210, 1988.
19. M. Wirsing and M. Broy. A modular framework for specification and information. In F. Orejas J. Diaz, editor, TAPSOFT '89, volume 351 of LNCS, pages 42-73. Springer, 1989.