iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/978-3-642-29072-5_4
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:47:03Z","timestamp":1725670023755},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642290718"},{"type":"electronic","value":"9783642290725"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29072-5_4","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T18:18:02Z","timestamp":1332440282000},"page":"96-120","source":"Crossref","is-referenced-by-count":11,"title":["Refinement and Asynchronous Composition of Modal Petri Nets"],"prefix":"10.1007","author":[{"given":"Dorsaf","family":"Elhog-Benzina","sequence":"first","affiliation":[]},{"given":"Serge","family":"Haddad","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Hennicker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-45449-7_11","volume-title":"Embedded Software","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface Theories for Component-Based Design. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol.\u00a02211, pp. 148\u2013165. Springer, Heidelberg (2001)"},{"key":"4_CR2","first-page":"83","volume-title":"NATO Science Series: Mathematics, Physics, and Chemistry","author":"L. Alfaro de","year":"2005","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface-based Design. In: NATO Science Series: Mathematics, Physics, and Chemistry, vol.\u00a0195, pp. 83\u2013104. Springer, Heidelberg (2005)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-78499-9_9","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Antonik","year":"2008","unstructured":"Antonik, A., Huth, M., Larsen, K.G., Nyman, U., Wasowski, A.: Complexity of Decision Problems for Mixed and Modal Specifications. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 112\u2013126. Springer, Heidelberg (2008)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Antonik, A., Huth, M., Larsen, K.G., Nyman, U., Wasowski, A.: EXPTIME-complete decision problems for mixed and modal specifications. In: Proc. of EXPRESS (July 2008)","DOI":"10.1016\/j.entcs.2009.06.011"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-12002-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Bauer","year":"2010","unstructured":"Bauer, S., Mayer, P., Schroeder, A., Hennicker, R.: On Weak Modal Compatibility, Refinement, and the MIO Workbench. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 175\u2013189. Springer, Heidelberg (2010)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-642-10373-5_35","volume-title":"Formal Methods and Software Engineering","author":"N. Bertrand","year":"2009","unstructured":"Bertrand, N., Legay, A., Pinchinat, S., Raclet, J.-B.: A Compositional Approach on Modal Specifications for Timed Systems. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol.\u00a05885, pp. 679\u2013697. Springer, Heidelberg (2009)"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. JACM\u00a030(2), 323\u2013342 (1983)","journal-title":"JACM"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-21254-3_21","volume-title":"Language and Automata Theory and Applications","author":"B. Delahaye","year":"2011","unstructured":"Delahaye, B., Larsen, K.G., Legay, A., Pedersen, M.L., Wasowski, A.: Decision Problems for Interval Markov Chains. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 274\u2013285. Springer, Heidelberg (2011)"},{"issue":"2","key":"4_CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics\u00a016(2), 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"4_CR10","unstructured":"Hack, M.H.T.: Decidability questions for Petri Nets. Ph.D.Thesis. M.I.T (1976)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.entcs.2009.12.035","volume":"260","author":"R. Hennicker","year":"2010","unstructured":"Hennicker, R., Janisch, S., Knapp, A.: On the Observable Behaviour of Composite Components. Electr. Notes Theor. Comput. Sci.\u00a0260, 125\u2013153 (2010)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-23283-1_11","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2011","author":"R. Hennicker","year":"2011","unstructured":"Hennicker, R., Knapp, A.: Modal Interface Theories for Communication-Safe Component Assemblies. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol.\u00a06916, pp. 135\u2013153. Springer, Heidelberg (2011)"},{"key":"4_CR13","first-page":"147","volume":"4","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. JTSS\u00a04, 147\u2013195 (1969)","journal-title":"JTSS"},{"issue":"4","key":"4_CR14","first-page":"541","volume":"88","author":"V. Khomenko","year":"2008","unstructured":"Khomenko, V., Schaefer, M., Vogler, W.: Output-Determinacy and Asynchronous Circuit Synthesis. Fundam. Inf.\u00a088(4), 541\u2013579 (2008)","journal-title":"Fundam. Inf."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-52148-8_19","volume-title":"Automatic Verification Methods for Finite State Systems","author":"K.G. Larsen","year":"1990","unstructured":"Larsen, K.G.: Modal Specifications. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 232\u2013246. Springer, Heidelberg (1990)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-74407-8_8","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"K.G. Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: On Modal Refinement and Consistency. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 105\u2013119. Springer, Heidelberg (2007)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-71316-6_6","volume-title":"Programming Languages and Systems","author":"K.G. Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., Wasowski, A.: Modal I\/O Automata for Interface and Product Line Theories. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 64\u201379. Springer, Heidelberg (2007)"},{"key":"4_CR18","unstructured":"Larsen, K.G., Thomsen, B.: A modal process logic. In: Third Annual IEEE Symposium on Logic in Computer Science LICS, pp. 203\u2013210 (1988)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. In: Proc. 13th Annual ACM Symp. on Theor. of Computing (STOC 1981), pp. 238\u2013246 (1981)","DOI":"10.1145\/800076.802477"},{"key":"4_CR20","unstructured":"Milner, R.: Communication and concurrency. Prentice Hall (1989)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BFb0039620","volume-title":"STACS 87","author":"E. Pelz","year":"1987","unstructured":"Pelz, E.: Closure Properties of Deterministic Petri Net Languages. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol.\u00a0247, pp. 373\u2013382. Springer, Heidelberg (1987)"},{"volume-title":"Petri net theory and the modeling of systems","year":"1981","author":"J.L. Peterson","key":"4_CR22","unstructured":"Peterson, J.L.: Petri net theory and the modeling of systems. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"4_CR23","unstructured":"Raclet, J.-B.: Quotient de sp\u00e9cifications pour la r\u00e9utilisation de composants. PhD Thesis, Ecole doctorale Matisse, Universit\u00e9 de Rennes 1, IRISA (December 2007)"},{"key":"4_CR24","unstructured":"Raclet, J.-B.: Residual for Component Specifications. In: Proc. of the 4th International Workshop on Formal Aspects of Component Software (FACS 2007), Sophia-Antipolis, France (September 2007)"},{"volume-title":"Proc. of 9th International Conference on Embedded Software (EMSOFT 2009)","year":"2009","author":"J.-B. Raclet","key":"4_CR25","unstructured":"Raclet, J.-B., Badouel, E., Benveniste, A., Caillaud, B., Legay, A., Passerone, R.: Modal Interfaces: Unifying Interface Automata and Modal Specifications. In: Proc. of 9th International Conference on Embedded Software (EMSOFT 2009). ACM, Grenoble (2009)"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85289-6","volume-title":"The Common Component Modeling Example","author":"A. Rausch","year":"2008","unstructured":"Rausch, A., Reussner, R., Mirandola, R., Nyman, U., Plasil, F.: The Common Component Modeling Example: Comparing Software Component Models. LNCS, vol.\u00a05153. Springer, Heidelberg (2008)"},{"issue":"9","key":"4_CR27","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.datak.2009.02.012","volume":"68","author":"C. Stahl","year":"2009","unstructured":"Stahl, C., Wolf, K.: Deciding service composition and substitutability using extended operating guidelines. Data Knowl. Eng.\u00a068(9), 819\u2013833 (2009)","journal-title":"Data Knowl. Eng."},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-15204-0_14","volume-title":"Advances in Petri Nets 1984","author":"R. Valk","year":"1985","unstructured":"Valk, R., Jantzen, M.: The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. In: Rozenberg, G. (ed.) APN 1984. LNCS, vol.\u00a0188, pp. 234\u2013258. Springer, Heidelberg (1985)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29072-5_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:21:35Z","timestamp":1620127295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29072-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290718","9783642290725"],"references-count":28,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-29072-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}