000 04116nam a22006135i 4500
001 978-3-540-48068-6
003 DE-He213
005 20240423132541.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540480686
_9978-3-540-48068-6
024 7 _a10.1007/3-540-48068-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aApplication and Theory of Petri Nets 2002
_h[electronic resource] :
_b23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24-30, 2002. Proceedings /
_cedited by Javier Esparza, Charles Lakos.
250 _a1st ed. 2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2002.
300 _aX, 445 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2360
505 0 _aInvited Papers -- Making Work Flow: On the Application of Petri Nets to Business Process Management -- Model Validation — A Theoretical Issue? -- The Real-Time Refinement Calculus: A Foundation for Machine-Independent Real-Time Programming -- The Challenge of Object Orientation for the Analysis of Concurrent Systems -- Abstract Cyclic Communicating Processes: A Logical View -- Is the Die Cast for the Token Game? -- Regular Papers -- Quasi-Static Scheduling of Independent Tasks for Reactive Systems -- Data Decision Diagrams for Petri Net Analysis -- Non-controllable Choice Robustness Expressing the Controllability of Workflow Processes -- Real-Time Synchronised Petri Nets -- Computing a Finite Prefix of a Time Petri Net -- Verification of a Revised WAP Wireless Transaction Protocol -- Characterizing Liveness of Petri Nets in Terms of Siphons -- Petri Nets, Situations, and Automata -- Reproducibility of the Empty Marking -- Modeling and Analysis of Multi-class Threshold-Based Queues with Hysteresis Using Stochastic Petri Nets -- Tackling the Infinite State Space of a Multimedia Control Protocol Service Specification -- Modelling of Features and Feature Interactions in Nokia Mobile Phones Using Coloured Petri Nets -- Analysing Infinite-State Systems by Combining Equivalence Reduction and the Sweep-Line Method -- Regular Event Structures and Finite Petri Nets: The Conflict-Free Case -- A Formal Service Specification for the Internet Open Trading Protocol -- Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm -- Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow -- Translating TPAL Specifications into Timed-Arc Petri Nets -- Tool Presentation -- Maria: Modular Reachability Analyser for Algebraic System Nets.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aMathematical logic.
650 0 _aComputer networks .
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 1 4 _aTheory of Computation.
650 2 4 _aSoftware Engineering.
650 2 4 _aMathematical Logic and Foundations.
650 2 4 _aComputer Communication Networks.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aEsparza, Javier.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLakos, Charles.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540437871
776 0 8 _iPrinted edition:
_z9783540830047
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2360
856 4 0 _uhttps://doi.org/10.1007/3-540-48068-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189006
_d189006