Results 1  10
of
182
Nonreachability in Petri Nets with Delaying Places
"... The correctness of systems is frequently proved by demonstrating the nonreachability of certain (incorrect) states with the help of formal frameworks, e.g., Petri nets. Especially for realtime systems, the timely behavior has to be considered. Thus, there exist several extensions that allow the ..."
Abstract
 Add to MetaCart
The correctness of systems is frequently proved by demonstrating the nonreachability of certain (incorrect) states with the help of formal frameworks, e.g., Petri nets. Especially for realtime systems, the timely behavior has to be considered. Thus, there exist several extensions that allow
IOS Press A Method to Prove NonReachability in Priority Duration Petri Nets ∗
"... Abstract. Times and priorities are important concepts that are frequently used to model realworld systems. Thus, there exist extensions for Petri nets which allow to model times and priorities. In contrast, many proof techniques are based on classical (timeless and priorityless) Petri nets. Howev ..."
Abstract
 Add to MetaCart
. However, this approach fails frequently for timed and prioritized Petri nets. In this paper, we present an approach to prove nonreachability in a Priority Duration Petri net. We use for this proving technique a state equation as well as conditions for firing that include a priority rule and a maximal
Goaldirected Invariant Synthesis for Model Checking Modulo Theories
, 2009
"... Abstract. We are interested in automatically proving safety properties of infinite state systems. We present a technique for invariant synthesis which can be incorporated in backward reachability analysis. The main theoretical result ensures that (under suitable hypotheses) our method is guaranteed ..."
Abstract

Cited by 9 (9 self)
 Add to MetaCart
Abstract. We are interested in automatically proving safety properties of infinite state systems. We present a technique for invariant synthesis which can be incorporated in backward reachability analysis. The main theoretical result ensures that (under suitable hypotheses) our method
An overview of the Riemannian metrics on spaces of curves using the Hamiltonian approach
 Applied and Computational Harmonic Analysis, 2007. doi: 10.1016/j.acha.2006.07.004. URL http://www.mat.univie.ac.at/~michor/curveshamiltonian.pdf
"... Abstract. Here shape space is either the manifold of simple closed smooth unparameterized curves in R 2 or is the orbifold of immersions from S 1 to R 2 modulo the group of diffeomorphisms of S 1. We investige several Riemannian metrics on shape space: L 2metrics weighted by expressions in length a ..."
Abstract

Cited by 74 (25 self)
 Add to MetaCart
Abstract. Here shape space is either the manifold of simple closed smooth unparameterized curves in R 2 or is the orbifold of immersions from S 1 to R 2 modulo the group of diffeomorphisms of S 1. We investige several Riemannian metrics on shape space: L 2metrics weighted by expressions in length
Humboldt
"... Abstract. Nonreachability proofs in Timed Petrinets were usually done by proving the nonreachability within the underlying timeless net. However, in many cases this approach fails. In this paper, we present an approach to prove nonreachability within the actual Timed Petrinet. For this purpose, we ..."
Abstract
 Add to MetaCart
Abstract. Nonreachability proofs in Timed Petrinets were usually done by proving the nonreachability within the underlying timeless net. However, in many cases this approach fails. In this paper, we present an approach to prove nonreachability within the actual Timed Petrinet. For this purpose
A State Equation for Timed Petrinets
, 2002
"... Nonreachability proofs in Timed Petrinets were usually done by proving the nonreachability within the timeless skeleton. However, in many cases this approach fails. In this paper, we present an approach to prove nonreachability within the actual Timed Petrinet. For this purpose, we introduce a stat ..."
Abstract
 Add to MetaCart
Nonreachability proofs in Timed Petrinets were usually done by proving the nonreachability within the timeless skeleton. However, in many cases this approach fails. In this paper, we present an approach to prove nonreachability within the actual Timed Petrinet. For this purpose, we introduce a
Vector addition systems reachability problem (a simpler solution)
 TURING100
"... The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known to be decidable by algorithms based on the classical KosarajuLambertMayrSacerdoteTenney decomposition (KLMST decomposition). Recently from this decomposition, we deduced t ..."
Abstract

Cited by 33 (7 self)
 Add to MetaCart
that there exist checkable certificates of nonreachability in the Presburger arithmetic. In particular, there exists a simple algorithm for deciding the general VAS reachability problem based on two semialgorithms. A first one that tries to prove the reachability by enumerating finite sequences of actions and a
Special values of anticyclotomic Lfunctions
 Duke Math. J
, 1985
"... The purpose of the paper is to extend and refine earlier results of the author on nonvanishing of the Lfunctions associated to modular forms in the anticyclotomic tower of conductor p ∞ over an imaginary quadratic field. While the author’s previous work proved that such Lfunctions are generically ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
, the algebraic part of the central critical value is nonzero modulo ℓ for certain ℓ. Applications are given to the muinvariant of the padic Lfunctions of M. Bertolini and H. Darmon. The main ingredients in the proof are a theorem of M. Ratner, as in the author’s previous work, and a new “Jochnowitz congruence
A RewritingBased Inference System for the NRL Protocol Analyzer and its MetaLogical Properties
, 2005
"... The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex reallife protocols. One of the most interesting of its features is that it can be used to reason about security in face of attem ..."
Abstract

Cited by 41 (20 self)
 Add to MetaCart
: its grammarbased techniques for invariant generation and its backwards reachability analysis method. This formal specification is given within the wellknown rewriting framework so that the inference system is specified as a set of rewrite rules modulo an equational theory describing the behavior
Torsion algebraic cycles and complex cobordism
 J. Amer. Math. Soc
, 1997
"... Atiyah and Hirzebruch gave the first counterexamples to the Hodge conjecture with integer coefficients. In particular, there is a smooth complex projective variety X of dimension 7 and a torsion element of H4 (X,Z) which is not the class of a codimension2 algebraic cycle [4]. In this paper, we prov ..."
Abstract

Cited by 40 (0 self)
 Add to MetaCart
provide a more systematic explanation for their examples: for every smooth complex algebraic variety X, we show that the cycle map, from the ring of cycles modulo algebraic equivalence on X to the integer cohomology of X, lifts canonically to a more refined topological invariant of X, the ring MU ∗X ⊗MU
Results 1  10
of
182