Many contemporary computing systems are concurrent and distributed. Many approaches to concurrency formalization have been introduced over last forty years. This monograph combines two theories of concurrency: process algebras and Petri nets. One can hope that combining several competing theories that are mutually complementary can produce a formalism that will be practically useful. This is the primary motivation of the book. The book investigates structural and behavioral aspects of these two models. It also shows strong equivalence between these two models. Process algebras have the following advantages: allow study of connectives directly related to actual programming languages, are compositional, come with a variety of concomitant and derived logics that support reasoning about important properties of systems, and come with variety of algebraic laws that help in systems' refinement and in proving corrctness. Petri nets clearly distinguish local states and local activities of a system (places and transitions, respectively), global states and activities can be derived from basic concepts, Petri nets are graphical, and as bipartite graphs have strong links to graph theory and linear algebra. These last two facts can be used for the verification of systems.
End of preview. The entire article is 5 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/review-of-petri-net-algebra-XlNbbgIwsy
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Review of Petri Net Algebra
Mikolajczak, Boleslaw
Follow ACM SIGACT News
, Volume 33 (2)
Association for Computing Machinery – Jun 1, 2002
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
