Skip to main content

Synthesis of Synchronized Concurrent Systems Specified by Information Systems

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6954))

Included in the following conference series:

  • 1857 Accesses

Abstract

We present some applications of a method for synthesis of concurrent models from the specification given by an information system and/or decision rules. A solution generated by the method for the well known problem in concurrency is represented by colored Petri nets (CP-nets, in short). The method allows to generate automatically an appropriate CP-net from the specification given by an information system and/or decision rules. This kind of specification should be more convenient for the designers of concurrent systems than directly drawing a Petri net, especially in cases of large in size net models. The CP-nets produced automatically by the application of the method are sometimes not in the optimal form and some modification procedure could be applied to get more optimal solutions. This problem is also discussed in the paper.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Rough Set Database System (Option: Software), http://rsds.univ.rzeszow.pl

  2. CPN Tools Homepage, http://cpntools.org/

  3. RSES Homepage: http://logic.mimuw.edu.pl/rses

  4. ROSETTA Homepage: http://idi.ntu.no/aleks/rosetta

  5. Cios, K., Pedrycz, W., Świniarski, R.: Data Mining. Methods for Knowledge Discovery. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  6. Delimata, P., Moshkov, M., Skowron, A., Suraj, Z.: Inhibitory Rules in Data Analysis. In: A Rough Set Approach. Springer, Heidelberg (2009)

    Google Scholar 

  7. Jensen, K.: Coloured Petri Nets, vol. 1-3. Springer, Heidelberg (1997)

    Book  MATH  Google Scholar 

  8. Kodratoff, Y., Michalski, R. (eds.): Machine Learning 3. Morgan Kaufmann Publ., San Francisco (1990)

    MATH  Google Scholar 

  9. Moshkov, M., Skowron, A., Suraj, Z.: Maximal consistent extensions of information systems relative to their theories. Information Sciences 178(12), 2600–2620 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Pancerz, K., Suraj, Z.: Discovering concurrent models from data tables with the ROSECON system. Fundamenta Informaticae 60(1-4), 251–268 (2004)

    MATH  Google Scholar 

  11. Pancerz, K., Suraj, Z.: Rough sets for discovering concurrent system models from data tables. In: Hassanien, A. et al. (eds.) Rough Computing. Theories, Technologies and Applications, pp. 239–268. Information Science Reference, Hershey (2008)

    Google Scholar 

  12. Pawlak, Z.: Rough Sets. In: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    Google Scholar 

  13. Pawlak, Z.: Concurrent versus sequential - the rough sets perspective. Bulletin of EATCS 48, 178–190 (1992)

    MATH  Google Scholar 

  14. Reisig, W.: Petri Nets. Springer, Berlin (1985)

    Book  MATH  Google Scholar 

  15. Skowron, A., Suraj, Z.: Rough sets and concurrency. Bulletin of the Polish Academy of Sciences, Technical Sciences 41(3), 237–254 (1993)

    MATH  Google Scholar 

  16. Skowron, A., Suraj, Z.: Synthesis of concurrent systems specified by information systems. ICS Report 4 (1993)

    Google Scholar 

  17. Skowron, A.: Discovery of process models from data and domain knowledge: A rough-granular approach. In: Ghosh, A., De, R., Pal, S. (eds.) PReMI 2007. LNCS, vol. 4815, pp. 192–197. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Suraj, Z.: Rough set methods for the synthesis and analysis of concurrent processes. In: Polkowski, L. (ed.) Rough Set Methods and Applications, pp. 379–488. Springer, Berlin (2000)

    Chapter  Google Scholar 

  19. Suraj, Z.: Discovering concurrent process models in data: A rough set approach. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS(LNAI), vol. 5908, pp. 12–19. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  20. Swiniarski, R.W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recognition Letters 24(6), 833–849 (2003)

    Article  MATH  Google Scholar 

  21. Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J. (eds.): RSCTC 2004. LNCS(LNAI), vol. 3066. Springer, Heidelberg (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suraj, Z., Pancerz, K. (2011). Synthesis of Synchronized Concurrent Systems Specified by Information Systems. In: Yao, J., Ramanna, S., Wang, G., Suraj, Z. (eds) Rough Sets and Knowledge Technology. RSKT 2011. Lecture Notes in Computer Science(), vol 6954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24425-4_79

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24425-4_79

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24424-7

  • Online ISBN: 978-3-642-24425-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics