Sciweavers

305 search results - page 52 / 61
» Petri Net Analysis Using Decision Diagrams
Sort
View
VLSID
1999
IEEE
100views VLSI» more  VLSID 1999»
15 years 1 months ago
Satisfiability-Based Detailed FPGA Routing
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...
Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar
DSN
2005
IEEE
15 years 3 months ago
A Wavefront Parallelisation of CTMC Solution Using MTBDDs
In this paper, we present a parallel implementation for the steady-state analysis of continuous-time Markov chains (CTMCs). This analysis is performed via solution of a linear equ...
Yi Zhang, David Parker, Marta Z. Kwiatkowska
CAISE
2001
Springer
15 years 1 months ago
Relaxed Soundness of Business Processes
Business processes play a central role in the reorganization of a company and the (re)design of the respective information system(s). Typically the processes are described with the...
Juliane Dehnert, Peter Rittgen
SIGMETRICS
2002
ACM
107views Hardware» more  SIGMETRICS 2002»
14 years 9 months ago
Passage time distributions in large Markov chains
Probability distributions of response times are important in the design and analysis of transaction processing systems and computercommunication systems. We present a general tech...
Peter G. Harrison, William J. Knottenbelt
ISSTA
1998
ACM
15 years 1 months ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...