Tiling Transactions in Rewriting Logic平铺在重写逻辑的交易.pptVIP

Pre-nets, (read arcs) and unfolding:A functorial presentation Paolo Baldan (Venezia) Roberto Bruni (Pisa/Illinois) Ugo Montanari (Pisa) Roadmap Motivation P/T Petri Nets Overall picture Processes / unfolding / algebraic approaches Missing “tokens” Pre-Nets Enlarged picture A missing “token” (Read Arcs) Conclusions Motivation P/T Petri nets (1962) Basic model of concurrency Widely used in different fields (graphical presentation, tools, …) Enriched flavors (contexts, time, probability,…) Have 40 years been sufficient to completely understand P/T nets? Many different semantics proposed over the years Conceptual clarification advocated since the ’90s Techniques from category theory In the small/large, functoriality, universality The picture is still incomplete! Limit of P/T nets, not of the applied techniques P/T Petri Nets P/T Petri Nets P/T Petri Nets Processes Non-sequential behavior of P/T Petri nets Causality and concurrency within a run of the net Unfolding All possible runs in a single structure Causality (?), concurrency (co), conflict (#) between events Algebraic “Petri nets are monoids” Algebra of (concurrent) computations via the lifting of the state structures to computations sequential composition “;” (of computations) plus identities (idle steps) plus parallel composition “?” (from states) plus functoriality of ? (concurrency) lead to a monoidal category of computations Collective Token Philosophy (CTPh) T(_) (commutative processes) Individual Token Philosophy (ITPh) P(_) (concatenable processes) DP(_) (decorated concatenable processes) Q(_) (strong concatenable processes) (Part of) The ITPh Story So Far (Part of) The ITPh Story So Far Objects: S? (commutative monoid) Arrows: Processes + ordering on minimal and maximal tokens in the same place ?a,b = ida?b if a ? b (Part of) The ITPh Story So Far Objects: S? (strings, not multiset) Arrows: Processes + total ordering on minimal and maximal tokens t:u ? v implemented by {tp,q:p ? q}p,q?