Calculi of net structures and sets are similar

Ludwik Czaja

RAIRO - Theoretical Informatics and Applications (2007)

  • Volume: 42, Issue: 2, page 271-284
  • ISSN: 0988-3754

Abstract

top
Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even a Boolean algebra. As a consequence, some representation theorems of this algebra are stated. The primitive objects are atomic net structures containing one transition with at most one pre-place or post-place (but not both). A simple example of a production system constructed by making use of the operations (and its transformations) is given. Some remarks on behavioural properties of compound nets are stated, in particular, how some constructing strategies may help to infer liveness. The latter issue is limited to semantics of place/transition nets without weights on arrows and with unbounded capacity of places and is not extensively investigated, since the main objective is focused on a calculus of net structures.

How to cite

top

Czaja, Ludwik. "Calculi of net structures and sets are similar." RAIRO - Theoretical Informatics and Applications 42.2 (2007): 271-284. <http://eudml.org/doc/92871>.

@article{Czaja2007,
abstract = { Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even a Boolean algebra. As a consequence, some representation theorems of this algebra are stated. The primitive objects are atomic net structures containing one transition with at most one pre-place or post-place (but not both). A simple example of a production system constructed by making use of the operations (and its transformations) is given. Some remarks on behavioural properties of compound nets are stated, in particular, how some constructing strategies may help to infer liveness. The latter issue is limited to semantics of place/transition nets without weights on arrows and with unbounded capacity of places and is not extensively investigated, since the main objective is focused on a calculus of net structures. },
author = {Czaja, Ludwik},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Net structures; synchronised operations; distributive lattice; Boolean algebra; representation theorems; synchronised union; synchronised intersection; synchronised difference},
language = {eng},
month = {9},
number = {2},
pages = {271-284},
publisher = {EDP Sciences},
title = {Calculi of net structures and sets are similar},
url = {http://eudml.org/doc/92871},
volume = {42},
year = {2007},
}

TY - JOUR
AU - Czaja, Ludwik
TI - Calculi of net structures and sets are similar
JO - RAIRO - Theoretical Informatics and Applications
DA - 2007/9//
PB - EDP Sciences
VL - 42
IS - 2
SP - 271
EP - 284
AB - Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even a Boolean algebra. As a consequence, some representation theorems of this algebra are stated. The primitive objects are atomic net structures containing one transition with at most one pre-place or post-place (but not both). A simple example of a production system constructed by making use of the operations (and its transformations) is given. Some remarks on behavioural properties of compound nets are stated, in particular, how some constructing strategies may help to infer liveness. The latter issue is limited to semantics of place/transition nets without weights on arrows and with unbounded capacity of places and is not extensively investigated, since the main objective is focused on a calculus of net structures.
LA - eng
KW - Net structures; synchronised operations; distributive lattice; Boolean algebra; representation theorems; synchronised union; synchronised intersection; synchronised difference
UR - http://eudml.org/doc/92871
ER -

References

top
  1. G. Berthelot, Checking properties of nets using transformations, in Advances in Petri Nets, edited by G. Goos and J. Hartmanis. Lect. Notes Comput. Sci.222 (1985).  
  2. E. Best, R. Devillers, M. Koutny, The box algebra = Petri nets + process expressions. Inform. Comput.178 (2002) 44–100.  
  3. L. Czaja, Making Nets Abstract and Structured, in Advances in Petri Nets, edited by G. Goos and J. Hartmanis. Lect. Notes Comput. Sci.222 (1985) 181–202.  
  4. L. Czaja, Equations for message passing. Fund. Inform.72 (2006) 81–93.  
  5. L. Czaja, Interpreted nets. Fund. Inform.79 (2007) 283–293.  
  6. P. Degano, J. Meseguer and U. Montanari, Axiomatising the algebra of net computations and processes. Acta Inform.33 (1996) 641–667.  
  7. J. Engelfriet, Branching processes of Petri nets. Acta Inform.28 (1991) 575–591.  
  8. R. Gorrieri, Refinement, atomicity and transactions for process description languages. Ph.D. Thesis. Dipartimento di Informatica, Universita di Pisa, TD - 2/91 (1991).  
  9. C.A.R. Hoare, Notes on Communicating Sequential Processes. Oxford University Computing Laboratory Technical Monograph PRG-33 (1983).  
  10. K. Kuratowski and A. Mostowski, Set Theory. North Holland, Amsterdam, PWN, Warsaw (1967).  
  11. A. Mazurkiewicz, Semantics of concurrent systems: a modular fixed point trace approach. Internal Report, Institute of Applied Mathematics and Computer Science, University of Leiden, The Netherlands (1984).  
  12. A. Mazurkiewicz, Introduction to Trace Theory, in The Book of Traces, edited by V. Diekert and G. Rozenberg, World Scientific (1995) 3–41.  
  13. J. Meseguer and U. Montanari. Petri nets are monoids. Inform. Comput.88 (1990) 105–155.  
  14. J. Meseguer, U. Montanari and V. Sassone, On the Semantics of Place/Transition Petri Nets. Dipartimento di Informatica Universita di Pisa, TR - 27/92 (1992).  
  15. R. Milner, Communication and Concurrency. International Series in Computer Science, Prentice Hall (1989).  
  16. H. Rasiowa and R. Sikorski, The Mathematics of Metamathematics. PWN, Warsaw (1968).  
  17. W. Reisig, Petri Nets, An Introduction. EATCS Monographs on Theoretical Computer Science, Springer Verlag (1985).  
  18. M.H. Stone, The theory of representations for Boolean algebras. Trans. Amer. Math. Soc. 40 (1936) 37–111.  
  19. H. Wimmel and L. Priese, Algebraic characterisation of Petri net pomset semantics, CONCUR'97: Concurrency Theory. Lect. Notes Comput. Sci.1243 (1997) 403–420.  
  20. J. Winkowski, An algebraic description of system behaviours. Theoret. Comput. Sci.21 (1982) 315–340.  
  21. G. Winskel, Petri nets, algebras, morphisms and compositionality. Inform. Comput.72 (1987) 197–238.  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.