Sciweavers

Share
RP
2009
Springer
136views Control Systems» more  RP 2009»
9 years 8 months ago
Abstract Counterexamples for Non-disjunctive Abstractions
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 (...
Kenneth L. McMillan, Lenore D. Zuck
RP
2009
Springer
102views Control Systems» more  RP 2009»
9 years 10 months ago
Counting Multiplicity over Infinite Alphabets
Amaldev Manuel, Ramaswamy Ramanujam
RP
2009
Springer
124views Control Systems» more  RP 2009»
9 years 10 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
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...
Denis Lugiez
RP
2009
Springer
106views Control Systems» more  RP 2009»
9 years 10 months ago
How to Tackle Integer Weighted Automata Positivity
Yohan Boichut, Pierre-Cyrille Héam, Olga Ko...
RP
2009
Springer
136views Control Systems» more  RP 2009»
9 years 10 months ago
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
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...
Roberto Barbuti, Francesca Levi, Paolo Milazzo, Gu...
RP
2009
Springer
103views Control Systems» more  RP 2009»
9 years 10 months ago
On Yen's Path Logic for Petri Nets
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...
Mohamed Faouzi Atig, Peter Habermehl
RP
2009
Springer
121views Control Systems» more  RP 2009»
9 years 10 months ago
Games with Opacity Condition
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...
Bastien Maubert, Sophie Pinchinat
RP
2009
Springer
110views Control Systems» more  RP 2009»
9 years 10 months ago
Formalisms for Specifying Markovian Population Models
Abstract. We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages —matrix descriptions, s...
Thomas A. Henzinger, Barbara Jobstmann, Verena Wol...
books