LEADER 04578nam 2200565Ia 450 001 9910484509003321 005 20200520144314.0 010 $a3-642-00899-2 024 7 $a10.1007/978-3-642-00899-3 035 $a(CKB)1000000000718147 035 $a(SSID)ssj0000320478 035 $a(PQKBManifestationID)11238886 035 $a(PQKBTitleCode)TC0000320478 035 $a(PQKBWorkID)10249562 035 $a(PQKB)10454140 035 $a(DE-He213)978-3-642-00899-3 035 $a(MiAaPQ)EBC3064078 035 $a(PPN)134126556 035 $a(EXLCZ)991000000000718147 100 $a20090522d2009 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aTransactions on petri nets and other models of concurrency$hII$iSpecial issue on concurrency in process-aware information systems /$fKurt Jensen, Wil M.P. van der Aalst (eds.) 205 $a1st ed. 2009. 210 $aBerlin ;$aHeidelberg $cSpringer$dc2009 215 $a1 online resource (XVIII, 297 p.) 225 1 $aLecture notes in computer science ;$v5460 300 $aIncludes index. 311 $a3-642-00898-4 327 $aProcess-Aware Information Systems: Lessons to Be Learned from Process Mining -- Model-Based Software Engineering and Process-Aware Information Systems -- Petri Net Transformations for Business Processes ? A Survey -- A Look Around the Corner: The Pi-Calculus -- newYAWL: Towards Workflow 2.0 -- A Formal Model for Organisational Structures behind Process-Aware Information Systems -- Flexibility in Process-Aware Information Systems -- Business Grid: Combining Web Services and the Grid -- Does My Service Have Partners? -- Deciding Substitutability of Services with Operating Guidelines -- A Framework for Linking and Pricing No-Cure-No-Pay Services -- Empirical Studies in Process Model Verification -- Process Mining: Overview and Outlook of Petri Net Discovery Algorithms -- Construction of Process Models from Example Runs -- Online Interaction Analysis Framework for Ad-Hoc Collaborative Processes in SOA-Based Environments -- Exploiting Inductive Logic Programming Techniques for Declarative Process Mining. 330 $aTransactions on Petri Nets and Other Models of Concurrency (ToPNoC) II These Transactions publish archival papers in the broad area of Petri nets and other models of concurrency, ranging from theoretical work to tool support and industrial applications. ToPNoC issues are published as LNCS volumes, and hence are widely distributed and indexed. This Journal has its own Editorial Board which selects papers based on a rigorous two-stage refereeing process. ToPNoC contains: - Revised versions of a selection of the best papers from workshops and tutorials at the annual Petri net conferences - Special sections/issues within particular subareas (similar to those published in the Advances in Petri Nets series) - Other papers invited for publication in ToPNoC - Papers submitted directly to ToPNoC by their authors The second volume of ToPNoC focuses on Concurrency in Process-Aware Information Systems. Although the topic of business process management using information technology has been addressed by consultants and software developers in depth, more fundamental approaches towards such Process-Aware Information Systems (PAISs) have been rather uncommon. It wasn't until the 1990s that researchers started to work on the foundations of PAISs. Clearly, concurrency theory is an essential ingredient in these foundations as business processes are highly concurrent involving all types of routing logic and resource allocation mechanisms. The 16 papers in this special issue of ToPNoC cover topics ranging from the formal (mostly Petri-net based) foundations of PAISs to more applied topics such as flexibility and process mining. Thus, this volume gives a good overview of the state of the art in PAIS research. 410 0$aLecture notes in computer science ;$v5460. 517 3 $aSpecial issue on concurrency in process-aware information systems 606 $aComputer multitasking 606 $aInformation resources management 615 0$aComputer multitasking. 615 0$aInformation resources management. 676 $a005.11 701 $aJensen$b K$g(Kurt),$f1950-$01237950 701 $aAalst$b Wil van der$0981323 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484509003321 996 $aTransactions on petri nets and other models of concurrency$94192048 997 $aUNINA