We overview recent results concerning the symbolic verification and calculation of siphons and traps for algebraic Petri nets and their relation to the net behavior.

Abstract. Algebraic Petri nets is a well suited formalism to represent the behavior of concurrent and distributed systems by handling complex data. For the analysis of systems modelled in Algebraic Petri nets, model checking and testing are used commonly. Petri nets slicing is getting an attention

their similarities, differences, mutual embedding and possible enhancements. First, we show that Sobocinski’s nets with boundaries are as expressive as Sifakis et al.’s BI(P), the BIP component framework without priorities. Second, we provide a basic algebra of connectors for BI(P) by exploiting Montanari et al.’s

for property based reduction of the state space of Algebraic Petri nets (a variant of high-level Petri nets). To achieve the objective, we propose a slicing algorithm for Algebraic Petri nets (APNSlicing). The proposed algorithm can alleviate state space even for certain strongly connected nets

A detailed observation of the structure of T–invariants leads to the definition of a subset of invariants, which generates the whole set of invariants by linear combination and instantiation and the elements of which have a simple structure by means of computation. Then an algorithmically insoluble problem concerning T–invariants is presented to justify the non–termination of the algorithm which computes this subset of invariants. The algorithm consists mainly of a clever application of term unification.

We study the specific problems concerning the application of reduction rules to algebraic Petri nets. In particular we express the application conditions for the rules by means of term operations and discuss the validity of reduction rules in different interpretations of an algebraic net. Thereby

This paper presents a new prototyping methodology for large concurrent systems modelled by the means of hierarchical algebraic Petri nets. First, the source specifications are automatically translated into a main-stream object-oriented language, thus providing a portable and highlevel initial

We present a symbolic approach to the calculation of siphons and traps for algebraic Petri nets where the color domains are specified without equations and with at most unary operation symbols.

The paper describes a Petri net as well as a structural operational semantics for an algebra of process expressions. It specifically addresses this problem for the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The main result

In the rst part of the paper, place-transition nets and algebraic highlevel nets are translated into algebra transformation systems, thus de ning the net semantics. Both sequential and concurrent nets are considered. Some results concerning the relation between the net semantics resulting from a