Sciweavers

111 search results - page 16 / 23
» DNA Algorithms for Petri Net Modeling
Sort
View
FMSD
2006
85views more  FMSD 2006»
13 years 7 months ago
Distributed disk-based algorithms for model checking very large Markov chains
In this paper we present data structures and distributed algorithms for CSL model checking-based performance and dependability evaluation. We show that all the necessary computatio...
Alexander Bell, Boudewijn R. Haverkort
BPM
2008
Springer
112views Business» more  BPM 2008»
13 years 9 months ago
Covering Places and Transitions in Open Nets
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
Christian Stahl, Karsten Wolf
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 1 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
APCCM
2009
13 years 8 months ago
Synthesis of Orchestrators from Service Choreographies
Interaction topologies in service-oriented systems are usually classified into two styles: choreographies and orchestrations. In a choreography, services interact in a peer-to-pee...
Stephen McIlvenna, Marlon Dumas, Moe Thandar Wynn
EMISA
2002
Springer
13 years 7 months ago
A new reduction method for the analysis of large workflow models
Abstract: This paper presents a new net-reduction methodology to facilitate the analysis of large workflow models. We propose an enhanced algorithm based on reducible subnet identi...
Loucif Zerguini, Kees M. van Hee