Katalog der Deutschen Nationalbibliothek

Characterisation of a class of Petri net solvable transition systems

Petri net synthesis and modal specifications

Characterising Petri net solvable binary words

The power of prime cycles and distance paths

Characterisation of the state spaces of marked graph Petri nets

Persistent systems with unique minimal cyclic parikh vectors

Slicing and reduction techniques for model checking Petri nets

Some evidence on the consistency of categorical semantics for timed interleaving behaviors

Separability in persistent petri nets : Bericht

Petri net algebra

Petri Net Algebra

Generalised composition operations for high-level Petri nets

Recursion and Petri nets

Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets

Relational semantics revisited

The box algebra = Petri nets + process expressions

A memory module specification using composable high level Petri nets

Coloured nets with curry

Partial order verification with PEP

Semantics of sequential and parallel programs : [translation]

A class of composable high level Petri nets. An m-net semantics of B(PN)2

A refined view of the box algebra. Solving recursive net equations

Operational and denotational semantics for the box algebra

PEP : programming environment based on Petri nets ; workshop, October 11 - 12, 1994, Humboldt-Universität zu Berlin ; proceedings

Semantik : Theorie sequentieller und paralleler Programmierung

Compositional process semantics of Petri boxes

Design methods based on nets : DEMON

Final report

First-year results of the esprit basic research WG 6067 CALIBAN (causal calculi based on nets)

Operational semantics for the Petri box calculus

Proceedings / CONCUR '93

"What good are partial orders?" : proceedings of a workshop, Sheffield, June (1992)

B(PN)2 - a Basic Petri net programming notation

Esprit basic research action 3148 DEMON (design methods based on nets) : aims, scope and achievements

General refinement and recursion for the box calculus

The box calculus : a new causal algebra with multi label communication

3rd Workshop on Concurrency and Compositionality : Goslar, March 5 - 8, 1991

Design methods based on nets : DEMON

Progress report of the Esprit basic research action 3148

Model checking of persistent petri nets

Overview of the results of the ESPRIT basic research action 3148 : DEMON - design methods based on nets

Partial order behaviour and structure of Petri nets

Characterisation [Characterization] of home states in free choice systems

Design methods based on nets : Esprit basic research action DEMON

Partial order semantics of priority systems

Structure and behaviour of concurrent systems : selected results of the esprit basic research action no. 3148: D→E→M→O→N (design methods based on nets)

Technical annex for the ESPRIT basic research action 3148, Design methods based on nets (DEMON)

Kausale Semantik nichtsequentieller Programme

Minimal deadlocks in free choice nets

Partial order behaviour and structure of Petri nets

Nonsequential processes : a Petri net view

Nonsequential Processes : A Petri Net View

Semantic independence

Notations and terminology on Petri Net theory

Concurrent behaviour: sequences, processes and programming languages

Concurrent systems and processes : final report on the foundational part of the project BEGRUND

Free choice systems have home states

Concurrent behaviour : sequences, processes and axioms

D-continuity: a study in relating system properties to process properties

Consistent relational and predicate transformer semantics of a sequential deterministic language supporting exception handling

D-continuity in partially ordered sets

Free choice systems have home states