Transactions on Petri Nets and Other Models of Concurrency XIV
暂无分享,去创建一个
[1] Jonathan Billington,et al. Application of Petri Nets to Communication Networks: Advances in Petri Nets , 1999 .
[2] Juan de Lara,et al. Meta-modelling and graph grammars for multi-paradigm modelling in AToM3 , 2004, Software & Systems Modeling.
[3] Jordi Cortadella,et al. Petri Net Analysis Using Boolean Manipulation , 1994, Application and Theory of Petri Nets.
[4] Kenneth L. McMillan,et al. Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.
[5] Josep Carmona,et al. The Label Splitting Problem , 2011, ART @ Petri Nets.
[6] Antti Valmari,et al. The State Explosion Problem , 1996, Petri Nets.
[7] Javier Esparza,et al. Model Checking Using Net Unfoldings , 1993, Sci. Comput. Program..
[8] Claudia Ermel,et al. Generation of Simulation Views for Domain Specific Modeling Languages Based on the Eclipse Modeling Framework , 2009, 2009 IEEE/ACM International Conference on Automated Software Engineering.
[9] Søren Christensen,et al. Coloured Petri Nets Extended with Channels for Synchronous Communication , 1992, Application and Theory of Petri Nets.
[10] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[11] Josep Carmona,et al. A Fresh Look at Precision in Process Conformance , 2010, BPM.
[12] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[13] Richard F. Paige,et al. The Epsilon Transformation Language , 2008, ICMT@TOOLS.
[14] Robert M. Keller,et al. A Fundamental Tehoerem of Asynchronous Parallel Computation , 1974, Sagamore Computer Conference.
[15] Edmund M. Clarke,et al. Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..
[16] Tiziano Villa,et al. Multi-valued decision diagrams: theory and applications , 1998 .
[17] Ivan Edward Sutherland,et al. Sketchpad: A man-machine graphical communication system (Outstanding dissertations in the computer sciences) , 1980 .
[18] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[19] Glynn Winskel,et al. Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..
[20] Lothar Thiele,et al. Interval diagram techniques for symbolic model checking of Petri nets , 1999, DATE '99.
[21] Manuel Silva Suárez,et al. Structure Theory of Equal Conflict Systems , 1996, Theor. Comput. Sci..
[22] Kurt Jensen. Condensed state spaces for symmetrical Coloured Petri Nets , 1996, Formal Methods Syst. Des..
[23] Hanno Ridder. Analyse von Petri-Netz-Modellen mit Entscheidungsdiagrammen , 1997 .
[24] Kamal Lodaya,et al. Product Automata and Process Algebra , 2006, Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06).
[25] Richard M. Karp,et al. Parallel Program Schemata , 1969, J. Comput. Syst. Sci..
[26] Gianfranco Ciardo,et al. Efficient Reachability Set Generation and Storage Using Decision Diagrams , 1999, ICATPN.
[27] Olivia Oanea,et al. New Algorithms for Deciding the Siphon-Trap Property , 2010, Petri Nets.
[28] Hassane Alla,et al. Discrete, continuous, and hybrid Petri Nets , 2004 .
[29] Armin Biere,et al. Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..
[30] Boudewijn F. van Dongen,et al. Conformance Checking Using Cost-Based Fitness Analysis , 2011, 2011 IEEE 15th International Enterprise Distributed Object Computing Conference.
[31] Michael Westergaard. Access/CPN 2.0: A High-Level Interface to Coloured Petri Net Models , 2011, Petri Nets.
[32] S. Sieber. On a decision method in restricted second-order arithmetic , 1960 .
[33] Luciano Baresi,et al. On Accurate Automatic Verification of Publish-Subscribe Architectures , 2007, 29th International Conference on Software Engineering (ICSE'07).
[34] Uwe Kastens,et al. Animation automatically generated from simulation specifications , 2009, 2009 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC).
[35] Doron A. Peled,et al. All from One, One for All: on Model Checking Using Representatives , 1993, CAV.
[36] M. Colnaric,et al. Design of embedded control systems , 2003, IEEE International Conference on Industrial Technology, 2003.
[37] Peter Huber,et al. Hierarchies in coloured Petri nets , 1991, Applications and Theory of Petri Nets.
[38] Kim G. Larsen,et al. The power of reachability testing for timed automata , 1998, Theor. Comput. Sci..
[39] Luciano Baresi,et al. An Approach to Model and Validate Publish/Subscribe Architectures , 2003 .
[40] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[41] Remco M. Dijkman,et al. Semantics and analysis of business process models in BPMN , 2008, Inf. Softw. Technol..
[42] Pierre Wolper,et al. A Partial Approach to Model Checking , 1994, Inf. Comput..
[43] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..
[44] Thomas A. Henzinger,et al. Parametric real-time reasoning , 1993, STOC.
[45] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[46] Antti Valmari,et al. Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.
[47] Lars Michael Kristensen,et al. A Generalised Sweep-Line Method for Safety Properties , 2002, FME.
[48] Wil M. P. van der Aalst,et al. Workflow mining: discovering process models from event logs , 2004, IEEE Transactions on Knowledge and Data Engineering.
[49] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[50] Levi Lucio,et al. System Prototype and Verification Using Metamodel-Based Transformations , 2007, IEEE Distributed Systems Online.
[51] Manuel Silva Suárez,et al. Choice-free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals , 1997, IEEE Trans. Syst. Man Cybern. Part A.
[52] Gabor Karsai,et al. Challenges and directions in formalizing the semantics of modeling languages , 2011, Comput. Sci. Inf. Syst..
[53] Karsten Wolf. How to calculate symmetries of Petri nets , 2000, Acta Informatica.
[54] Karsten Wolf. Stubborn Sets for Standard Properties , 1999, ICATPN.
[55] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.
[56] Gérard Roucairol,et al. Linear Algebra in Net Theory , 1979, Advanced Course: Net Theory and Applications.
[57] Janusz A. Brzozowski,et al. Derivatives of Regular Expressions , 1964, JACM.
[58] Wil M. P. van der Aalst,et al. Conformance checking of processes based on monitoring real behavior , 2008, Inf. Syst..
[59] Kurt Lautenbach,et al. Use of Petri Nets for Proving Correctness of Concurrent Process Systems , 1974, IFIP Congress.
[60] J. Grabowski,et al. On partial languages , 1981, Fundam. Informaticae.
[61] Emmanuelle Encrenaz-Tiphène,et al. An Inverse Method for Parametric Timed Automata , 2008, RP.
[62] Luigi Pontieri,et al. Discovering expressive process models by clustering log traces , 2006, IEEE Transactions on Knowledge and Data Engineering.
[63] Remco M. Dijkman,et al. Petri Net Transformations for Business Processes - A Survey , 2009, Trans. Petri Nets Other Model. Concurr..
[64] Karsten Wolf. Automated generation of a progress measure for the sweep-line method , 2005, International Journal on Software Tools for Technology Transfer.
[65] Luciano Lavagno,et al. A Symbolic Algorithm for the Synthesis of Bounded Petri Nets , 2008, Petri Nets.
[66] James L. Peterson. Computation Sequence Sets , 1976, J. Comput. Syst. Sci..
[67] Zohar Manna,et al. The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.
[68] Lars Michael Kristensen,et al. A Sweep-Line Method for State Space Exploration , 2001, TACAS.
[69] Anne-Marie Kermarrec,et al. The many faces of publish/subscribe , 2003, CSUR.
[70] J. A. Brzozowski,et al. Review: B. G. Mirkin, An Algorithm for Constructing a Base in a Language of Regular Expressions , 1971, Journal of Symbolic Logic.
[71] Stefano Crespi-Reghizzi,et al. A Decidability Theorem for a Class of Vector-Addition Systems , 1975, Inf. Process. Lett..
[72] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[73] Michel Hack,et al. ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .
[74] Madhavan Mukund,et al. Kleene Theorems for Product Systems , 2011, DCFS.
[75] Anneke Kleppe,et al. Software Language Engineering: Creating Domain-Specific Languages Using Metamodels , 2008 .
[76] Bart Baesens,et al. A robust F-measure for evaluating discovered process models , 2011, 2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM).
[77] Vijay K. Garg,et al. Concurrent Regular Expressions and Their Relationship to Petri Nets , 1992, Theor. Comput. Sci..
[78] Wieslaw Zielonka,et al. Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..
[79] Kim G. Larsen,et al. To Store or Not to Store , 2003, CAV.
[80] Jérôme Leroux. The General Vector Addition System Reachability Problem by Presburger Inductive Invariants , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.
[81] P. H. Starke,et al. Reachability analysis of Petri nets using symmetries , 1991 .
[82] Jordi Cortadella,et al. Structural Methods to Improve the Symbolic Analysis of Petri Nets , 1999, ICATPN.
[83] Karsten Wolf. Using Petri Net Invariants in State Space Construction , 2003, TACAS.
[84] Jörg Desel,et al. Free choice Petri nets , 1995 .
[85] James L. Peterson,et al. Petri Nets , 1977, CSUR.
[86] Thomas Wagner,et al. Integrating Verification into the PAOSE Approach , 2011, PNSE.
[87] Javier Esparza,et al. Model Checking LTL Using Constraint Programming , 1997, ICATPN.
[88] Valentin M. Antimirov. Partial Derivatives of Regular Expressions and Finite Automaton Constructions , 1996, Theor. Comput. Sci..
[89] Bart Baesens,et al. Robust Process Discovery with Artificial Negative Events , 2009, J. Mach. Learn. Res..
[90] Jean-Paul Doignon,et al. Convexity in cristallographical lattices , 1973 .
[91] Amir Pnueli,et al. Marked Directed Graphs , 1971, J. Comput. Syst. Sci..
[92] Lawrence Cabac. Modeling Petri net-based multi-agent applications , 2010 .
[93] David Garlan,et al. Model Checking Publish-Subscribe Systems , 2003, SPIN.
[94] Matthias Jantzen. Language theory of Petri nets , 1986 .
[95] Wil M. P. van der Aalst,et al. The Need for a Process Mining Evaluation Framework in Research and Practice , 2007, Business Process Management Workshops.
[96] Rajeev Alur,et al. Model-Checking in Dense Real-time , 1993, Inf. Comput..