Quote: review of Petri net theory--axioms, definitions, compilation, continuous variables, limits of precision [»petrCA_1996]

Quote: a Petri net has circles (places) and bars (transitions); a marking is a pattern of tokens at places [»ramaCV9_1980]

Quote: a marked graph shows where items flow and what they meet, while a state transition diagram shows their function [»holtAW_1970]

Quote: Petri net--an edge between circle x and square a means object x is found at location a

Quote: in Petri net theory define an object as a bit at a location; an object does not 'move' [»petrCA1_1966]

Quote: in general net theory, boxes denote productive activities, circles denote places for storing resources, and arrows denote accessibility [»petrCA10_1979]

Quote: model system evolution with events, states, and conditions

Quote: a system behavior is an alternating sequence of states (interface) and agents (system or environment) [»abadM1_1993]

Quote: a state space of regions and boundaries forms a topology of open and closed points; isomorphic with undirected Petri nets [»holtAW11_1980]

Quote: use a Petri net to represent an object at several, overlapping locations; e.g., Venn diagram [»holtAW_1979]

Quote: the arcs of a Petri-net are as real as the objects themselves [»holtAW_1979]

Quote: the connexions of a switching element (a,b,c) are its domains of operation; at these places, it perceives 0- and 1-objects [»petrCA1_1966]

Quote: a computer system can be seen as a medium for communicating messages within a group [»holtAW11_1966]

Quote: the old conception of computation treated wires as idealized, instantaneous connections [»hillWD_1985]

Quote: in computers, wires are much of the cost, space and delay times

Quote: a Petri net can be an infinite net because its parts can not communicate with arbitrarily far away parts [»petrCA1_1966]

Quote: Petri net theory rejects all global properties [»petrCA1_1966]

Quote: in Petri net theory, discrete objects are combined and produced by finite techniques [»petrCA1_1966]

Quote: a system theory should assume that all resources are limited; including space-time [»petrCA10_1979]

Quote: Petri net theory assumes upper bounds on signal speed and information density [»petrCA1_1966]

Quote: use physically realistic properties for idealized logical elements; e.g., quantization, conservation, and reaction [»petrCA1_1966]

Quote: an 'and' gate only works correctly if its inputs do not change; not physically realizable because of missing reaction [»petrCA1_1966, OK]

Quote: a realizable 'and' gate has only one transition '1a 1b 0c -> 0a 0b 1c'; it produces a reaction [»petrCA1_1966]

Quote: in dharma theory, all things are made of instantaneous, multiply interacting events called dharmas [»joneTC6_1977]

Quote: the aim of occam is to describe arbitrarily large systems in terms of localized processing and communication [»mayD_1987]

Quote: a computer can operate asynchronously, fully parallel, arbitrary extension without interruption [»petrCA1_1966]

Quote: Petri nets treats continuous motion and interconnects other models

Quote: combine Petri net theory with a compositional view of systems; like combining Turing machines with lambda-calculus [»milnR1_1993]

Quote: general net theory concerns conceptual levels, concurrency, resources, imprecision, and discrete/continuous [»petrCA10_1979]

Quote: in a Petri net can represent nonprimitive events and subnets by a box with bars for primitive events [»peteJL_1981]

Quote: a net morphism respects connectivity and orientation, e.g., all occurrences of seasons to Fall, Winter, Spring, Summer [»petrCA10_1979]

Quote: any significant extension to Petri nets results in a Turing machine; e.g., inhibitor arcs [»peteJL9_1977]

Quote: can construct a Turing machine with a Petri net that satisfies the conditions of physical realizability; only need one kind of transition [»petrCA1_1966]

Quote: Petri constructed a Petri net representation of a Turing machine; used automatic tape constructors; equivalent to an infinite net [»petrCA1_1966, OK]

Quote: for an automaton to solve any recursive problem it must be extendable without bound [»petrCA1_1966]

Quote: Petri nets simulate Turing machines if they can test for zero

Quote: Petri's original firing rule required no tokens at the outputs; a form of zero testing [»peteJL_1981]

Quote: predicate/transition (PrT) Petri nets use high-level transitions/places, algebraic/logical conditions, and distinguishable tokens [»bellF6_1991]

Quote: a net is capable of communication if it has peripheral locations that belong to only one node [»petrCA1_1966]

Quote: communicate between two Petri nets by identifying peripheral locations

Quote: real-time systems by connecting programs via the operating system, using finite-state machine or Petri nets, using concurrent programming languages [»benvA9_1991]

Quote: in Trellis, browsing semantics is based on petri nets [»stotPD12_1988]

Quote: a Trellis Hypertext is a petri net of links, user interface components, and mappings between them and the display [»stotPD12_1988]

Quote: model cooperative robots by a petri net with a graphical display [»kakaY9_1985]