A. J. M. van Gasteren. On the Shape of Mathematical Arguments, volume 445 of Lecture Notes in Computer Science. Springer-Verlag, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....linguistics point of view, verifying textbook proofs is a text understanding task. The text genre, however, has a number of characteristics that makes this task feasible. The art of writing good mathematical texts focuses on clearness and conciseness and not on an embellished style of expression [27]. The expert language used by mathematicians is stylised, that is, characterised by the use of standard phrases and keywords [25] The use of terms and formulae introduce formal parts into mathematical discourse. In addition, textbook proofs are, in general, a highly structured form of discourse. ....

A.J.M. van Gasteren. On the shape of mathematical arguments, volume 445 of Lecture Notes in Computer Science. Springer, 1990.

....The informal meaning is that t has to occur at least eft and at most lft time units after being enabled, unless it becomes disabled by the occurrence of another transition. The resulting TM net (time multi labelled Petri net) algebra is closely related to the notion of time Petri net (cf. e.g. [3, 14, 15]) We restrict the class of nets under consideration to safe nets. A (T)M net N is called safe, if each marking m reachable in N from the standard initial marking m 0 (cf. section 3.2) is a set 1 . 3.1 Definition of TM Nets The building blocks (places, transitions, arcs) of a TM net N are ....

L. Popova: On Time Petri Nets. Journal of Information Processing and Cybernetics, Volume 1055 of Lecture Notes in Computer Science, Springer, 1991. A Appendix Syntax of SDL/R: ! systemdef ? ::= system syst ; ! signaldef ?

....Conference on Rewriting Techniques and Applications (Montreal, Canada) volume 690 of Lecture Notes in Computer Science, pages 468 487, Berlin, June 1993. Springer Verlag. 23. N. Dershowitz, J. P. Jouannaud, and J. W. Klop. Problems in rewriting III. In Proceedings of the Sixth International Conference on Rewriting Techniques and Applications (Kaiserslautern, Germany) Lecture Notes in Computer Science, Berlin, April 1995. Springer Verlag. 24. E. Domenjoud, F. Klay, and C. Ringeissen. Combination techniques for nondisjoint equational theories. In A. Bundy, editor, CADE 94, volume 814 of Lecture Notes in Artificial Intelligence, pages ....

Conference on Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, Montreal, Canada, 1993. Springer-Verlag.

....dim L(A) Definition 12 Support. The support supp of a divisor is the set P AP #= 0 . 2 The main algorithm One of the fundamental problems in the theory of curves is to determine when a divisor of degree 0 is principal, and to construct a function whose divisor is the given divisor. In [Dav79]. Davenport gives an algorithm for this problem which does not always work for curves of genus 1, and which is claimed to run in O(lg A where A is the largest multiplicity of a zero or a pole at any point. This claim seems to be unjustified. The construction below gives a straight line program ....

James H. Davenport. On the Integration of Algebraic Functions, volume 102 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1979.

....OE 1 OE 2 iff M j= OE 1 and M j= 3OE iff M j= OE for some marking M reachable from M OE iff M 0 j= Proposition 1. Let N be a P T net and OE a formula over N: Then: N j= OE iff N j= 2. 3 Time Petri Nets Time Petri nets were introduced in [18] Following the reasoning of [20, 22], we consider time Petri nets with discrete time (also cf. 6] A safe time Petri net TN net consists of a safe P T net (PTN ; TTN ; FTN ) and a transition inscription TN : T T (where T = N Theta N) by closed time intervals with nonnegative integer bounds. The subscripts are omitted if clear ....

....of Figure 1. The initial clock vector is given by I 0 (t 0 ) I 0 (t 1 ) 0 and I 0 (t 2 ) I 0 (t 3 ) For example, the firing schedule oe = tic t 0 t 1 tic tic t 3 t 0 tic t 1 ) is fireable at (M 0 ; I 0 ) The behaviour of a time Petri net TN can be described by the reachability graph [20], which in the case of P T nets faces the same problems of not reflecting the concurrent behaviour, but instead representing all interleavings of concurrent events. The logic L may be extended to time Petri nets. Let TN be a time Petri net, OE a formula, and (M; I) a marking of TN . The ....

L. Popova: On Time Petri Nets. Journal of Information Processing and Cybernetics, Volume 1055 of Lecture Notes in Computer Science, Springer (1991).

No context found.

A. J. M. van Gasteren. On the Shape of Mathematical Arguments, volume 445 of Lecture Notes in Computer Science. Springer-Verlag, 1990.

No context found.

Tenth Int'l. Conference on Computer-AidedVeri#cation #CAV#,volume 1427 of Lecture Notes in Computer Science. Springer-Verlag, 1998.

No context found.

Int'l. Conference on Advances in Cryptology #CRYPTO 95#, volume 963 of Lecture Notes in Computer Science, pages 236#247. Springer-Verlag, 1995.

No context found.

Intl. Conference on Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 22--36. Springer-Verlag, 1993. Full version in Research Report R94:01, Swedish Institute of Computer Science, Kista, Sweden.

No context found.

Workshop on Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 13-25, Bergen, Norway, 11-14 July 1990. Springer.

No context found.

Symposium on Algorithms #ESA '93#,volume 726 of Lecture Notes in Computer Science, pages 121#132. Springer-Verlag, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC