Best, Eike, 1951-....
Best, Eike
Eike Best
VIAF ID: 19761078 (Personal)
Permalink: http://viaf.org/viaf/19761078
Preferred Forms
- 200 _ | ‡a Best ‡b Eike ‡f 1951-....
-
- 100 1 _ ‡a Best, Eike
-
- 100 1 _ ‡a Best, Eike
-
-
- 100 1 _ ‡a Best, Eike ‡d 1951-
- 100 1 _ ‡a Best, Eike ‡d 1951-
- 100 1 _ ‡a Best, Eike ‡d 1951-
-
-
-
-
- 100 1 _ ‡a Best, Eike, ‡d 1951-
- 100 1 _ ‡a Best, Eike, ‡d 1951-....
- 100 0 _ ‡a Eike Best
4xx's: Alternate Name Forms (2)
5xx's: Related Names (4)
- 510 2 _ ‡a Carl von Ossietzky Universität Oldenburg ‡e Affiliation
- 551 _ _ ‡a Neustadt an der Weinstraße
- 510 2 _ ‡a Universität Hildesheim. Institut für Informatik
- 510 2 _ ‡a Universität Oldenburg
Works
Title | Sources |
---|---|
Adequacy of path programs | |
Applications and theory of Petri nets 2003 : 24th international conference, ICATPN 2003, Eindhoven, the Netherlands, June 23-27, 2003 : proceedings | |
B(PN)2 - a Basic Petri net programming notation | |
The box calculus a new causal algebra with multi label communication | |
Characterisation of the state spaces of marked graph Petri nets | |
Characterising Petri net solvable binary words | |
[Characterization] of home states in free choice systems | |
Coloured nets with curry | |
Comparing logical and behavioural equivalences for event structures | |
Compositional process semantics of Petri boxes | |
CONCUR'93 : 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993 : proceedings | |
Concurrent behaviour: sequences, processes and programming languages | |
Concurrent systems and processes final report on the foundational part of the project BEGRUND | |
Consistent relational and predicate transformer semantics of a sequential deterministic language supporting exception handling | |
D-continuity: a study in relating system properties to process properties | |
D-continuity in partially ordered sets | |
Développer des agents mobiles via une approche formelle. | |
FEDS-Benutzerhandbuch | |
Formal theory of the basic COSY notation | |
General refinement and recursion for the box calculus | |
A High level Petri net semantics of B(PN)2 | |
A memory module specification using composable high level Petri nets | |
Minimal deadlocks in free choice nets | |
Model checking of persistent petri nets | |
Nonsequential processes : a Petri net view | |
Notations and terminology on Petri Net theory | |
Operational semantics for the Petri box calculus | |
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 | |
Partial order semantics of priority systems | |
Partial order verification with PEP | |
PEP programming environment based on Petri nets ; workshop, October 11 - 12, 1994, Humboldt-Universität zu Berlin ; proceedings | |
Persistent systems with unique minimal cyclic parikh vectors | |
Petri net algebra | |
Petri net primer, 2024: | |
Petri nets + process expressions | |
power of prime cycles and distance paths | |
Recursion and Petri nets | |
Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets | |
refined view of the box algebra | |
Relational semantics revisited | |
Selected papers of the 3rd Workshop on Concurrency and Compositionality, Goslar, Germany, March 5-8, 1991 | |
Semantics of sequential and parallel programs / Eike Best. - London, 1996. | |
Semantik. | |
Semantik : Theorie sequentieller und paralleler Programmierung | |
Some evidence on the consistency of categorical semantics for timed interleaving behaviors | |
"What good are partial orders?" proceedings of a workshop, Sheffield, June (1992) |