E. Mayr. An algorithm for the general Petri net reachability problem. In Proc. 13th Annual Symposium on Theory of Computing, pages 238--246, 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Checking Linear Temporal Formulas on Sequential Recursive.. - Serge Haddad Lamsade (Correct)
No context found.
E. Mayr. An algorithm for the general Petri net reachability problem. In Proc. 13th Annual Symposium on Theory of Computing, pages 238--246, 1981.
Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, - Hong Jiang And (Correct)
No context found.
Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13 (1984) 441--460
Theoretical Aspects of Recursive Petri Nets - Serge Haddad And (Correct)
No context found.
E.W. Mayr. An algorithm for the general Petri net reachability problem. In Proc. 13th Annual Symposium on Theory of Computing, pages 238-246, 1981.
Decidability and Undecidability Results for - Recursive Petri Nets (1999) (Correct)
No context found.
E.W. Mayr. An algorithm for the general Petri net reachability problem. In Proc. 13th Annual Symposium on Theory of Computing, pages 238--246, 1981.
A Model Checking Decision Procedure for Sequential.. - Haddad, Poitrenaud (2000) (Correct)
No context found.
E.W. Mayr. An algorithm for the general Petri net reachability problem. In Proc. 13th Annual Symposium on Theory of Computing, pages 238-246, 1981.
Modelling and Analyzing Systems with Recursive Petri Nets - Haddad, al. (2000) (Correct)
No context found.
Mayr, E. (1981). An algorithm for the general Petri net reachability problem. In Proc. 13th Annual Symposium on Theory of Computing, pages 238--246.
On the Expressive Power of Extended Process Rewrite Systems - Kretinsky, al. (2004) (Correct)
No context found.
E. W. Mayr. An algorithm for the general petri net reachability problem. In Proc. of 13th Symp. on Theory of Computing, pages 238--246. ACM Press, 1981. 17
Properties of Distributed Timed-Arc Petri Nets - Nielsen, Sassone, Srba (2001) (Correct)
No context found.
E.W. Mayr. An algorithm for the general Petri net reachability problem (preliminary version). In Proc. of 13th Ann. ACM Symposium on Theory of Computing, pages 238-246. Assoc. for Computing Machinery, 1981.
Decidability and complexity of Petri net problems - an Introduction - Esparza (1998) (25 citations) (Correct)
No context found.
E. W. Mayr. An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing, 13:441--460, 1984.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) (Correct)
No context found.
E.W. Mayr. An algorithm for the general Petri net reachability problem. In Proc. 13-th ACM Symp. on Theory of Computing, Milwaukee, pages 238--246, 1981.
More Infinite Results - Burkart, Esparza (1997) (6 citations) (Correct)
No context found.
E. Mayr. An Algorithm for the General Petri Net Reachability Problem. SIAM Journal of Computing, 13:441--460, 1984.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) (Correct)
No context found.
E.W. Mayr. An algorithm for the general Petri net reachability problem. In Proc. 13-th ACM Symp. on Theory of Computing, Milwaukee, pages 238--246, 1981.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) (Correct)
No context found.
E.W. Mayr. An algorithm for the general Petri net reachability problem. In Proc. 13-th ACM Symp. on Theory of Computing, Milwaukee, pages 238--246, 1981.
Petri Nets and Regular Processes - Petr Jancar Department (1999) (Correct)
No context found.
Mayr, E. An algorithm for the general Petri net reachability problem. SIAM Journal of Computing 13, pp441--460, 1984.
Constrained Properties, Semilinear Systems, and Petri Nets - Bouajjani, Habermehl (Correct)
No context found.
E. Mayr. An Algorithm for the General Petri Net Reachability Problem. SIAM J. on Comput., 13, 1984.
When Ambients Cannot be Opened - Boneva, Talbot (2003) (1 citation) (Correct)
No context found.
E.W. Mayr. An Algorithm for the General Petri Net Reachability Problem. SIAM Journal of Computing, 13(3):441--460, 1984.
Unknown - Fhgjilknm Opgjirqtsumvilw Opxyo (2003) (Correct)
No context found.
E.W. Mayr. An algorithm for the general petri net reachability problem. SIAM Journal of Computing, 3(13):441--460, 1984.
Grammars with Regulated Rewriting - Jurgen Dassow.. (Correct)
No context found.
E.W. Mayr, An algorithm for the general Petri net reachability problem. In: Proc. 13th Symp. Theory of Computation, 1981, 238--246.
Properties of Distributed Timed-Arc Petri Nets - Nielsen, Sassone, Srba (2001) (Correct)
No context found.
E.W. Mayr. An algorithm for the general Petri net reachability problem (preliminary version). In Proc. of 13th Ann. ACM Symposium on Theory of Computing, pages 238-246. Assoc. for Computing Machinery, 1981.
Karp-Miller Trees for a Branching Extension of VASS - Verma, Goubault-Larrecq (2004) (Correct)
No context found.
E. W. Mayr. An algorithm for the general Petri net reachability problem. SIAM Journal of Computing, 13:441--460, 1984.
On Flatness for 2-dimensional Vector Addition Systems with States - Leroux, Sutre (2004) (Correct)
No context found.
E. W. Mayr. An algorithm for the general Petri net reachability problem. SIAM J. Comput., 13(3):441460, 1984.
Reachability in Petri Nets with Inhibitor arcs - Reinhardt (2004) (3 citations) (Correct)
No context found.
E. Mayr. An algorithm for the general Petri net reachability problem. Siam J. Comput., 13:441--459, 1984.
Petri Nets with Non-blocking Arcs are Difficult to Analyze - Raskin, Van Begin (2003) (Correct)
No context found.
E.W. Mayr. An algorithm for the general petri net reachability problem. SIAM Journal of Computing, 3(13):441--460, 1984.
Towards a Notion of Distributed Time for Petri Nets.. - Nielsen, Sassone, Srba (Correct)
No context found.
E.W. Mayr. An algorithm for the general Petri net reachability problem (preliminary version). In Proc. 13th Ann. ACM Symposium on Theory of Computing, pages 238246. Assoc. for Computing Machinery, 1981.
An Application of a Temporal Linear Logic to Timed Petri Nets - Hirai (1999) (Correct)
No context found.
E. W. Mayr. An algorithm for the general Petri net reachability problem. In Proc. of the 13th Annual ACM Symp. on Theory of Computing, pages 238--246, 1981. Second Edition: SIAM J. Comput. Vol. 13, No. 3, Pages: 441-460, August 1984.
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