85 search results - page 4 / 17 » An SMT Approach to Bounded Reachability Analysis of Model Pr... |
FSTTCS
2003
Springer
14 years 25 days ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
ASP
2001
Springer
14 years 3 days ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
FM
2001
Springer
14 years 3 days ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
ACSD
2006
IEEE
14 years 1 months ago
2006
IEEE
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...