Abstract
Communicating Sequential Processes (CSP), is a theoretical framework for discussing concurrent phenomena [8]. Many authors studied the subject, some of them from topological point of view (metrics on processes, completeness and fix–point issues, etc.) In this paper, we begin an investigation into the nature of sets of communicating sequential processes. We employ rough set theory as an adequate tool to classify sets of processes. Sets of sequential processes arise naturally when one considers processes contained within specified bounds that provide their approximate description. Adopting the trace formalism, we may express those bounds in a natural way by means of containment of traces. We endow families of process traces and a fortiori, families of processes, with a rough set topology. We show that basic operators on processes preserve exact sets of processes and they are non–expansive (i.e., non–destructive in terminology of [8]) with respect to the metric D on rough sets [7], [6], restricted to exact sets of processes. We omit details due to imposed paper length. The reader will find those details in [5].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)
Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)
Mislove, M.W.: Topology, Domain Theory, and Theoretical Computer Science. In: [9]
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer, Dordrecht (1992)
Polkowski, L., Semeniuk-Polkowska, M.: Toward exact sets of communicating sequential processes. Fundamenta Informaticae (in print)
Polkowski, L.: Rough Sets. In: Mathematical Foundations, Physica/Springer Vlg, Heidelberg (2002)
Polkowski, L.: Mathematical morphology of rough sets. Bull.Polish Acad. Sci. Math. 41(3), 241–273 (1993)
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall, Europe (1998)
Reed, G.M., Roscoe, A.W., et al.: Topology and Category Theory in Computer Science. Oxford University Press, Oxford (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Polkowski, L., Semeniuk-Polkowska, M. (2004). Sets of Communicating Sequential Processes.A Topological Rough Set Framework. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2004. Lecture Notes in Computer Science(), vol 3213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30132-5_106
Download citation
DOI: https://doi.org/10.1007/978-3-540-30132-5_106
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23318-3
Online ISBN: 978-3-540-30132-5
eBook Packages: Springer Book Archive