Alain Finkel, S. Purushothaman Iyer, Grgoire Sutre. Well-abstracted transition systems: application to FIFO automata. Inf. Comput. 181(1), 2003, 1-31 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Note on SLRE - Habermehl, Mayr (Correct)
....misconceptions about SLRE and bounded languages and correct some errors in various sources. Definition 1. A SLRE is a regular language that can be written as a finite union of expressions of the form w 1 w 0 1 w 2 w 0 2 : w 0 n Gamma1 w n where the w i ; w 0 i are words [FIS00]. Definition 2. A language is bounded iff it is a subset of a language of the form w 1 w 2 : w m , where w 1 ; wm are words [Gin66, HRS76] Note that bounded languages need not be equivalent to a language of the form w 1 w 2 : w m . Bounded languages need not ....
....language is bounded iff it is a subset of a language of the form w 1 w 2 : w m , where w 1 ; wm are words [Gin66, HRS76] Note that bounded languages need not be equivalent to a language of the form w 1 w 2 : w m . Bounded languages need not even be regular. In [FIS00, Sut00] the definition of bounded is wrong, while the real bounded languages are called plat (or flat ) in [FIS00, Sut00] Note also that all SLRE are bounded, since w 1 v 1 w 2 v 2 : vn Gamma1 w n w 1 v 1 w 2 v 2 : v n Gamma1 w n and the class of bounded ....
[Article contains additional citation context not shown here]
A. Finkel, S. Purushothaman Iyer, and G. Sutre. Well-abstracted transition systems: Application to fifo automata. In Proc. 11th Int. Conf. Concurrency Theory (CONCUR '2000), pages 566--580. Springer Verlag, 2000.
On Flatness for 2-dimensional Vector Addition Systems with States - Leroux, Sutre (2004) Self-citation (Sutre) (Correct)
No context found.
A. Finkel, S. P. Iyer, and G. Sutre. Well-abstracted transition systems: Application to FIFO automata. Information and Computation, 181(1):1 31, 2003.
From Post Systems to the Reachability Problems for Matrix.. - Potapov (2004) (Correct)
No context found.
Alain Finkel, S. Purushothaman Iyer, Grgoire Sutre. Well-abstracted transition systems: application to FIFO automata. Inf. Comput. 181(1), 2003, 1-31
Learning to Verify Safety Properties - Vardhan, Sen, Viswanathan, Agha (2004) (1 citation) (Correct)
No context found.
A. Finkel, S. Purushothaman Iyer, and G. Sutre. Well-abstracted transition systems: Application to FIFO automata. Information and Computation, 181(1):1--31, 2003.
Actively learning to verify safety for FIFO automata - Vardhan, Sen, Viswanathan.. (2004) (Correct)
No context found.
A. Finkel, S. Purushothaman Iyer, and G. Sutre. Well-abstracted transition systems: Application to FIFO automata. Information and Computation, 181(1):1--31, 2003.
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