{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T06:27:11Z","timestamp":1672381631963},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T00:00:00Z","timestamp":1218499200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Innovations Syst Softw Eng"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s11334-008-0064-1","type":"journal-article","created":{"date-parts":[[2008,8,11]],"date-time":"2008-08-11T10:06:51Z","timestamp":1218449211000},"page":"285-292","source":"Crossref","is-referenced-by-count":21,"title":["Extending statecharts with process algebra operators"],"prefix":"10.1007","volume":"4","author":[{"given":"Marc","family":"Frappier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Gervais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9gine","family":"Laleau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beno\u00eet","family":"Fraikin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"St-Denis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,12]]},"reference":[{"key":"64_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-book: assigning programs to meanings","author":"JR Abrial","year":"1996","unstructured":"Abrial JR (1996) The B-book: assigning programs to meanings. Cambridge University Press, Cambridge"},{"key":"64_CR2","volume-title":"Theories of abstract automata","author":"M Arbib","year":"1969","unstructured":"Arbib M (1969) Theories of abstract automata. Prentice-Hall, Englewood Cliffs"},{"issue":"1","key":"64_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"JA Bergstra","year":"1984","unstructured":"Bergstra JA, Klop JW (1984) Process algebra for synchronous communication. Inf Control 60(1): 109\u2013137","journal-title":"Inf Control"},{"issue":"1","key":"64_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","volume":"14","author":"T Bolognesi","year":"1987","unstructured":"Bolognesi T, Brinksma E (1987) Introduction to the ISO specification language LOTOS. Comput Netw ISDN Syst 14(1): 25\u201359","journal-title":"Comput Netw ISDN Syst"},{"key":"64_CR5","unstructured":"Bontemps Y, Saval G, Heymans P, Schobbens PY (2006) From interaction diagrams to state machines: moving to class-level. In: AFADL 2006. ENST Technical Reports, Paris"},{"key":"64_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-18216-7","volume-title":"Abstract state machines: a method for high-level system design and analysis","author":"E Boerger","year":"2003","unstructured":"Boerger E, Staerk R (2003) Abstract state machines: a method for high-level system design and analysis. Springer, Heidelberg"},{"key":"64_CR7","doi-asserted-by":"crossref","unstructured":"Broy M, Wirsing M (2000) Algebraic state machines. In: AMAST 2000. LNCS, vol 1816. Springer, Heidelberg, pp 89\u2013118","DOI":"10.1007\/3-540-45499-3_9"},{"issue":"1","key":"64_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/A:1011227529550","volume":"19","author":"W Damn","year":"2001","unstructured":"Damn W, Harel D (2001) LSCs: Breathing life into message sequence charts. Form Methods Syst Des 19(1): 45\u201380","journal-title":"Form Methods Syst Des"},{"key":"64_CR9","first-page":"153","volume-title":"Handbook on architectures of information systems","author":"J Desharnais","year":"2006","unstructured":"Desharnais J, Frappier M, Mili A (2006) State transition diagrams. In: Bernus P, Mertins K, Schmidt G(eds) Handbook on architectures of information systems, 2nd edn. Springer, Heidelberg, pp 153\u2013172","edition":"2"},{"issue":"9","key":"64_CR10","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/32.713325","volume":"24","author":"J Desharnais","year":"1998","unstructured":"Desharnais J, Frappier M, Kh\u00e9dri R, Mili A (1998) Integration of sequential scenarios. IEEE Trans Softw Eng 24(9): 695\u2013708","journal-title":"IEEE Trans Softw Eng"},{"key":"64_CR11","doi-asserted-by":"crossref","unstructured":"Fraikin B, Frappier M (2007) Efficient symbolic execution of large quantifications in a process algebra. In: 9th International Conference on Formal Engineering Methods (ICFEM 2007). LNCS, vol 4789. Springer, Heidelberg, pp 327\u2013344","DOI":"10.1007\/978-3-540-76650-6_19"},{"key":"64_CR12","unstructured":"Fraikin B, Frappier M. Efficient symbolic execution of process expressions. Sci Comput Program (submitted, 2008)"},{"key":"64_CR13","unstructured":"Frappier M, Gervais F, Laleau R, Fraikin B (2008) Algebraic state transition diagrams. Technical Report 24, D\u00e9partement d\u2019informatique, Universit\u00e9 de Sherbrooke, http:\/\/www.dmi.usherb.ca\/~frappier\/Papers\/astd2008.pdf"},{"issue":"2","key":"64_CR14","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s10270-003-0024-z","volume":"2","author":"M Frappier","year":"2003","unstructured":"Frappier M, St-Denis R (2003) EB3: an entity-based black-box specification method for information systems. Softw Syst Model 2(2): 134\u2013149","journal-title":"Softw Syst Model"},{"key":"64_CR15","first-page":"13","volume":"4","author":"H Garavel","year":"2002","unstructured":"Garavel H, Lang F, Mateescu R (2002) An overview of CADP 2001, european association for software science and technology (EASST). Newsletter 4: 13\u201324","journal-title":"Newsletter"},{"issue":"3","key":"64_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D Harel","year":"1987","unstructured":"Harel D (1987) Statecvharts: a visual formalism for complex systems. Sci Comput Program 8(3): 231\u2013274","journal-title":"Sci Comput Program"},{"issue":"4","key":"64_CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/235321.235322","volume":"5","author":"D Harel","year":"1996","unstructured":"Harel D, Naamad A (1996) The STATEMATE semantics of statecharts. ACM Trans Soft Eng Meth 5(4): 293\u2013333","journal-title":"ACM Trans Soft Eng Meth"},{"key":"64_CR18","volume-title":"Communicating sequential processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare CAR (1985) Communicating sequential processes. Prentice-Hall, Englewood Cliffs"},{"key":"64_CR19","doi-asserted-by":"crossref","unstructured":"L\u00fcttgen G, von der Beeck M, Cleaveland R (1999) Statecharts via process algebra. In: CONCUR\u201999. LNCS, vol 1664. Springer, Heidelberg, pp 399\u2013414","DOI":"10.1007\/3-540-48320-9_28"},{"key":"64_CR20","unstructured":"Maraninchi F (1989) Argonaute: graphical description, semantics and verification of reactive systems by using a process algebra. In: Automatic verification methods for finite state systems. LNCS, vol 407. Springer, Heidelberg, pp 38\u201353"},{"key":"64_CR21","volume-title":"Communication and concurrency, international series in computer science","author":"R Milner","year":"1989","unstructured":"Milner R (1989) Communication and concurrency, international series in computer science. Prentice-Hall, Englewood Cliffs"},{"key":"64_CR22","unstructured":"Object Management Group. OMG unified modeling language V2.1.2, http:\/\/www.omg.org"},{"key":"64_CR23","volume-title":"The theory and practice of concurrency, amended 2005","author":"BAW Roscoe","year":"1998","unstructured":"Roscoe BAW (1998) The theory and practice of concurrency, amended 2005, 3rd edn. Prentice-Hall, Englewood Cliffs","edition":"3"},{"key":"64_CR24","doi-asserted-by":"crossref","unstructured":"Wirsing M (1990) Algebraic Specification. In: Handbook of theoretical computer science, vol. B. North Holland, New York, pp 675\u2013788","DOI":"10.1016\/B978-0-444-88074-1.50018-4"},{"key":"64_CR25","volume-title":"Using Z, specification, refinement and proof","author":"J Woodcock","year":"1996","unstructured":"Woodcock J, Davies J (1996) Using Z, specification, refinement and proof. Prentice-Hall, Englewood Cliffs"},{"key":"64_CR26","doi-asserted-by":"crossref","unstructured":"Woodcock J, Cavalcanti A (2002). The semantics of circus, in zb 2002: formal specification and development in Z and B. LNCS, vol 2272. Springer, Heidelberg, pp 184\u2013203","DOI":"10.1007\/3-540-45648-1_10"}],"container-title":["Innovations in Systems and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-008-0064-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11334-008-0064-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-008-0064-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:47:44Z","timestamp":1559396864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11334-008-0064-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,12]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1007\/s11334-008-0064-1","relation":{},"ISSN":["1614-5046","1614-5054"],"issn-type":[{"value":"1614-5046","type":"print"},{"value":"1614-5054","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,12]]}}}