Searching for authors named "Peter Kemper" – sorted by Relevance.
-
O(|P||T|)-Algorithm to Compute a Cover of S-components in EFC-nets
- 15 O(jP jjT j)-Algorithm to Compute a Cover of S-components in EFC-nets Peter Kemper Informatik
- Add To MetaCart
-
Linear Time Algorithm to Find a Minimal Deadlock in a Strongly Connected Free-Choice Net
- Peter Kemper Informatik IV, Universitat Dortmund Postfach 50 05 00, 4600 Dortmund 50, Germany Abstract
- Cited by 1 (0 self) – Add To MetaCart
-
2005b. Visualizing the dynamic behavior of ProC/B models
- Visualizing the Dynamic Behavior of ProC/B Models Peter Kemper and Carsten Tepper ∗ Universität
- Cited by 2 (1 self) – Add To MetaCart
-
An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets
- An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets Peter
- Cited by 13 (8 self) – Add To MetaCart
-
Hierarchical reachability graph generation for Petri nets
- Nets Peter Buchholz, Peter Kemper Forschungsbericht Nr. 660/1997 Hierarchical Reachability Graph
- Cited by 3 (2 self) – Add To MetaCart
-
Quantifying the dynamic behavior of process algebras. In
- Quantifying the Dynamic Behavior of Process Algebras Peter Buchholz 1⋆ and Peter Kemper 2⋆⋆ 1
- Cited by 2 (1 self) – Add To MetaCart
-
Numerical Analysis of Superposed GSPNs
- Numerical Analysis of Superposed GSPNs Peter Kemper Informatik IV Universitat Dortmund D-44221
- Cited by 55 (9 self) – Add To MetaCart
-
Model checking based on Kronecker algebra
- Model Checking Based on Kronecker Algebra Peter Kemper, Ralf Lubeck Informatik IV Universitat
- Cited by 4 (3 self) – Add To MetaCart
-
Linear Time Algorithm to Find a Minimal Deadlock in a Strongly Connected Free-Choice Net
- Peter Kemper Informatik IV, Universitat Dortmund Postfach 50 05 00, 4600 Dortmund 50, Germany Abstract
- Add To MetaCart
-
j)-Algorithm to Compute a Cover of S-components in EFC-nets
- 15 1 O(jP jjT j)-Algorithm to Compute a Cover of S-components in EFC-nets Peter Kemper
- Add To MetaCart

