Skip to main content

Synthesis of Elementary Net Systems with Context Arcs and Localities

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4546))

Abstract

We investigate the synthesis problem for encl-systems, defined as Elementary Net Systems extended with context (inhibitor and activator) arcs and explicit event localities. Since co-located events are meant to be executed synchronously, the behaviour of such systems is captured by step transition systems, where arcs are labelled by sets of events rather than by single events. We completely characterise transition systems generated by encl-systems after extending the standard notion of a region — defined as a certain set of states — with explicit information about events which, in particular, are responsible for crossing its border. As a result, we are able to construct, for each such transition system, a suitable encl-system generating it.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Dasgupta, S., Potop-Butucaru, D., Caillaud, B., Yakovlev, A.: Moving from weakly endochronous systems to delay-insensitive circuits. Electr. Notes Theor. Comput. Sci. 146(2), 81–103 (2006)

    Article  Google Scholar 

  • Paun, G., Rozenberg, G.: A guide to membrane computing. Theor. Comput. Sci. 287(1), 73–100 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  • Kleijn, J., Koutny, M., Rozenberg, G.: Towards a Petri net semantics for membrane systems. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 292–309. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  • Koutny, M., Pietkiewicz-Koutny, M.: Transition systems of elementary net systems with localities. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 173–187. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  • Montanari, U., Rossi, F.: Contextual nets. Acta Inf. 32(6), 545–596 (1995)

    MATH  MathSciNet  Google Scholar 

  • Billington, J.: Protocol specification using p-graphs, a technique based on coloured petri nets, pp. 293–330 [22] DBLP:conf/ac/1996petri2

    Google Scholar 

  • Donatelli, S., Franceschinis, G.: Modelling and analysis of distributed software using gspns, pp. 438–476 [22] DBLP:conf/ac/1996petri2

    Google Scholar 

  • Esparza, J., Bruns, G.: Trapping mutual exclusion in the box calculus. Theor. Comput. Sci. 153(1-2), 95–128 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  • Kleijn, J., Koutny, M.: Synchrony and asynchrony in membrane systems. In: Workshop on Membrane Computing, pp. 20–39 (2006)

    Google Scholar 

  • Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures, part i: Clans, basic subclasses, and morphisms. Theor. Comput. Sci. 70(3), 277–303 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  • Bernardinello, L., Michelis, G.D., Petruni, K., Vigna, S.: On the synchronic structure of transition systems. In: Desel, J. (ed.) Structures in Concurrency Theory, pp. 69–84. Springer, Heidelberg (1995)

    Google Scholar 

  • Mukund, M.: Petri nets and step transition systems. Int. J. Found. Comput. Sci. 3(4), 443–478 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  • Nielsen, M., Winskel, G.: Models for concurrency. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.): Handbook of Logic in Computer Science, vol. 4, pp. 1–148 (1995)

    Google Scholar 

  • Busi, N., Pinna, G.M.: Synthesis of nets with inhibitor arcs. In: Mazurkiewicz, A.W., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 151–165. Springer, Heidelberg (1997)

    Google Scholar 

  • Pietkiewicz-Koutny, M.: The synthesis problem for elementary net systems with inhibitor arcs. Fundam. Inform. 40(2-3), 251–283 (1999)

    MATH  MathSciNet  Google Scholar 

  • Badouel, E., Darondeau, P.: Theory of regions. In: Reisig, W., Rozenberg, G. (eds.) Petri Nets. LNCS, vol. 1491, pp. 529–586. Springer, Heidelberg (1996)

    Google Scholar 

  • Vogler, W.: Partial order semantics and read arcs. In: Privara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 508–517. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  • Arnold, A.: Finite Transition Systems. Prentice-Hall International, Englewood Cliffs (1994)

    MATH  Google Scholar 

  • Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19(7), 371–384 (1976)

    Article  MATH  Google Scholar 

  • Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary transition systems. Theor. Comput. Sci. 96(1), 3–33 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  • Pietkiewicz-Koutny, M.: Synthesising elementary net systems with inhibitor arcs from step transition systems. Fundam. Inform. 50(2), 175–203 (2002)

    MATH  MathSciNet  Google Scholar 

  • Reisig, W., Rozenberg, G.: Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets, held in Dagstuhl. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets II: Applications. LNCS, vol. 1492, Springer, Heidelberg (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jetty Kleijn Alex Yakovlev

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Koutny, M., Pietkiewicz-Koutny, M. (2007). Synthesis of Elementary Net Systems with Context Arcs and Localities. In: Kleijn, J., Yakovlev, A. (eds) Petri Nets and Other Models of Concurrency – ICATPN 2007. ICATPN 2007. Lecture Notes in Computer Science, vol 4546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73094-1_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73094-1_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73093-4

  • Online ISBN: 978-3-540-73094-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics