Skip to main content

Fuzzy Bigraphs

An Exercise in Fuzzy Communicating Agents

  • Chapter
  • First Online:
Algebraic Techniques and Their Use in Describing and Processing Uncertainty

Part of the book series: Studies in Computational Intelligence ((SCI,volume 878))

Abstract

Bigraphs and their algebra is a model of concurrency. Fuzzy bigraphs are a generalization of birgraphs intended to be a model of concurrency that incorporates vagueness. More specifically, this model assumes that agents are similar, communication is not perfect, and, in general, everything is or happens to some degree.

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

Access this chapter

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 EPUB and 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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    In set theory the natural number 0 is defined to be the empty set, that is, \(0{\mathop {=}\limits ^{\mathrm {def}}}\emptyset \). If x is a natural number, then \(x^{+}\) is its successor and is defined as follows:

    $$\begin{aligned} x^{+}{\mathop {=}\limits ^{\mathrm {def}}}x\cup \{x\}. \end{aligned}$$

    Thus, numbers are identified with sets and so

    $$\begin{aligned} 1&= 0^{+} = \{0\}=\{\emptyset \}\\ 2&= 1^{+} = \{0,1\}\\ 3&= 2^{+} = \{0,1,2,\}\\ \vdots&\qquad \vdots \\ m&= (m-1)^{+} = \{0,1,2,\ldots ,m-1\} \end{aligned}$$

    The reader should consult any basic introduction to set theory for more details (e.g., see [7]).

  2. 2.

    A partially ordered set P is a frame if and only if

    1. 1.

      every subset has a least upper bound;

    2. 2.

      every finite subset has a greatest lower bound; and

    3. 3.

      the operator \(\wedge \) distributes over \(\vee \):

      $$\begin{aligned} x\wedge \bigvee Y=\bigvee \left\{ x\wedge y\mathrel {\bigm |}y\in Y \right\} . \end{aligned}$$

    .

References

  1. Akiba, K., Abasnezhad, A. (eds.): Vague Objects and Vague Identity, no. 33 in Logic, Epistemology, and the Unity of Science. Springer, Dordrecht, The Netherlands (2014)

    Google Scholar 

  2. Benford, S., Calder, M., Rodden, T., Sevegnani, M.: On lions, impala, and bigraphs: modelling interactions in physical/virtual spaces. ACM Trans. Comput.-Hum. Interact. 23(2), 9:1–9:56 (2016)

    Google Scholar 

  3. Berge, C.: Graphs and Hypergraphs, 2nd edn. North-Holland Publishing Company, Amsterdam (1976)

    MATH  Google Scholar 

  4. Buckley, J.J., Eslami, E.: An Introduction to Fuzzy Logic and Fuzzy Sets. No. 13 in Advances in Soft Computing. Springer-Verlag, Berlin (2002)

    Google Scholar 

  5. Chang, S.S.L., Zadeh, L.A.: On fuzzy mapping and control. IEEE Transactions on Systems, Man, and Cybernetics SMC-2(1), 30–34 (1972)

    Google Scholar 

  6. Craine, W.L.: Fuzzy Hypergraphs and Fuzzy Intersection Graphs. Ph.D. thesis, University of Idaho (1993)

    Google Scholar 

  7. Halmos, P.R.: Naive Set Theory. Springer-Verlag, New York (1974)

    Book  Google Scholar 

  8. Jensen, O.H., Milner, R.: Bigraphs and mobile processes. Tech. Rep. 570, Computer Laboratory, University of Cambridge, UK (2003)

    Google Scholar 

  9. Krivine, J., Milner, R., Troina, A.: Stochastic Bigraphs. Electronic Notes in Theoretical Computer Science 218, 73–96 (2008). Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXIV)

    Google Scholar 

  10. Leinster, T.: Basic Category Theory. No. 143 in Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge (2014)

    Google Scholar 

  11. Milner, R.: Communication and Concurrency. Prentice Hall, Hemel Hempstead, Hertfordshire, UK (1989)

    MATH  Google Scholar 

  12. Milner, R.: Communicating and Mobile Systems: The \(\pi \)-Calculus. Cambridge University Press, Cambridge, UK (1999)

    MATH  Google Scholar 

  13. Milner, R.: The Space and Motion of Communicating Agents. Cambridge University Press, Cambridge, UK (2009)

    Book  Google Scholar 

  14. Rosenfeld, A.: Fuzzy Graphs. In: Zadeh, L.A., Fu, K.S., Tanaka, K., Shimura, M. (eds.) Fuzzy Sets and their Applications to Cognitive and Decision Processes, pp. 77–95. Academic Press, New York (1975)

    Google Scholar 

  15. Šostak, A.: Fuzzy categories related to algebra and topology. Tatra Mountains Mathematical Publications 16(1), 159–185 (1999). Available from the web site of the Slovak Academy of Sciences

    Google Scholar 

  16. Syropoulos, A.: Fuzzy Categories (2014). arXiv:1410.1478v1 [cs.LO]

  17. Syropoulos, A.: Theory of Fuzzy Computation. No. 31 in IFSR International Series on Systems Science and Engineering. Springer-Verlag, New York (2014)

    Google Scholar 

  18. Syropoulos, A.: On TAE Machines and Their Computational Power. Logica Universalis (2018). https://doi.org/10.1007/s11787-018-0196-5

Download references

Acknowledgements

I would like to thank the editors of this volume for inviting me to present my work and I would like to thank the anonymous reviewer for her comments and suggestions that helped me to substantially improve the presentation of my work.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Syropoulos, A. (2020). Fuzzy Bigraphs. In: Nguyen, H., Kreinovich, V. (eds) Algebraic Techniques and Their Use in Describing and Processing Uncertainty. Studies in Computational Intelligence, vol 878. Springer, Cham. https://doi.org/10.1007/978-3-030-38565-1_13

Download citation

Publish with us

Policies and ethics