9 search results - page 1 / 2 » Trellis Processes : A Compact Representation for Runs of Con... |
DEDS
2007
13 years 4 months ago
2007
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
QEST
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
PPDP
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Despite extensive theoretical work on process-calculi, virtual machine specifications and implementations of actual computational models are still scarce. This paper pre...
TACAS
2000
Springer
13 years 8 months ago
2000
Springer
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
CASES
2007
ACM
13 years 8 months ago
2007
ACM
The memory intensive nature of object-oriented languages such as C++ and Java has created the need of a high-performance dynamic memory management (DMM); however, it is a challeng...