Sciweavers

305 search results - page 39 / 61
» Petri Net Analysis Using Decision Diagrams
Sort
View
HCW
1999
IEEE
15 years 1 months ago
Simulation of Task Graph Systems in Heterogeneous Computing Environments
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
Noé Lopez-Benitez, Ja-Young Hyon
SOFSEM
2010
Springer
14 years 7 months ago
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
Parosh Aziz Abdulla
DAC
1996
ACM
15 years 1 months ago
Bit-Level Analysis of an SRT Divider Circuit
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...
Randal E. Bryant
APN
2000
Springer
15 years 1 months ago
Pre- and Post-agglomerations for LTL Model Checking
One of the most efficient analysis technique is to reduce an original model into a simpler one such that the reduced model has the same properties than the original one. G. Berthel...
Denis Poitrenaud, Jean-François Pradat-Peyr...
94
Voted
APN
2009
Springer
15 years 19 days ago
The Access/CPN Framework: A Tool for Interacting with the CPN Tools Simulator
Abstract. Coloured Petri nets (CP-nets or CPNs) is a widely used formalism for describing concurrent systems. CPN Tools provides a mature environment for constructing, simulating, ...
Michael Westergaard, Lars Michael Kristensen