Asynchronous Links in the PBC and M-Nets
暂无分享,去创建一个
[1] Hanna Klaudel,et al. M-net Calculus Based Semantics for Triggers , 1998, ICATPN.
[2] Raymond R. Devillers,et al. General Refinement and Recursion for the Box Calculus: (Hildesheimer Informatik-Bericht 26/92) , 1992 .
[3] Raymond R. Devillers,et al. General Refinement and Recursion Operators for the Petri Box Calculus , 1993, STACS.
[4] Hans Fleischhack,et al. A Petri net semantics for B(PN)/sup 2/ with procedures , 1997, Proceedings of PDSE '97: 2nd International Workshop on Software Engineering for Parallel and Distributed Systems.
[5] Hanna Klaudel,et al. Refinement-based Semantics of Parallel Procedures , 1999, PDPTA.
[6] Hanna Klaudel,et al. M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages , 1998, Acta Informatica.
[7] Gernot Richter. Counting Interfaces for Discrete Time Modeling , 2001 .
[8] Maciej Koutny,et al. Operational Semantics for the Petri Box Calculus , 1994, CONCUR.
[9] Richard P. Hopkins,et al. B(PN)2 - a Basic Petri Net Programming Notation , 1993, PARLE.
[10] Reiner Durchholz,et al. Causality, time, and deadlines , 1991, Data Knowl. Eng..
[11] Hanna Klaudel,et al. Refinement and Recursion in a High Level Petri Box Calculus , 1995, STRICT.
[12] Raymond R. Devillers,et al. General Refinement for High Level Petri Nets , 1997, FSTTCS.
[13] Raymond R. Devillers,et al. The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.
[14] Jon G. Hall. An algebra of high level Petri nets , 1996 .
[15] Eike Best,et al. A Memory Module Specification Using Composable High-Level Petri Nets , 1994, Formal Systems Specification.