Accelerations for the Coverability Set of Petri Nets with Names
暂无分享,去创建一个
[1] Jean Goubault-Larrecq,et al. Forward Analysis for WSTS, Part II: Complete WSTS , 2009, ICALP.
[2] Fernando Rosa-Velardo,et al. Forward Analysis for Petri Nets with Name Creation , 2010, Petri Nets.
[3] David de Frutos Escrig,et al. Name creation vs. replication in Petri net systems , 2007 .
[4] E. C. Milner. Basic WQO- and BQO-Theory , 1985 .
[5] Fernando Rosa-Velardo,et al. On the Expressiveness of Mobile Synchronizing Petri Nets , 2007, SecCO@CONCUR.
[6] Fernando Rosa-Velardo,et al. Decision Problems for Petri Nets with Names , 2010, ArXiv.
[7] Philippe Schnoebelen,et al. Fundamental Structures in Well-Structured Infinite Transition Systems , 1998, LATIN.
[8] Mogens Nielsen,et al. Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.
[9] Jean Goubault-Larrecq,et al. On Noetherian Spaces , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).
[10] Joël Ouaknine,et al. Nets with Tokens which Carry Data , 2008, Fundam. Informaticae.
[11] Petr Jancar. A Note on Well Quasi-Orderings for Powersets , 1999, Inf. Process. Lett..
[12] Jean Goubault-Larrecq,et al. Forward analysis for WSTS, part I: completions , 2009, Mathematical Structures in Computer Science.
[13] Philippe Schnoebelen,et al. Flat Acceleration in Symbolic Model Checking , 2005, ATVA.
[14] Fernando Rosa-Velardo,et al. Name Creation vs. Replication in Petri Net Systems , 2008, Fundam. Informaticae.
[15] Mathias Weske,et al. Instance Isolation Analysis for Service-Oriented Architectures , 2008, 2008 IEEE International Conference on Services Computing.
[16] Philippe Schnoebelen,et al. Verifying lossy channel systems has nonprimitive recursive complexity , 2002, Inf. Process. Lett..
[17] Jean-François Raskin,et al. Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS , 2006, J. Comput. Syst. Sci..
[18] Manfred Kudlek,et al. Decidability Problems of a Basic Class of Object Nets , 2007, Fundam. Informaticae.
[19] Parosh Aziz Abdulla,et al. Using Forward Reachability Analysis for Verification of Lossy Channel Systems , 2004, Formal Methods Syst. Des..
[20] P.A. Abdulla,et al. Better is better than well: on efficient verification of infinite-state systems , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[21] Andrew D. Gordon,et al. Notes on Nominal Calculi for Security and Mobility , 2000, FOSAD.
[22] I. Rival. Graphs and order : the role of graphs in the theory of ordered sets and its applications , 1985 .
[23] Fernando Rosa-Velardo,et al. Decidability and complexity of Petri nets with unordered data , 2011, Theor. Comput. Sci..
[24] Philippe Schnoebelen,et al. Reset Nets Between Decidability and Undecidability , 1998, ICALP.
[25] Philippe Schnoebelen,et al. Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..
[26] Parosh Aziz Abdulla,et al. Algorithmic Analysis of Programs with Well Quasi-ordered Domains , 2000, Inf. Comput..