Sciweavers

211 search results - page 14 / 43
» Verification of Workflow Nets
Sort
View
FUIN
2010
172views more  FUIN 2010»
14 years 6 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...
76
Voted
SKG
2006
IEEE
15 years 3 months ago
Dynamic Setting, Verification and Adjustment of Upper Bound Constraints in Grid Workflow Systems
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
Jinjun Chen, Yun Yang
92
Voted
ENTCS
2006
131views more  ENTCS 2006»
14 years 9 months ago
The Case for Analog Circuit Verification
The traditional approach to validate analog circuits is to utilize extensive SPICElevel simulations. The main challenge of this approach is knowing when all important corner cases...
Chris J. Myers, Reid R. Harrison, David Walter, Ni...
TOPNOC
2008
14 years 9 months ago
McMillan's Complete Prefix for Contextual Nets
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
Paolo Baldan, Andrea Corradini, Barbara König...