Sciweavers

941 search results - page 84 / 189
» Haskell-Coloured Petri Nets
Sort
View
WOSP
2004
ACM
15 years 3 months ago
Software performance modelling using PEPA nets
Modelling and analysing distributed and mobile software systems is a challenging task. PEPA nets—coloured stochastic Petri nets—are a recently introduced modelling formalism w...
Stephen Gilmore, Jane Hillston, Leïla Kloul, ...
PERCOM
2006
ACM
15 years 9 months ago
Deterministic and Probabilistic Implementation of Context
This paper addresses the problem of implementing an context model. First, the abstract context model is represented by a network of situations. Two different implementations for t...
Oliver Brdiczka, Dominique Vaufreydaz, Jér&...
ACSD
2009
IEEE
117views Hardware» more  ACSD 2009»
15 years 4 months ago
Petrifying Operating Guidelines for Services
Abstract. Operating guidelines characterize correct interaction (e.g. deadlock freedom) with a service. They can be stored in a service registry. So far, they have been represented...
Niels Lohmann, Karsten Wolf
DAC
1996
ACM
15 years 2 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin
ATAL
2008
Springer
14 years 12 months ago
Automatic Generation of Distributed Team Formation Algorithms from Organizational Models
Software systems are subject to ever increasing complexity and in need of efficient structuring. The concept of organization as an exand abstract real-world reference presents a pr...
Michael Köhler-Bußmeier, Matthias Weste...