Results 141 to 150 of about 462,160 (174)

An algebraic characterization of independence of Petri net processes

Information Processing Letters, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Algebraic characterization of petri net pomset semantics

1997
Sets of pomsets are frequently used as a true-concurrency, linear-time semantics of Petri nets. For a Petri net N, let P(N), a set of pomsets, denote the pomset behaviour of N, and let P:=P(N)|N is a Petri net} denote the class of pomset behaviours of Petri nets, a generalization of L, the class of all Petri net languages.
Harro Wimmel, Lutz Priese
openaire   +1 more source

Petri nets are monoids: a new algebraic foundation for net theory

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, 2003
The composition and extraction mechanisms of Petri nets are at present inadequate. This problem is solved by viewing place/transition Petri nets as ordinary, directed graphs equipped with two algebraic operations corresponding to parallel and sequential composition of transitions.
José Meseguer 0001, Ugo Montanari
openaire   +1 more source

Verification of distributed algorithms with algebraic Petri Nets

1997
This paper demonstrates by help of an example how algebraic Petri nets can be used for modelling and verification of distributed algorithms. For lack of space we could only sketch the used proof techniques; still the proof should provide a flavour of our method.
Ekkart Kindler, Wolfgang Reisig
openaire   +1 more source

Algebraic Characterization of Petri Nets

1979
Let C^n be the direct product of the bicyclic monoid C, taken n times, where n is a positive integer. It is shown that (1) every Petry net with n places can be represented by a finite subset of C^n represents a Petri net with n places, and (3) the firing rule of Petri net with n places, and (3) the firing rule of Petri nets can be defined as a faithful
openaire   +2 more sources

Algebraic Higher-Order Nets: Graphs and Petri Nets as Tokens

2003
Petri nets and Algebraic High-Level Nets are well-known to model parallel and concurrent systems. In this paper, we introduce the concept of Algebraic Higher-Order Nets, which allow to have dynamical tokens like graphs or (ordinary low-level) Petri nets.
Kathrin Hoffmann, Till Mossakowski
openaire   +2 more sources

Petri nets, process algebras and concurrent programming languages

1998
This paper discusses issues that arise when process algebras and Petri nets are linked; in particular, operators, compositional ity, recursion, refinement and equivalences. It uses the box algebra in order to show how Petri nets can be manipulated algebraically.
Best E, Devillers R, Koutny M
openaire   +3 more sources

Algebraic Petri nets and their applications

Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications meeting the challenge of complexity in real-world computing applications - CSC '94, 1994
Chieh-ying Kan, Xudong He
openaire   +2 more sources

Petri nets, algebras and morphisms

1985
It is shown how a category of Petri nets can be viewed as a subcategory of two sorted algebras over multisets. This casts Petri nets in a familiar framework and provides a useful idea of morphism on nets different from the conventional definition – the morphisms here respect the behaviour of nets.
openaire   +1 more source

Verification of siphons and traps for algebraic Petri nets

1997
Siphons and traps are structures which allow for some implications on the net's behaviour and can be used in manual correctness proofs for concurrent systems. We introduce symbolic representations of siphons and traps which work quite well even in infinite cases and are still intuitively readable.
openaire   +1 more source