Skip to main content
SpringerLink
Log in

Demonic I/O of Compound Diagrams Monotype/Residual Style

  • Conference paper
Book cover Computer and Information Sciences - ISCIS 2003 (ISCIS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2869))

Included in the following conference series:

  • 669 Accesses

Abstract

We show how the notion of relational diagram, introduced by Schmidt, can be used to give a single demonic definition for a wide range of programming constructs. Our main result is Theorem 1, where we show that the input-output (I/O) relation of a compound diagram is equal to that of the diagram in which each sub-diagram has been replaced by its input-output relation. This process is repeated until we obtain elementary diagrams to which we apply the results given in previous work. This is achieved by using monotypes and residuals.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Backhouse, R.C., Hoogendijk, P., Voermans, E., van der Woude, J.: A Relational Theory of Datatypes. Research report, Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands (1992)

    Google Scholar 

  2. Backhouse, R.C., van der Woude, J.: Demonic operators and monotype factors. Mathematical Structures in Computer Science 3(4), 417–433 (1993); Also: Computing Science Note 92/11, Dept. of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands (1992)

    Google Scholar 

  3. Backhouse, R.C., Doornbos, H.: Mathematical induction made calculational. Computing Science Note 94/16, Dept. of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands (1994)

    Google Scholar 

  4. Berghammer, R.: Relational specification of data types and programs. Technical report 9109, Fakultät für Informatik, Universität der Bundeswehr München, Germany (September 1991)

    Google Scholar 

  5. Berghammer, R., Schmidt, G.: Relational specifications. In: Rauszer, C. (ed.) Algebraic Logic, Banach Center Publications, 28, Polish Academy of Sciences (1993)

    Google Scholar 

  6. Berghammer, R., Zierer, H.: Relational algebraic semantics of deterministic and nondeterministic programs. Theoretical Computer Science 43, 123–147 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Brink, C., Kahl, W., Schmidt, G. (eds.): Relational Methods in Computer Science. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  8. Chin, L.H., Tarski, A.: Distributive and modular laws in the arithmetic of relation algebras. University of California Publications 1, 341–384 (1951)

    MathSciNet  Google Scholar 

  9. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)

    MATH  Google Scholar 

  10. Desharnais, J., Möller, B., Tchier, F.: Kleene under a demonic star. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, pp. 355–370. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Desharnais, J., Belkhiter, N., Sghaier, S.B.M., Tchier, F., Jaoua, A., Mili, A., Zaguia, N.: Embedding a demonic semilattice in a relation algebra. Theoretical Computer Science 149(2), 333–360 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Dilworth, R.P.: Non-commutative Residuated Lattices. Trans. Amer. Math. Sci. 46, 426–444 (1939)

    MATH  MathSciNet  Google Scholar 

  13. Mili, J.D., Mili, F.: Relational heuristics for the design of deterministic programs. Acta Informatica 24(3), 239–276 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Schmidt, G.: Programs as partial graphs I: Flow equivalence and correctness. Theoretical Computer Science 15, 1–25 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  15. Schmidt, G., Ströhlein, T.: Relations and Graphs. EATCS Monographs in Computer Science. Springer, Berlin (1993)

    MATH  Google Scholar 

  16. Tchier, F., Desharnais, J.: A generalisation of a theorem of Mills. In: Proceedings of the Tenth International Symposium on Computer and Information Sciences, ISCIS X, Turkey, October 1995, pp. 27–34 (1995)

    Google Scholar 

  17. Tchier, F.: Sémantiques relationnelles démoniaques et vérification de boucles non déterministes. Ph. D. thesis, Département de mathématiques et de statistique, Université Laval, Canada (1996), http://auguste.ift.ulaval.ca/desharn/Theses/index.html

  18. Tchier, F., Desharnais, J.: Applying a generalization of a theorem of Mills to generalized looping structures. In: Science and Engineering in Software Development. A recognition of Harlan D. Mills’ Legacy, Los Angeles, CA, pp. 31–38. IEEE Computer Society Press, Los Alamitos (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, King Saud University, P.O.Box 22452, Riyadh, 11495, Saudi Arabia

    Fairouz Tchier

Authors
  1. Fairouz Tchier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Engineering, Middle East Technical University, Ankara, Turkey

    Adnan Yazıcı

  2. Department of Computer Engineering, Middle East Technical University, 06531, Ankara, Turkey

    Cevat Şener

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tchier, F. (2003). Demonic I/O of Compound Diagrams Monotype/Residual Style. In: Yazıcı, A., Şener, C. (eds) Computer and Information Sciences - ISCIS 2003. ISCIS 2003. Lecture Notes in Computer Science, vol 2869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39737-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39737-3_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20409-1

  • Online ISBN: 978-3-540-39737-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation