524 search results - page 78 / 105 » Temporal reachability graphs |
173
click to vote
PLDI
2009
ACM
16 years 29 days ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
177
click to vote
APN
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
162
click to vote
IANDC
2008
15 years 6 months ago
2008
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
146
click to vote
LMCS
2007
15 years 6 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
222
click to vote
TSE
2011
15 years 1 months ago
2011
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...