{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:03:00Z","timestamp":1725494580985},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427872"},{"type":"electronic","value":"9783540455103"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45510-8_5","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T21:12:16Z","timestamp":1194297136000},"page":"125-152","source":"Crossref","is-referenced-by-count":12,"title":["HMSCs as Partial Specifications...with PNs as Completions"],"prefix":"10.1007","author":[{"given":"Benoit","family":"Caillaud","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Darondeau","sequence":"additional","affiliation":[]},{"given":"Lo\u00efc","family":"H\u00e9lou\u00ebt","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Lesventes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,16]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"Proc. Concur","author":"R. Alur","year":"1999","unstructured":"Alur, R., Yannakakis, M.: Model Checking of Message Sequence Charts. Proc. Concur, LNCS 1664 (1999) 114\u2013129"},{"key":"5_CR2","unstructured":"Badouel, E., Caillaud, B., Darondeau, Ph.: Distributing Finite Automata through Petri Net Synthesis. (draft available from the authors)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner Studienb\u00fccher, Stuttgart (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"5_CR4","unstructured":"Caillaud, B.: Bounded Petri Net Synthesis Techniques and their Applications to the Distribution of Reactive Automata. JESA 9-10 no.33 (1999) 925\u2013942"},{"key":"5_CR5","unstructured":"Damm, W., Harel, D.: LCSs: Breathing Life into Message Sequence Charts. Report CS98\/09, Weizmann Institute of Technology (1998)"},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BFb0055646","volume-title":"Proc. Concur","author":"Ph. Darondeau","year":"1998","unstructured":"Darondeau, Ph.: Deriving Unbounded Petri Nets from Formal Languages. Proc. Concur, LNCS 1466 (1998) 533\u2013548"},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-44988-4_2","volume-title":"Proc. ICATPN","author":"Ph. Darondeau","year":"2000","unstructured":"Darondeau, Ph.: Region Based Synthesis of P\/T-Nets and its Potential Applications. Proc. ICATPN, LNCS 1825 (2000) 16\u201323"},{"key":"5_CR8","unstructured":"Diekert, V., M\u00e9tivier, Y.: Partial Commutation and Traces. Research report 1996\/02, Universit\u00e4t Stuttgart Fakult\u00e4t Informatik (1996)"},{"volume-title":"The Book of Traces","year":"1995","key":"5_CR9","unstructured":"Diekert, V., Rozenberg, G. (editors): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"Eilenberg, S., Sch\u00fctzenberger, M.: Rational Sets in Commutative Monoids. Journal of Algebra 13 (1969) 173\u2013191","journal-title":"Journal of Algebra"},{"key":"5_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0017477","volume-title":"Proc. Caap","author":"J. Esparza","year":"1994","unstructured":"Esparza, J.: On the Decidability of Model-checking for several mu-calculi and Petri Nets. Proc. Caap, LNCS 787 (1994) 115\u2013129"},{"key":"5_CR12","unstructured":"Fischer, P.C., Rosenberg, A.L.: Multitape One-Way Nonwriting Automata. JCSS 2 (1968) 88\u2013101"},{"key":"5_CR13","unstructured":"Harel, D., Kugler, H.: Synthesizing State-Based Object Systems from LSC Specifications. Report MCS99\/20, Weizmann Institute of Technology (1999)"},{"key":"5_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Proc. Icalp","author":"J.G. Henriksen","year":"2000","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: On Message Sequence Graphs and Finitely Generated Regular MSC Languages. Proc. Icalp, LNCS 1853 (2000) 675\u2013686"},{"key":"5_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-44612-5_36","volume-title":"Proc. MFCS","author":"J.G. Henriksen","year":"2000","unstructured":"Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Regular Collections of Message Sequence Charts. Proc. MFCS, LNCS 1893 (2000) 405\u2013414"},{"key":"5_CR16","unstructured":"TU-TS Recommendation Z.120: Message Sequence Chart 1996 (MSC96). Technical Report, ITU-TS, Geneva (1996)"},{"key":"5_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-60218-6_26","volume-title":"Proc. Concur","author":"P. Jancar","year":"1995","unstructured":"Jancar, P., Moeller, F.: Checking Regular Properties of Petri Nets, Proc. Concur, LNCS 962 (1995) 348\u2013362"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Mauw, S., Reniers, M.A., High-Level Message Sequence Charts. Proc. Eighth SDL Forum, Elsevier Science Publishers B.V. (1997) 291\u2013306","DOI":"10.1016\/B978-044482816-3\/50020-4"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"Mayr, E.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing 13 (1984) 441\u2013460","journal-title":"SIAM Journal on Computing"},{"key":"5_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/3-540-44618-4_37","volume-title":"Proc. Concur","author":"M. Mukund","year":"2000","unstructured":"Mukund, M., Narayan Kumar, K., Sohoni, M.: Synthesizing distributed finite-state systems from MSCs. Proc. Concur, LNCS 1877 (2000) 521\u2013535"},{"key":"5_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BFb0053553","volume-title":"Proc. Fossacs","author":"A. Muscholl","year":"1998","unstructured":"Muscholl, A., Peled, D., Su, Z.: Deciding Properties for Message Sequence Charts. Proc. Fossacs, LNCS 1378 (1998) 226\u2013242"},{"key":"5_CR22","series-title":"Lect Notes Comput Sci","first-page":"373","volume-title":"Proc. Stacs","author":"E. Pelz","year":"1987","unstructured":"Pelz, E.: Closure Properties of Deterministic Petri Nets. Proc. Stacs, LNCS 247 (1987) 373\u2013382"},{"key":"5_CR23","first-page":"1","volume":"13","author":"J.L. Peterson","year":"1976","unstructured":"Peterson, J.L.: Computation Sequence Sets. JCSS 13 (1976) 1\u201324","journal-title":"Computation Sequence Sets"},{"key":"5_CR24","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching Time and Abstraction in Bisimulation Semantics. Proc. IFIP Congress, North Holland \/ IFIP (1989) 613\u2013618"}],"container-title":["Lecture Notes in Computer Science","Modeling and Verification of Parallel Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45510-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T19:18:10Z","timestamp":1551035890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45510-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427872","9783540455103"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45510-8_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}