RP
2009
Springer
13 years 9 months ago
2009
Springer
Counterexamples for Non-disjunctive ions K. L. McMillan1 and L. D. Zuck2 1 Cadence Research Labs 2 University of Illinois at Chicago Counterexample-guided abstraction refinement (...
RP
2009
Springer
13 years 11 months ago
2009
Springer
RP
2009
Springer
13 years 11 months ago
2009
Springer
RP
2009
Springer
13 years 11 months ago
2009
Springer
RP
2009
Springer
13 years 11 months ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
RP
2009
Springer
13 years 11 months ago
2009
Springer
RP
2009
Springer
13 years 11 months ago
2009
Springer
We present an abstraction of the probabilistic semantics of Multiset Rewriting to formally express systems of reactions with uncertain kinetic rates. This allows biological systems...
RP
2009
Springer
13 years 11 months ago
2009
Springer
In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfi...
RP
2009
Springer
13 years 11 months ago
2009
Springer
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachab...
RP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages —matrix descriptions, s...