✦ LIBER ✦

Partial-order reduction for general state exploring algorithms

✍ Scribed by Dragan Bošnački; Stefan Leue; Alberto Lluch Lafuente

Book ID: 106245500
Publisher: Springer
Year: 2008
Tongue: English
Weight: 418 KB
Volume: 11
Category: Article
ISSN: 1433-2779
DOI: 10.1007/s10009-008-0093-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partial-Order Reduction in Symbolic Stat

Partial-Order Reduction in Symbolic State-Space Exploration

✍ R. Alur; R.K. Brayton; T.A. Henzinger; S. Qadeer; S.K. Rajamani 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 164 KB

State space reduction using partial orde

State space reduction using partial order techniques

✍ E.M. Clarke; O. Grumberg; M. Minea; D. Peled 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 182 KB

Partial order reductions for failures re

Partial order reductions for failures refinement

✍ Heike Wehrheim 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 829 KB

Partial Order Reduction for Probabilisti

Partial Order Reduction for Probabilistic Branching Time

✍ Christel Baier; Pedro D'Argenio; Marcus Groesser 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 432 KB

The greedy algorithm for partially order

The greedy algorithm for partially ordered sets

✍ Ulrich Faigle 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 756 KB

Those independence systems on finite partially ordered sets are characterized for which the greedy algorithm always works. 'Fhe greedy ulgsrithm far gtartIally ordered fete

Partial order reduction for state/event

Partial order reduction for state/event LTL with application to component-interaction automata

✍ N. Beneš; L. Brim; B. Buhnova; I. Černá; J. Sochor; P. Vařeková 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 546 KB

Software systems assembled from a large number of autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL (Chaki et al. (2004(Chaki et al. ( , 2005) ) [1,2]) incorporates both states and events to expr