A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
On Computing Fixpoints in Well-Structured Regular Model.. - Baier Bertrand And Self-citation (Schnoebelen) (Correct)
No context found.
A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1--2):63--92, 2001.
Symbolic Verification of Communicating Systems With.. - Baier Bertrand And Self-citation (Schnoebelen) (Correct)
No context found.
A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1--2):63--92, 2001.
On the Verification of Broadcast Protocols - Esparza, Finkel, Mayr (1999) (9 citations) Self-citation (Finkel) (Correct)
No context found.
Finkel, A., Schnoebelen, P. Well-structured Transition Systems Everywhere! Research Report LSV-98-4, Lab. Specification and Verification, ENS de Cachan, France, 1998. To appear in TCS.
Monotonic Extensions of Petri Nets: Forward and Backward Search.. - Raskin (2002) Self-citation (Finkel) (Correct)
No context found.
A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
Polynomial Time Image Computation with Interval-definable.. - Finkel, Leroux (2004) Self-citation (Finkel) (Correct)
No context found.
Alain Finkel and Phillipe Schnoebelen. Well structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
Image Computation in Infinite State Model Checking - Finkel, al. (2004) Self-citation (Finkel) (Correct)
No context found.
Alain Finkel and Phillipe Schnoebelen. Well structured transition systems everywhere! Theoretical Computer Science, 256(1--2):63--92, 2001.
Polynomial Time Image Computation with Interval-definable.. - Finkel, Leroux (2004) Self-citation (Finkel) (Correct)
No context found.
Alain Finkel and Phillipe Schnoebelen. Well structured transition systems everywhere! ########### ######## #######, 256(1-2):63-92, 2001.
A General Approach to Comparing Infinite-State Systems with .. - Kucera, Schnoebelen (2004) Self-citation (Schnoebelen) (Correct)
No context found.
A. Finkel and Ph. Schnoebelen. Well structured transition systems everywhere! Theoretical Computer Science, 256(1--2):63--92, 2001.
The Verification of Probabilistic Lossy Channel Systems - Schnoebelen (2004) (2 citations) Self-citation (Schnoebelen) (Correct)
No context found.
A. Finkel and Ph. Schnoebelen. Well structured transition systems everywhere! Theoretical Computer Science, 256(1--2):63--92, 2001.
Accepted for presentation to Journees Montoises d'Informatique - Th Eoriques Expand (Correct)
No context found.
A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
Expand, Enlarge, and Check - New Algorithms For (Correct)
No context found.
A. Finkel, P. Schnoebelen, Well-structured transition systems everywhere!, Theoretical Computer Science 256 (1-2) (2001) 63--92.
Expand, Enlarge and Check. . . Made Ecient - Gilles Geeraerts Jean-Francois (Correct)
No context found.
A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63--92, 2001.
Learning to Verify Safety Properties - Vardhan, Sen, Viswanathan, Agha (2004) (1 citation) (Correct)
No context found.
A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1--2):63--92, 2001.
Actively learning to verify safety for FIFO automata - Vardhan, Sen, Viswanathan.. (2004) (Correct)
No context found.
A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1--2):63--92, 2001.
Test Vector Generation for UML Models with Abstractions - Votintseva (2002) (Correct)
No context found.
A. Finkel, Ph. Schnoebelen, Well Structured Transition Systems Everywhere! Theoretical Computer Science 256, 2001, p.63-92.
Unknown - Fhgjilknm Opgjirqtsumvilw Opxyo (2003) (Correct)
No context found.
A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63--92, 2001. 16
Petri Games are Monotone but Difficult to Decide - Raskin, al. (2003) (Correct)
No context found.
A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1--2):63--92, 2001.
Model Checking Data-Independent Systems With Arrays - Newcomb (2003) (3 citations) (Correct)
No context found.
A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
Covering Sharing Trees: A Compact Data Structure for.. - Delzanno, Raskin, Van.. (Correct)
No context found.
A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science 256 (1-2):63-92. Elsevier, 2001.
Petri Games are Monotonic but Difficult to Decide - Raskin, Samuelides, Van Begin (2003) (1 citation) (Correct)
No context found.
A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1--2):63--92, 2001.
On the Language Inclusion Problem for Timed Automata.. - Ouaknine, Worrell (Correct)
No context found.
A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1--2):63--92, 2001.
On the Language Inclusion Problem for Timed Automata.. - Ouaknine, Worrell (2003) (Correct)
No context found.
A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
Petri Nets with Non-blocking Arcs are Difficult to Analyze - Raskin, Van Begin (2003) (Correct)
No context found.
A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63--92, 2001. 16
The Affine Hull of a Binary Automaton is Computable in Polynomial .. - Leroux (2003) (Correct)
No context found.
Finkel, A. and P. Schnoebelen, Well structured transition systems everywhere!, Theoretical Computer Science 256 (2001), pp. 63--92.
On the Computational Strength of Pure Ambient Calculi - Maffeis, Phillips (2003) (Correct)
No context found.
A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256:63--92, 2001.
First 50 documents Next 50
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