{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:27:53Z","timestamp":1761596873601},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3742,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s1571-0661(04)80931-9","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"27-50","source":"Crossref","is-referenced-by-count":5,"title":["Prototyping and Programming with Relations"],"prefix":"10.1016","volume":"44","author":[{"given":"R.","family":"Berghammer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Leoniuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Milanese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-7091-6355-9_3","article-title":"Applications of the RelView system","author":"Behnke","year":"1999","journal-title":"Proc. Workshop on Tool Support for System Specification, Development and Verification, Advances in Computing Science"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0020-0190(89)90197-X","article-title":"Symmetric quotients and domain constructions","volume":"33","author":"Berghammer","year":"1989","journal-title":"Inf. Proc. Letters"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB3","series-title":"Proc. Workshop on Tools and Applications for the Construction and Analysis of Systems (TACAS '96), LNCS 1055","first-page":"49","article-title":"Relation-algebraic analysis of Petri nets with RelView","author":"Berghammer","year":"1996"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Berghammer R., B. von Karger, and A. Wolf, Relation-algebraic derivation of spanning tree algorithms, in: Proc. Internat. Conference on Mathematics of Programm Construction (MPC '98), LNCS 1422, Springer, Berlin (1998), 23\u201343.","DOI":"10.1007\/BFb0054283"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0020-0255(99)00012-2","article-title":"Combining relational algebra and the Dijkstra-Gries method for deriving relational programs","volume":"119","author":"Berghammer","year":"1999","journal-title":"Inf. Sciences"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB6","first-page":"107","article-title":"Modelling sequences within the RelView system","volume":"7","author":"Berghammer","year":"2001","journal-title":"J. of Universal Computer Science"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB7","series-title":"\u201cRelational methods in computer science,\u201d","year":"1997"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB8","series-title":"\u201cIntroduction to algorithms,\u201d","author":"Cormen","year":"1990"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","article-title":"Hierarchical orderings of sequential processes","volume":"1","author":"Dijkstra","year":"1971","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB10","series-title":"\u201cA discipline of programming,\u201d","author":"Dijkstra","year":"1976"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB11","series-title":"\u201cThe science of computer programming,\u201d","author":"Gries","year":"1981"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB12","unstructured":"Hack M., Analysis of production schemata by Petri nets, Report TR-94, MIT-MAC, 1972."},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB13","series-title":"Proc. Internat. Congress of Mathematicians","first-page":"1407","article-title":"The computational complexity of counting","author":"Jerrum","year":"1994"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB14","doi-asserted-by":"crossref","unstructured":"Maddux R.D., Relation algebras, in: [7], 22\u201338.","DOI":"10.1007\/978-3-7091-6510-2_2"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB15","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB16","series-title":"\u201cPetri nets - An introduction\u201d","author":"Reisig","year":"1985"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB17","unstructured":"Schmidt G., and T. Str\u00f6hlein, \u201cRelations and graphs. Discrete mathematics for computer scientists\u201d, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1993."},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB18","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","article-title":"On the calculus of relations","volume":"6","author":"Tarski","year":"1941","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S1571-0661(04)80931-9_NEWBIB19","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","article-title":"A theorem on Boolean matrices","volume":"9","author":"Warshall","year":"1962","journal-title":"J. ACM"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104809319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104809319?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:55:50Z","timestamp":1549173350000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104809319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S1571066104809319"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80931-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}