Sciweavers

662 search results - page 116 / 133
» Model Checking Procedures for Infinite State Systems
Sort
View
SIGSOFT
2005
ACM
15 years 10 months ago
Permissive interfaces
A modular program analysis considers components independently and provides succinct summaries for each component, which can be used when checking the rest of the system. Consider ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
14 years 10 months ago
Reachability analysis for a class of Petri nets
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
Yu Ru, Christoforos N. Hadjicostis
83
Voted
RE
2006
Springer
14 years 9 months ago
Goal and scenario validation: a fluent combination
Scenarios and goals are effective techniques for requirements definition. Goals are objectives that a system has to meet. They are elaborated into a structure that decomposes decla...
Sebastián Uchitel, Robert Chatley, Jeff Kra...
110
Voted
POPL
2011
ACM
14 years 8 days ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
15 years 3 months ago
On visibility maintenance via controlled invariance for leader-follower Dubins-like vehicles
— The paper studies the visibility maintenance problem (VMP) for a leader-follower pair of robots modelled as first-order dynamic systems and proposes an original solution based...
Fabio Morbidi, Francesco Bullo, Domenico Prattichi...