23 search results - page 3 / 5 » Bounded Reachability Checking with Process Semantics |
QEST
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— This paper reports on our efforts to link an industrial state-of-the-art modelling tool to academic state-of-the-art analysis algorithms. In a nutshell, we enable timed...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
BPM
2008
Springer
13 years 7 months ago
2008
Springer
A given business process may face a large number of regulatory obligations the process may or comply with. Providing tools and techniques through which an evaluation of the complia...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
IJFCS
2006
13 years 5 months ago
2006
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...