Pre- and post-agglomerations for LTL model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1825, Issue , 2000, Pages 387-408

  Poitrenaud, Denis ^a   Pradat Peyre, Jean Francois ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b CEDRIC CNAM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AGGLOMERATION; DISTRIBUTED COMPUTER SYSTEMS; PETRI NETS; TEMPORAL LOGIC;

BOUNDEDNESS; EFFICIENT ANALYSIS; LINEAR TIME TEMPORAL LOGIC; LTL MODEL-CHECKING; ORIGINAL MODEL; REDUCED MODEL; STRUCTURAL CONDITION; STRUCTURAL REDUCTION;

MODEL CHECKING;

EID: 84947221177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44988-4_22     Document Type: Conference Paper

References (6)

1. G. Berthelot. Checking properties of nets using transformations. In G. Rozenberg, editor, Advances in Petri nets, volume No. 222 of LNCS. Springer-Verlag, 1985.
2. S. Haddad. A reduction theory for colored nets. In Jensen and Rozenberg, editors, High-level Petri Nets, Theory and Application, LNCS, pages 399-425. Springer- Verlag, 1991.
3. Doron Peled and Thomas Wilke. Stutter-invariant temporal properties are expressible without the nexttime operator. Information Processing Letters, 63:243-246, 1997.
4. W. Reisig. EATCS-An Introduction to Petri Nets. Springer-Verlag, 1983.
5. A. Valmari. On-the-fly verification with stubborn sets representatives. In Proceedings of the 5th International Conference on Computer Aided Verification, Greece, volume 697 of Lecture Notes in Computer Science, pages 397-408. Springer Verlag, 1993.
6. K. Varpaaniemi and M. Rauhamaa. The stubborn set method in practice. In Advances in Petri Nets, volume 616 of Lecture Notes in Computer Science, pages 389-393. Springer Verlag, 1992.