Sciweavers

941 search results - page 98 / 189
» Haskell-Coloured Petri Nets
Sort
View
CONCUR
2001
Springer
15 years 2 months ago
Bounded Reachability Checking with Process Semantics
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
Keijo Heljanko
APN
1999
Springer
15 years 2 months ago
Detection of Illegal Behaviors Based on Unfoldings
We show how the branching process approach can be used for the detection of illegal behaviors. Our study is based on the specification of properties in terms of testers that cover...
Jean-Michel Couvreur, Denis Poitrenaud
EMISA
2002
Springer
14 years 9 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
BPSC
2010
139views Business» more  BPSC 2010»
14 years 8 months ago
Static Information Flow Analysis of Workflow Models
: This paper proposes a framework for the detection of information leaks in workflow descriptions based on static information flow analysis. Despite the correct deployment of acces...
Rafael Accorsi, Claus Wonnemann
DCFS
2011
66views more  DCFS 2011»
13 years 9 months ago
Kleene Theorems for Product Systems
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...
Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade