{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T16:16:45Z","timestamp":1726417005109},"reference-count":35,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780444828309"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1016\/b978-044482830-9\/50037-0","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T13:58:36Z","timestamp":1192024716000},"page":"1269-1327","source":"Crossref","is-referenced-by-count":0,"title":["A Process Algebra for Interworkings"],"prefix":"10.1016","author":[{"given":"S.","family":"Mauw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.A.","family":"Reniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/B978-044482830-9\/50037-0_bib1","first-page":"335","article-title":"Interorganizational workflow: An approach based on Message Sequence Charts and Petri nets","volume":"34","author":"van der Aalst","year":"1999","journal-title":"Systems Anal. \u2013 Modelling \u2013 Simulation"},{"issue":"2","key":"10.1016\/B978-044482830-9\/50037-0_bib2","first-page":"70","article-title":"An analyzer for Message Sequence Charts","volume":"17","author":"Alur","year":"1996","journal-title":"Software \u2013 Concepts and Tools"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib3","series-title":"Formal Description Techniques VII, Proc. 7th IFIP WG 6.1 International Conference on Formal Description Techniques","first-page":"340","article-title":"Delayed choice: an operator for joining Message Sequence Charts","author":"Baeten","year":"1995"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib4","series-title":"CONCUR'93, International Conference on Concurrency Theory","first-page":"477","article-title":"A congruence theorem for structured operational semantics with predicates","author":"Baeten","year":"1993"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib5","series-title":"Semantic Modelling","first-page":"149","article-title":"Concrete process algebra","author":"Baeten","year":"1995"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","article-title":"Process Algebra","author":"Baeten","year":"1990"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib7","series-title":"Algebra of Communicating Processes, Utrecht 1994 Workshops in Computing","first-page":"106","article-title":"Formal semantics of Interworkings with discrete absolute time","author":"van den Brink","year":"1995"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib8","series-title":"Formal Description Techniques and Protocol Specification, Testing and Verification Proc. FORTE X and PSTV XVII'97","first-page":"75","article-title":"A hierarchy of communication models for Message Sequence Charts","author":"Engels","year":"1997"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib9","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0950-5849(97)00019-0","article-title":"Synchonous sequence charts in action","volume":"39","author":"Feijs","year":"1997","journal-title":"Information and Software Technology"},{"issue":"1","key":"10.1016\/B978-044482830-9\/50037-0_bib10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s004460050053","article-title":"Generating FSMs from Interworkings","volume":"12","author":"Feijs","year":"1999","journal-title":"Distrib. Comput."},{"key":"10.1016\/B978-044482830-9\/50037-0_bib11","series-title":"SDL'93 \u2013 Using Objects, Proc. 6th SDL Forum","first-page":"179","article-title":"Towards a Petri net based semantics definition for Message Sequence Charts","author":"Grabowski","year":"1993"},{"year":"1993","series-title":"Recommendation Z.120: Message Sequence Chart (MSC)","author":"ITU-T","key":"10.1016\/B978-044482830-9\/50037-0_bib12"},{"year":"1995","series-title":"Recommendation Z.120 Annex B: Algebraic semantics of Message Sequence Charts","author":"ITU-T","key":"10.1016\/B978-044482830-9\/50037-0_bib13"},{"issue":"5","key":"10.1016\/B978-044482830-9\/50037-0_bib14","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF01211629","article-title":"Interpreting message flow graphs","volume":"7","author":"Ladkin","year":"1995","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib15","series-title":"SDL'93 \u2013 Using Objects, Proc. 6th SDL Forum","first-page":"157","article-title":"Towards a formal semantics of Message Sequence Charts","author":"de Man","year":"1993"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib16","series-title":"SDL'95 \u2013 with MSC in CASE, Proc. 7th SDL Forum","first-page":"51","article-title":"Generating tools for Message Sequence Charts","author":"Mauw","year":"1995"},{"issue":"4","key":"10.1016\/B978-044482830-9\/50037-0_bib17","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1093\/comjnl\/37.4.269","article-title":"An algebraic semantics of Basic Message Sequence Charts","volume":"37","author":"Mauw","year":"1994","journal-title":"Comput. J."},{"key":"10.1016\/B978-044482830-9\/50037-0_bib18","article-title":"An algebraic semantics of Message Sequence Charts","author":"Mauw","year":"1994","journal-title":"Technical Report CSN 94\/23, Eindhoven University of Technology, Department of Computing Science, Eindhoven"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib19","article-title":"Empty Interworkings and refinement \u2013 semantics of Interworkings revised","author":"Mauw","year":"1995","journal-title":"Technical Report CSR 95-12, Eindhoven University of Technology, Department of Computing Science"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib20","first-page":"67","article-title":"Empty Interworkings and refinement \u2013 semantics of Interworkings revised","author":"Mauw","year":"1995","journal-title":"ACP'95, Proc. Second Workshop on Algebra of Communicating Processes Computing Science Reports CSR 95\/14, 3 Eindhoven University of Technology, Department of Computing Science"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib21","series-title":"CONCUR'96","first-page":"671","article-title":"Refinement in Interworkings","author":"Mauw","year":"1996"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib22","series-title":"SDL'97: Time for Testing \u2013 SDL, MSC and Trends, Proc. 8th SDL Forum","first-page":"291","article-title":"High-level Message Sequence Charts","author":"Mauw","year":"1997"},{"issue":"17","key":"10.1016\/B978-044482830-9\/50037-0_bib23","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1016\/S1389-1286(99)00060-2","article-title":"Operational semantics for MSC96","volume":"31","author":"Mauw","year":"1999","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib24","article-title":"Syntax and semantics of synchronous Interworkings","author":"Mauw","year":"1992","journal-title":"Technical Report RWB-508-re-92436, Information and Software Technology, Philips Research"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib25","series-title":"SDL'93 \u2013 Using Objects, Proc. 6th SDL Forum","first-page":"167","article-title":"A formal semantics of synchronous Interworkings","author":"Mauw","year":"1993"},{"issue":"3","key":"10.1016\/B978-044482830-9\/50037-0_bib26","first-page":"41","article-title":"A prototype toolset for Interworkings","volume":"51","author":"Mauw","year":"1993","journal-title":"Philips Telecommunication Review"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib27","article-title":"An algebraic semantics of Message Sequence Charts","author":"Reniers","year":"1994","journal-title":"M.S. thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib28","article-title":"Message Sequence Chart: Syntax and semantics","author":"Reniers","year":"1999","journal-title":"Ph.D. thesis, Eindhoven University of Technology"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib29","series-title":"CONCUR'94: Concurrency Theory","first-page":"226","article-title":"Weak sequential composition in process algebras","author":"Rensink","year":"1994"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib30","series-title":"SDL'95 \u2013 with MSC in CASE, Proc. 7th SDL Forum","first-page":"77","article-title":"Message Sequence Chart: Composition techniques versus OO-techniques \u2013 \u2018tema con variazioni\u2019","author":"Rudolph","year":"1995"},{"year":"1999","series-title":"The Unified Modeling Language Reference Manual","author":"Rumbaugh","key":"10.1016\/B978-044482830-9\/50037-0_bib31"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib32","article-title":"Discrete-time process algebra","author":"Vereijken","year":"1997","journal-title":"Ph.D. thesis, Eindhoven University of Technology"},{"key":"10.1016\/B978-044482830-9\/50037-0_bib33","series-title":"Programming Concepts, Methods and Calculi (PROCOMET'94), IFIP Transactions A: Computer Science and Technology 56","first-page":"149","article-title":"A general conservative extension theorem in process algebra","author":"Verhoef","year":"1994"},{"issue":"2","key":"10.1016\/B978-044482830-9\/50037-0_bib34","first-page":"274","article-title":"A congruence theorem for structured operational semantics with predicates and negative premises","volume":"2","author":"Verhoef","year":"1995","journal-title":"Nordic J. Comput."},{"issue":"2","key":"10.1016\/B978-044482830-9\/50037-0_bib35","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0304-3975(96)00250-2","article-title":"The algebra of communicating processes with empty process","volume":"177","author":"Vrancken","year":"1997","journal-title":"Theoret. Comput. Sci."}],"container-title":["Handbook of Process Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444828309500370?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444828309500370?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T08:51:39Z","timestamp":1546505499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780444828309500370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9780444828309"],"references-count":35,"URL":"https:\/\/doi.org\/10.1016\/b978-044482830-9\/50037-0","relation":{},"subject":[],"published":{"date-parts":[[2001]]}}}