Petri Nets for Systems Engineering
暂无分享,去创建一个
[1] Weixiong Zhang. State-space search - algorithms, complexity, extensions, and applications , 1999 .
[2] Kenneth L. McMillan,et al. Trace Theoretic Verification of Asynchronous Circuits Using Unfoldings , 1995, CAV.
[3] B. Atkinson. Queuing Theory in Manufacturing Systems Analysis and Design , 1995 .
[4] Josyula Ramachandra Rao. Extensions of the UNITY Methodology: Compositionality, Fairness and Probability in Parallelism , 1995 .
[5] David B. Lomet. Subsystems of Processes with Deadlock Avoidance , 1980, IEEE Transactions on Software Engineering.
[6] Philip Wadler,et al. A Taste of Linear Logic , 1993, MFCS.
[7] Jan K. Pachl. A Simple Proof of a Completeness Result for leads-to in the UNITY Logic , 1992, Inf. Process. Lett..
[8] Józef Winkowski. Protocols of Accessing Overlapping Sets of Resources , 1981, Inf. Process. Lett..
[9] Manuel Silva,et al. On Well-formedness Analysis: The Case of Deterministic Systems of Sequential Processes , 1995, STRICT.
[10] Isabelle Vernier. Graphe symbolique parametre de reseaux de petri et logique temporelle , 1994 .
[11] Amir Pnueli,et al. Proving Partial Order Properties , 1994, Theor. Comput. Sci..
[12] C. A. R. Hoare,et al. Monitors: an operating system structuring concept , 1974, CACM.
[13] Manuel Silva Suárez,et al. Modeling, validation and software implementation of production systems using high level Petri nets , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[14] Jayadev Misra. A Logic for Concurrent Programming: Safety , 2003 .
[15] Jeffrey S. Smith,et al. Formal models for control of flexible manufacturing cells: physical and system model , 1995, IEEE Trans. Robotics Autom..
[16] Dennis Tsichritzis,et al. An office form flow model , 1980, AFIPS '80.
[17] Wolfgang Reisig,et al. Algebraic System Nets for ModellingDistributed Algorithms , 1996 .
[18] J.-B. Stefani,et al. L'architecture à long terme SERENITE , 1994 .
[19] Nabil Zakhama. Le prototypage heterogene formel de systemes distribues une perspective pour le developpement continu , 1996 .
[20] Wolfgang Reisig,et al. Petri Nets and Algebraic Specifications , 1991, Theor. Comput. Sci..
[21] Peter Huber,et al. Design/CPN?: A Reference Manual , 1992 .
[22] Michel Hack,et al. Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.
[23] Doron A. Peled,et al. Verification of distributed programs using representative interleaving sequences , 1992, Distributed Computing.
[24] G. S. Graham. A New Solution of Dijkstra ' s Concurrent Programming Problem , 2022 .
[25] Thorsten von Eicken,et al. 技術解説 IEEE Computer , 1999 .
[26] Kees M. van Hee,et al. A Formal Framework for Dynamic modelling of Information Systems , 1990, DMIS.
[27] Rüdiger Valk,et al. Formal Properties of Place/Transition Nets , 1979, Advanced Course: Net Theory and Applications.
[28] A. Mostefaoui,et al. Causal multicasts in overlapping groups: towards a low cost approach , 1993, 1993 4th Workshop on Future Trends of Distributed Computing Systems.
[29] Fu-Shiung Hsieh,et al. Deadlock Avoidance Controller Synthesis For Flexible Manufacturing Systems , 1992, Proceedings of the Third International Conference on Computer Integrated Manufacturing,.
[30] Jean-Marie Proth,et al. Petri nets : a tool for design and management of manufacturing systems , 1996 .
[31] Serge Haddad,et al. Algebraic structure of flows of a regular coloured net , 1986, European Workshop on Applications and Theory of Petri Nets.
[32] Haoxun Chen,et al. Deadlock avoidance policy for Petri-net modeling of flexible manufacturing systems with shared resources , 1996 .
[33] MengChu Zhou,et al. Petri net synthesis for discrete event control of manufacturing systems , 1992, The Kluwer international series in engineering and computer science.
[34] Ichiro Suzuki,et al. Proving Properties of a Ring of Finite-State Machines , 1988, Inf. Process. Lett..
[35] Ekkart Kindler. Invariants, composition, and substitution , 2005, Acta Informatica.
[36] Daniel Moldt. Höhere Petrinetze als Grundlage für Systemspezifikationen , 1996 .
[37] Ernst-Rüdiger Olderog,et al. Nets, terms and formulas , 1991 .
[38] Janne Halme,et al. PROD Reference Manual , 1995 .
[39] Manuel Silva Suárez,et al. Structure Theory of Equal Conflict Systems , 1996, Theor. Comput. Sci..
[40] Wolfgang Reisig,et al. Petri Nets with Individual Tokens , 1982, Theor. Comput. Sci..
[41] Robert M. Keller,et al. Formal verification of parallel programs , 1976, CACM.
[42] M. Omizo,et al. Modeling , 1983, Encyclopedic Dictionary of Archaeology.
[43] Claire Ozanne. Conception d'applications client-serveur : modeles d'architecture fonctionnelle et operationnelle , 1996 .
[44] R. Card,et al. Rapid Ada prototyping: principles and example of a complex application , 1990, Ninth Annual International Phoenix Conference on Computers and Communications. 1990 Conference Proceedings.
[45] Edward L. Robertson,et al. Properties of Conflict-Free and Persistent Petri Nets , 1978, JACM.
[46] Richard M. Karp,et al. Parallel Program Schemata , 1969, J. Comput. Syst. Sci..
[47] Wolfgang Reisig. Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.
[48] J. Davenport. Editor , 1960 .
[49] Patrick Viry. Rewriting: An Effective Model of Concurrency , 1994, PARLE.
[50] James L. Peterson,et al. Petri Nets , 1977, CSUR.
[51] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[52] Grzegorz Rozenberg,et al. High-level Petri Nets: Theory And Application , 1991 .
[53] Kurt Mehlhorn,et al. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.
[54] Friedemann Mattern,et al. Virtual Time and Global States of Distributed Systems , 2002 .
[55] Isabelle Mounier,et al. Symbolic Executions of Symmetrical Parallel Programs , 1996, PDP.
[56] Kurt Jensen,et al. Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..
[57] Pierre Wolper,et al. Partial-order methods for model checking: from linear time to branching time , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[58] José Meseguer,et al. From Petri Nets to Linear Logic through Categories: A Survey , 1991, Int. J. Found. Comput. Sci..
[59] Younes Souissi,et al. Deterministic Systems of Sequential Processes: a class of structured Petri nets , 1991, Applications and Theory of Petri Nets.
[60] 김미정,et al. Prototyping에 관한 조사 연구 , 1994 .
[61] P. S. Thiagarajan,et al. A Fresh Look at Free Choice Nets , 1984, Inf. Control..
[62] Pierre Wolper,et al. An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages , 1996, CONCUR.
[63] Cd Keen,et al. An Open Software Engineering Environment Based on Object Petri Nets , 1995 .
[64] Rüdiger Valk,et al. Safe states in banker like resource allocation problems , 1985, Applications and Theory in Petri Nets.
[65] Wolfram Pietsch,et al. Business Process Reengineering , 1994, Wirtschaftsinf..
[66] Andrew P. Black,et al. Fine-grained mobility in the Emerald system , 1987, TOCS.
[67] Monika Heiner,et al. Petri Net Based Software Validation Prospects and Limitations , 2004 .
[68] P. R. Muro-Medrano,et al. Using Petri net models at the coordination level for manufacturing systems control , 1994 .
[69] Fabio Somenzi,et al. Automatic Generation of Network Invariants for the Verification of Iterative Sequential Systems , 1993, CAV.
[70] Yadati Narahari,et al. A Petri net approach to the modelling and analysis of flexible manufacturing systems , 1985 .
[71] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[72] Lawrence C. Paulson. Mechanizing UNITY in Isabelle , 2000, TOCL.
[73] A. Udaya Shankar,et al. An introduction to assertional reasoning for concurrent systems , 1993, CSUR.
[74] Edgar Knapp. Soundness and Completeness of UNITY Logic , 1994, FSTTCS.
[75] Antti Valmari,et al. On-the-Fly Verification with Stubborn Sets , 1993, CAV.
[76] Morris Sloman,et al. Constructing Distributed Systems in Conic , 1989, IEEE Trans. Software Eng..
[77] Peter Päppinghaus,et al. On the Logic of UNITY , 1995, Theor. Comput. Sci..
[78] Kurt Mehlhorn,et al. Graph Algorithm and NP-Completeness , 1984 .
[79] Gerard J. Holzmann,et al. Coverage Preserving Reduction Strategies for Reachability Analysis , 1992, PSTV.
[80] Ruediger Valk. Relating Different Semantics for Object Petri Nets , 2000 .
[81] Gerard Tel,et al. Topics in distributed algorithms , 1991 .
[82] Marc Courvoisier,et al. Joining Petri nets and knowledge based systems for monitoring purposes , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[83] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .
[84] José Meseguer,et al. Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework , 2004, Essays in Memory of Ole-Johan Dahl.
[85] Masafumi Yamashita,et al. A New Structural Induction Theorem for Rings of Temporal Petri Nets , 1994, IEEE Trans. Software Eng..
[86] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[87] Thomas J. Mowbray,et al. The essential CORBA - systems integration using distributed objects , 1995 .
[88] David E. van den Bout,et al. The Anyboard: a rapid-prototyping system for use in teaching digital circuit design , 1990, [1990 Proceedings] The First International Workshop on Rapid System Prototying.
[89] V. Rich. Personal communication , 1989, Nature.
[90] Beverly A. Sanders. Eliminating the substitution axiom from UNITY logic , 2005, Formal Aspects of Computing.
[91] Ian Sommerville,et al. Configuration specification using a system structure language , 1992, CDS.
[92] R. Karp,et al. Properties of a model for parallel computations: determinacy , 1966 .
[93] Mohsen A. Jafari,et al. An architecture for a shop-floor controller using colored Petri nets , 1992 .
[94] José Meseguer,et al. A logical theory of concurrent objects and its realization in the Maude language , 1993 .
[95] Kurt Jensen,et al. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 3, Practical Use , 1997 .
[96] LamportLeslie. Time, clocks, and the ordering of events in a distributed system , 1978 .
[97] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[98] Michel Raynal,et al. Algorithms for mutual exclusion , 1986 .
[99] Zohar Manna,et al. The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.
[100] José Meseguer,et al. Initiality, induction, and computability , 1986 .
[101] M. Z. Muehlen,et al. Workflow Management Coalition , 2000 .
[102] Amir Pnueli,et al. Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.
[103] Enno Ohlebusch,et al. Term Rewriting Systems , 2002 .
[104] Universite Paris VI-C. N. R. S. MASI. TOWARDS A GENERAL AND POWERFUL COMPUTATION OF LOWS FOR PARAMETRIZED COLOURED NETS , 1988 .
[105] Peter Radford,et al. Petri Net Theory and the Modeling of Systems , 1982 .
[106] Lars G Fischer. Workflow Handbook 2002, Workflow Management Coalition , 2002 .
[107] Bengt Lennartson,et al. Performance modeling of automated manufacturing systems , 1995, Autom..
[108] Barbara Liskov,et al. Distributed programming in Argus , 1988, CACM.
[109] Doron A. Peled,et al. Combining partial order reductions with on-the-fly model-checking , 1994, Formal Methods Syst. Des..
[110] R. Haupt,et al. A survey of priority rule-based scheduling , 1989 .
[111] Rüdiger Valk. On Processes of Object Petri Nets , 1996 .
[112] R. Valette,et al. Petri nets for sequence constraint propagation in knowledge based approaches , 1987 .
[113] Gerard J. Holzmann,et al. The SPIN Model Checker , 2003 .
[114] Wolfgang Wechler,et al. Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.
[115] Fabrice Kordon,et al. Process decomposition for Rapid Prototyping of Parallel systems , 1991 .
[116] MengChu Zhou,et al. Parallel and sequential mutual exclusions for petri net modeling of manufacturing systems with shared resources , 1991, IEEE Trans. Robotics Autom..
[117] R. Steele. Optimization , 2005 .
[118] Denis Poitrenaud. Graphes de processus arborescents pour la verification de proprietes , 1996 .
[119] A. Troelstra. Lectures on linear logic , 1992 .
[120] Fabrice Kordon,et al. H-COSTAM: a hierarchical communicating state-machine model for generic prototyping , 1995, Proceedings Sixth IEEE International Workshop on Rapid System Prototyping. Shortening the Path from Specification to Prototype.
[121] Rolf Walter. Petrinetzmodelle verteilter Algorithmen: Beweistechnik und Intuition , 1995, Edition Versal.
[122] Christos T. Karamanolis,et al. Elements of distributed algorithms-modeling and analysis with petri nets Wolfgang Reisig [Book review] , 1999, IEE Proceedings - Software.
[123] Pierre Wolper,et al. Verifying Properties of Large Sets of Processes with Network Invariants , 1990, Automatic Verification Methods for Finite State Systems.
[124] Fabrice Kordon. Prototypage de systemes paralleles a partir de reseaux de petri colores, application au langage ada dans un environnement centralise ou reparti , 1992 .
[125] Gerard J. Holzmann,et al. Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching , 1987, IEEE Transactions on Software Engineering.
[126] Ekkart Kindler. Modularer Entwurf verteilter Systeme mit Petrinetzen , 1995, Edition Versal.
[127] Olivier Géhan. Sur la commande de procedes industriels , 2000 .
[128] Mark G. Staskauskas. Formal Derivation of Concurrent Programs: An Example from Industry , 1993, IEEE Trans. Software Eng..
[129] Manuel Silva Suárez,et al. Petri Nets for the Design and Operation of Manufacturing Systems , 1997, Eur. J. Control.
[130] Amir Pnueli,et al. Symbolic model checking with rich assertional languages , 2001, Theor. Comput. Sci..
[131] Gerard J. Holzmann,et al. An improved protocol reachability analysis technique , 1988, Softw. Pract. Exp..
[132] Luqi,et al. Real-time scheduling for software prototyping , 1996, J. Syst. Integr..
[133] P. H. Starke,et al. Reachability analysis of Petri nets using symmetries , 1991 .
[134] Valmir Carneiro Barbosa,et al. An introduction to distributed algorithms , 1996 .
[135] Wolfgang Reisig,et al. Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.
[136] Robert Valette,et al. Analysis of Petri Nets by Stepwise Refinements , 1979, J. Comput. Syst. Sci..
[137] Darrel C. Ince,et al. Software prototyping, formal methods, and VDM , 1988 .
[138] Tadao Murata,et al. Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis , 1994, IEEE Trans. Software Eng..
[139] 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.
[140] William E. Lorensen,et al. Object-Oriented Modeling and Design , 1991, TOOLS.
[141] Barbara Heyd,et al. A Modular Coding of UNITY in COQ , 1996, TPHOLs.
[142] Leslie Lamport,et al. Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.
[143] Thierry Jéron,et al. Bounded-memory Algorithms for Verification On-the-fly , 1991, CAV.
[144] Kimon P. Valavanis. On the hierarchical modeling analysis and simulation of flexible manufacturing systems with extended Petri nets , 1990, IEEE Trans. Syst. Man Cybern..
[145] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[146] F. Kordon,et al. Proposal for a generic prototyping approach , 1994, ETFA '94. 1994 IEEE Symposium on Emerging Technologies and Factory Automation. (SEIKEN) Symposium) -Novel Disciplines for the Next Century- Proceedings.
[147] Beniamino Di Martino,et al. Proceedings of 4th Euromicro Workshop on Parallel and Distributed Processing , 1996 .
[148] Thierry Jéron,et al. On-Line Model Checking for Finite Linear Temporal Logic Specifications , 1989, Automatic Verification Methods for Finite State Systems.
[149] Glynn Winskel,et al. Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..
[150] Pierre Wolper,et al. An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.
[151] C. Petri. Kommunikation mit Automaten , 1962 .
[152] Rüdiger Valk,et al. The residue of vector sets with applications to decidability problems in Petri nets , 1985, Acta Informatica.
[153] José Meseguer,et al. Petri nets are monoids: a new algebraic foundation for net theory , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[154] MuDer Jeng,et al. Synthesis using resource control nets for modeling shared-resource systems , 1995, IEEE Trans. Robotics Autom..
[155] Zohar Manna,et al. The anchored version of the temporal framework , 1988, REX Workshop.
[156] Robert A. Nelson,et al. Casting Petri Nets into Programs , 1983, IEEE Transactions on Software Engineering.
[157] Robert P. Kurshan,et al. A structural induction theorem for processes , 1989, PODC.
[158] Tobias Nipkow,et al. Combining Model Checking and Deduction for I/O-Automata , 1995, TACAS.
[159] Slobodan Ribaric. Knowledge Representation Scheme Based on Petri Net Theory , 1988, Int. J. Pattern Recognit. Artif. Intell..
[160] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.
[161] Gérard Roucairol,et al. Linear Algebra in Net Theory , 1979, Advanced Course: Net Theory and Applications.
[162] Eike Jessen,et al. Rechensysteme - Grundlagen der Modellbildung , 1987, Studienreihe Informatik.
[163] Glynn Winskel,et al. A Compositional Proof System on a Category of Labelled Transition Systems , 1989, Inf. Comput..
[164] Jarle Hulaas,et al. AN INCREMENTAL PROTOTYPING METHODOLOGY FOR DISTRIBUTED SYSTEMS BASED ON FORMAL SPECIFICATIONS , 1997 .
[165] Jean-Michel Ilié,et al. Model Checking Through Symbolic Reachability Graph , 1997, TAPSOFT.
[166] Manuel Silva. Las Redes de Petri : en la Automática y la Informática , 2002 .
[167] Doron A. Peled,et al. All from One, One for All: on Model Checking Using Representatives , 1993, CAV.
[168] A. Pnueli. The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..
[169] Anne Helga Seltveit,et al. Coupling Process Models and Business Rules , 1995 .
[170] C. A. Petri. Nets, Time and Space , 1996, Theoretical Computer Science.
[171] Ichiro Suzuki,et al. A Method for Stepwise Refinement and Abstraction of Petri Nets , 1983, J. Comput. Syst. Sci..
[172] Kenneth L. McMillan,et al. Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.
[173] Oscar Nierstrasz,et al. Message flow analysis , 1984 .
[174] Daniel Prun. Methodologie de conception de composants logiciels cooperatifs : une approche pour l'observation, la mise au point et la maintenance evolutive d'applications reparties , 1998 .
[175] Manuel Silva,et al. PROGRAMMABLE LOGIC CONTROLLERS AND PETRI NETS: A COMPARATIVE STUDY , 1983 .
[176] Michel Hack,et al. ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .
[177] Jacques Vautherin. Un modèle algébrique, basé sur les réseaux de Petri, pour l'étude des systèmes parallèles , 1985 .
[178] Petri Pulli,et al. Graphics based prototyping of real-time systems , 1990, [1990 Proceedings] The First International Workshop on Rapid System Prototying.
[179] Anne Sjerp Troelstra. Tutorial on Linear Logic , 1992, JICSLP.
[180] José Meseguer,et al. Petri Nets Are Monoids , 1990, Inf. Comput..
[181] Antti Valmari,et al. A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..
[182] Wolfgang Reisig,et al. System Design Using Petri Nets , 1983, Requirements Engineering.
[183] Orna Grumberg,et al. Network Grammars, Communication Behaviors and Automatic Verification , 1989, Automatic Verification Methods for Finite State Systems.
[184] MeseguerJosé. Conditional rewriting logic as a unified model of concurrency , 1992 .
[185] Max I. Kanovich,et al. Petri Nets, Horn Programs, Linear Logic and Vector Games , 1995, Ann. Pure Appl. Log..
[186] Johannes F. Broenink,et al. Communicating Java Threads , 1997 .
[187] Andre Scedrov,et al. A brief guide to linear logic , 1990, Bull. EATCS.
[188] Colin Stirling,et al. Modal and Temporal Logics for Processes , 1996, Banff Higher Order Workshop.