✦ LIBER ✦

Two proof methods for the GRAFCET language

✍ Scribed by P Le Parc; B Queguineur; L Marcé

Publisher: Elsevier Science
Year: 1994
Weight: 473 KB
Volume: 18
Category: Article
ISSN: 0066-4138
DOI: 10.1016/0066-4138(94)90012-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A complete modal proof system for HAL: t

A complete modal proof system for HAL: the Herbrand agent language

✍ Zineb Habbas 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 915 KB

On the Proof Method for Constructive Fal

On the Proof Method for Constructive Falsity

✍ Seiki Akama 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB 👁 1 views

Compiling and optimizing methods for the

Compiling and optimizing methods for the functional language ASL/F

✍ Katsuro Inoue; Hiroyuki Seki; Kenichi Taniguchi; Tadao Kasami 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 1011 KB

A Note on the Proof Method for Construct

A Note on the Proof Method for Constructive Falsity

✍ Kazuyuki Tanka 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 1 views

A local convergence proof for the iterat

A local convergence proof for the iterative aggregation method

✍ Jan Mandel; Bohuslav Sekerka 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Rigorous error bounds for RK methods in

Rigorous error bounds for RK methods in the proof of chaotic behaviour

✍ Arno Berger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Complicated dynamical systems can be rigorously analysed by means of Conley index theory. Due to its partly numerical nature such an analysis necessitates bounds on the truncation and the round-o error. These are provided for explicit RK methods in the form of iteration schemes ready-made for applic