Abstract Datatype Semantics for Algebraic HighLevel Nets Using Dynamic Abstract.pdfVIP

Abstract Datatyp e Semantics for Algebraic HighLevel Nets Using Dynamic Abstract Datatyp es Julia Padb erg TU Berlin Abstract Using the recently intro duced extension of algebraic sp eci cations called dynamic abstract data typ es that is based on algebras as states and transformations of algebras as state transformations we intro duce a new kind of semantics for algebraic highlevel nets that esp ecially reects the data typ e part Algebraic highlevel nets are interpreted in this framework where the underlying data typ e remains unchanged and the net and the net b ehaviour are transferred into algebras that represent states and dynamic op erations relating these algebras Thus it is p ossible to give the notions correctness and mo del semantics in the same way as for algebraic sp ecications Nevertheless the abstract data typ e seman tics of algebraic highlevel nets is compatible to the usual case graph semantics known from Petri nets in general Intro duction Petri nets e g Rei Sta are the most common approach to mo del con current and distributed systems within the true concurrency paradigm This b ehaviour is given in several kinds of marking graphs where the no des represent markings and the arcs the switching of enabled transitions Since the b eginning of the eighties HighLevel Petri nets are under investigation HighLevel Petri nets allow structuring either by using sets of colours Coloured Nets Jen by logic formulas PredicateTransition Nets GL the programming lan guage ML Coloured Nets Jen or abstract datatyp es Algebraic HighLevel Nets Vau Hum These variants allow the clear d