Skip to content

Commit a418687

Browse files
editorialboteditorialbot
authored
Merge pull request #5490 from openjournals/joss.06491
Merging automatically
2 parents 9982ec4 + 2726482 commit a418687

File tree

3 files changed

+1020
-0
lines changed

3 files changed

+1020
-0
lines changed

‎joss.06491/10.21105.joss.06491.crossref.xml

Lines changed: 372 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,372 @@
1+
<?xml version="1.0" encoding="UTF-8"?>
2+
<doi_batch xmlns="http://www.crossref.org/schema/5.3.1"
3+
xmlns:ai="http://www.crossref.org/AccessIndicators.xsd"
4+
xmlns:rel="http://www.crossref.org/relations.xsd"
5+
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
6+
version="5.3.1"
7+
xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schemas/crossref5.3.1.xsd">
8+
<head>
9+
<doi_batch_id>20240611190811-19352221ae12757c5d206110e1ffb95a740d5e19</doi_batch_id>
10+
<timestamp>20240611190811</timestamp>
11+
<depositor>
12+
<depositor_name>JOSS Admin</depositor_name>
13+
<email_address>[email protected]</email_address>
14+
</depositor>
15+
<registrant>The Open Journal</registrant>
16+
</head>
17+
<body>
18+
<journal>
19+
<journal_metadata>
20+
<full_title>Journal of Open Source Software</full_title>
21+
<abbrev_title>JOSS</abbrev_title>
22+
<issn media_type="electronic">2475-9066</issn>
23+
<doi_data>
24+
<doi>10.21105/joss</doi>
25+
<resource>https://joss.theoj.org</resource>
26+
</doi_data>
27+
</journal_metadata>
28+
<journal_issue>
29+
<publication_date media_type="online">
30+
<month>06</month>
31+
<year>2024</year>
32+
</publication_date>
33+
<journal_volume>
34+
<volume>9</volume>
35+
</journal_volume>
36+
<issue>98</issue>
37+
</journal_issue>
38+
<journal_article publication_type="full_text">
39+
<titles>
40+
<title>BiGGer: A Model Transformation Tool written in Java for
41+
Bigraph Rewriting in GrGen.NET</title>
42+
</titles>
43+
<contributors>
44+
<person_name sequence="first" contributor_role="author">
45+
<given_name>Dominik</given_name>
46+
<surname>Grzelak</surname>
47+
<ORCID>https://orcid.org/0000-0001-6334-2356</ORCID>
48+
</person_name>
49+
</contributors>
50+
<publication_date>
51+
<month>06</month>
52+
<day>11</day>
53+
<year>2024</year>
54+
</publication_date>
55+
<pages>
56+
<first_page>6491</first_page>
57+
</pages>
58+
<publisher_item>
59+
<identifier id_type="doi">10.21105/joss.06491</identifier>
60+
</publisher_item>
61+
<ai:program name="AccessIndicators">
62+
<ai:license_ref applies_to="vor">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
63+
<ai:license_ref applies_to="am">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
64+
<ai:license_ref applies_to="tdm">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
65+
</ai:program>
66+
<rel:program>
67+
<rel:related_item>
68+
<rel:description>Software archive</rel:description>
69+
<rel:inter_work_relation relationship-type="references" identifier-type="doi">10.5281/zenodo.11565998</rel:inter_work_relation>
70+
</rel:related_item>
71+
<rel:related_item>
72+
<rel:description>GitHub review issue</rel:description>
73+
<rel:inter_work_relation relationship-type="hasReview" identifier-type="uri">https://github.com/openjournals/joss-reviews/issues/6491</rel:inter_work_relation>
74+
</rel:related_item>
75+
</rel:program>
76+
<doi_data>
77+
<doi>10.21105/joss.06491</doi>
78+
<resource>https://joss.theoj.org/papers/10.21105/joss.06491</resource>
79+
<collection property="text-mining">
80+
<item>
81+
<resource mime_type="application/pdf">https://joss.theoj.org/papers/10.21105/joss.06491.pdf</resource>
82+
</item>
83+
</collection>
84+
</doi_data>
85+
<citation_list>
86+
<citation key="steinberg_EMFEclipseModeling_2008">
87+
<volume_title>EMF: Eclipse modeling framework</volume_title>
88+
<author>Steinberg</author>
89+
<isbn>978-0-321-33188-5</isbn>
90+
<cYear>2008</cYear>
91+
<unstructured_citation>Steinberg, D., Budinsky, F., &amp;
92+
Paternostro, M. (2008). EMF: Eclipse modeling framework (2nd Revised
93+
edition). Addison-Wesley Professional.
94+
ISBN: 978-0-321-33188-5</unstructured_citation>
95+
</citation>
96+
<citation key="milner_SpaceMotionCommunicating_2009">
97+
<volume_title>The space and motion of communicating
98+
agents</volume_title>
99+
<author>Milner</author>
100+
<isbn>978-0-521-73833-0</isbn>
101+
<cYear>2009</cYear>
102+
<unstructured_citation>Milner, R. (2009). The space and
103+
motion of communicating agents (1st ed.). Cambridge University Press.
104+
ISBN: 978-0-521-73833-0</unstructured_citation>
105+
</citation>
106+
<citation key="milner_EmbeddingsContextsLink_2005">
107+
<article_title>Embeddings and contexts for link
108+
graphs</article_title>
109+
<author>Milner</author>
110+
<journal_title>Formal methods in software and systems
111+
modeling: Essays dedicated to Hartmut Ehrig on the occasion of his 60th
112+
birthday</journal_title>
113+
<doi>10.1007/978-3-540-31847-7_20</doi>
114+
<isbn>978-3-540-31847-7</isbn>
115+
<cYear>2005</cYear>
116+
<unstructured_citation>Milner, R. (2005). Embeddings and
117+
contexts for link graphs. In H.-J. Kreowski, U. Montanari, F. Orejas, G.
118+
Rozenberg, &amp; G. Taentzer (Eds.), Formal methods in software and
119+
systems modeling: Essays dedicated to Hartmut Ehrig on the occasion of
120+
his 60th birthday (pp. 343–351). Springer.
121+
https://doi.org/10.1007/978-3-540-31847-7_20</unstructured_citation>
122+
</citation>
123+
<citation key="ehrig_BigraphsMeetDouble_2004">
124+
<article_title>Bigraphs meet double pushouts</article_title>
125+
<author>Ehrig</author>
126+
<journal_title>Current trends in theoretical computer
127+
science</journal_title>
128+
<doi>10.1142/9789812562494_0038</doi>
129+
<isbn>978-981-238-783-7</isbn>
130+
<cYear>2004</cYear>
131+
<unstructured_citation>Ehrig, H. (2004). Bigraphs meet
132+
double pushouts. In Current trends in theoretical computer science (Vol.
133+
1–0, pp. 27–40). World Scientific.
134+
https://doi.org/10.1142/9789812562494_0038</unstructured_citation>
135+
</citation>
136+
<citation key="ehrig_FundamentalsAlgebraicGraph_2006">
137+
<volume_title>Fundamentals of algebraic graph
138+
transformation</volume_title>
139+
<author>Ehrig</author>
140+
<doi>10.1007/3-540-31188-2</doi>
141+
<isbn>978-3-540-31187-4</isbn>
142+
<cYear>2006</cYear>
143+
<unstructured_citation>Ehrig, H., Ehrig, K., Prange, U.,
144+
&amp; Taentzer, G. (2006). Fundamentals of algebraic graph
145+
transformation. Springer-Verlag.
146+
https://doi.org/10.1007/3-540-31188-2</unstructured_citation>
147+
</citation>
148+
<citation key="chiapperini_ComputingEmbeddingsDirected_2020">
149+
<article_title>Computing embeddings of directed
150+
bigraphs</article_title>
151+
<author>Chiapperini</author>
152+
<journal_title>Graph transformation</journal_title>
153+
<doi>10.1007/978-3-030-51372-6_3</doi>
154+
<isbn>978-3-030-51372-6</isbn>
155+
<cYear>2020</cYear>
156+
<unstructured_citation>Chiapperini, A., Miculan, M., &amp;
157+
Peressotti, M. (2020). Computing embeddings of directed bigraphs. In F.
158+
Gadducci &amp; T. Kehrer (Eds.), Graph transformation (pp. 38–56).
159+
Springer International Publishing.
160+
https://doi.org/10.1007/978-3-030-51372-6_3</unstructured_citation>
161+
</citation>
162+
<citation key="gassara_ExecutingBigraphicalReactive_2019">
163+
<article_title>Executing bigraphical reactive
164+
systems</article_title>
165+
<author>Gassara</author>
166+
<journal_title>Discrete Applied Mathematics</journal_title>
167+
<volume>253</volume>
168+
<doi>10.1016/j.dam.2018.07.006</doi>
169+
<issn>0166-218X</issn>
170+
<cYear>2019</cYear>
171+
<unstructured_citation>Gassara, A., Bouassida Rodriguez, I.,
172+
Jmaiel, M., &amp; Drira, K. (2019). Executing bigraphical reactive
173+
systems. Discrete Applied Mathematics, 253, 73–92.
174+
https://doi.org/10.1016/j.dam.2018.07.006</unstructured_citation>
175+
</citation>
176+
<citation key="grzelak_BigraphicalDomainspecificLanguage_2021">
177+
<article_title>Bigraphical Domain-specific Language (BDSL):
178+
User Manual</article_title>
179+
<author>Grzelak</author>
180+
<cYear>2021</cYear>
181+
<unstructured_citation>Grzelak, D. (2021). Bigraphical
182+
Domain-specific Language (BDSL): User Manual [Report]. Technische
183+
Universität Dresden.
184+
https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-752170</unstructured_citation>
185+
</citation>
186+
<citation key="geiss_GrGenFastSPOBased_2006">
187+
<article_title>GrGen: A fast SPO-based graph rewriting
188+
tool</article_title>
189+
<author>Geiß</author>
190+
<journal_title>Graph transformations</journal_title>
191+
<doi>10.1007/11841883_27</doi>
192+
<isbn>978-3-540-38872-2</isbn>
193+
<cYear>2006</cYear>
194+
<unstructured_citation>Geiß, R., Batz, G. V., Grund, D.,
195+
Hack, S., &amp; Szalkowski, A. (2006). GrGen: A fast SPO-based graph
196+
rewriting tool. In A. Corradini, H. g, U. Montanari, L. Ribeiro, &amp;
197+
G. Rozenberg (Eds.), Graph transformations (pp. 383–397). Springer
198+
Berlin Heidelberg.
199+
https://doi.org/10.1007/11841883_27</unstructured_citation>
200+
</citation>
201+
<citation key="jakumeit_GrGenNETUser_2023">
202+
<article_title>The GrGen.NET user manual: Refers to
203+
GrGen.NET release 6.7</article_title>
204+
<author>Jakumeit</author>
205+
<cYear>2023</cYear>
206+
<unstructured_citation>Jakumeit, E., Blomer, J., &amp; Geiß,
207+
R. (2023). The GrGen.NET user manual: Refers to GrGen.NET release 6.7.
208+
https://www.grgen.de/GrGenNET-Manual.pdf</unstructured_citation>
209+
</citation>
210+
<citation key="varro_BenchmarkingGraphTransformation_2005">
211+
<article_title>Benchmarking for graph
212+
transformation</article_title>
213+
<author>Varro</author>
214+
<journal_title>2005 IEEE symposium on visual languages and
215+
human-centric computing (VL/HCC’05)</journal_title>
216+
<doi>10.1109/VLHCC.2005.23</doi>
217+
<isbn>978-0-7695-2443-6</isbn>
218+
<cYear>2005</cYear>
219+
<unstructured_citation>Varro, G., Schurr, A., &amp; Varro,
220+
D. (2005). Benchmarking for graph transformation. 2005 IEEE Symposium on
221+
Visual Languages and Human-Centric Computing (VL/HCC’05), 79–88.
222+
https://doi.org/10.1109/VLHCC.2005.23</unstructured_citation>
223+
</citation>
224+
<citation key="geiss_ImprovementsVarroBenchmark_2007">
225+
<article_title>On improvements of the Varró benchmark for
226+
graph transformation tools</article_title>
227+
<author>Geiß</author>
228+
<volume>2007</volume>
229+
<doi>10.5445/IR/1000007369</doi>
230+
<issn>1432-7864</issn>
231+
<cYear>2007</cYear>
232+
<unstructured_citation>Geiß, R., &amp; Kroll, M. (2007). On
233+
improvements of the Varró benchmark for graph transformation tools (No.
234+
7; Interner Bericht. Fakultät Für Informatik, Universität Karlsruhe,
235+
Vol. 2007). Universität Karlsruhe (TH).
236+
https://doi.org/10.5445/IR/1000007369</unstructured_citation>
237+
</citation>
238+
<citation key="sevegnani_SATBasedAlgorithm_2010">
239+
<article_title>A SAT based algorithm for the matching
240+
problem in bigraphs with sharing</article_title>
241+
<author>Sevegnani</author>
242+
<cYear>2010</cYear>
243+
<unstructured_citation>Sevegnani, M., Unsworth, C., &amp;
244+
Calder, M. (2010). A SAT based algorithm for the matching problem in
245+
bigraphs with sharing (Technical Report TR-2010-311; p. 27). Department
246+
of Computing Science, University of Glasgow.</unstructured_citation>
247+
</citation>
248+
<citation key="miculan_CSPImplementationBigraph_2014">
249+
<article_title>A CSP implementation of the bigraph embedding
250+
problem</article_title>
251+
<author>Miculan</author>
252+
<cYear>2014</cYear>
253+
<unstructured_citation>Miculan, M., &amp; Peressotti, M.
254+
(2014). A CSP implementation of the bigraph embedding problem.
255+
http://arxiv.org/abs/1412.1042</unstructured_citation>
256+
</citation>
257+
<citation key="grzelak_BigraphEcoreMetamodel_2023">
258+
<article_title>Bigraph ecore metamodel (BEM): An
259+
EMOF-compliant specification for bigraphs</article_title>
260+
<author>Grzelak</author>
261+
<cYear>2023</cYear>
262+
<unstructured_citation>Grzelak, D. (2023). Bigraph ecore
263+
metamodel (BEM): An EMOF-compliant specification for bigraphs.
264+
https://zenodo.org/records/10043063</unstructured_citation>
265+
</citation>
266+
<citation key="kehrer_EMOFCompliantAbstractSyntax_2016">
267+
<article_title>An EMOF-compliant abstract syntax for
268+
bigraphs</article_title>
269+
<author>Kehrer</author>
270+
<journal_title>Electronic Proceedings in Theoretical
271+
Computer Science</journal_title>
272+
<volume>231</volume>
273+
<doi>10.4204/EPTCS.231.2</doi>
274+
<issn>2075-2180</issn>
275+
<cYear>2016</cYear>
276+
<unstructured_citation>Kehrer, T., Tsigkanos, C., &amp;
277+
Ghezzi, C. (2016). An EMOF-compliant abstract syntax for bigraphs.
278+
Electronic Proceedings in Theoretical Computer Science, 231, 16–30.
279+
https://doi.org/10.4204/EPTCS.231.2</unstructured_citation>
280+
</citation>
281+
<citation key="bacci_FindingForestTree_2014">
282+
<article_title>Finding a forest in a tree</article_title>
283+
<author>Bacci</author>
284+
<journal_title>Trustworthy global computing</journal_title>
285+
<doi>10.1007/978-3-662-45917-1_2</doi>
286+
<isbn>978-3-662-45917-1</isbn>
287+
<cYear>2014</cYear>
288+
<unstructured_citation>Bacci, G., Miculan, M., &amp; Rizzi,
289+
R. (2014). Finding a forest in a tree. In M. Maffei &amp; E. Tuosto
290+
(Eds.), Trustworthy global computing (pp. 17–33). Springer Berlin
291+
Heidelberg.
292+
https://doi.org/10.1007/978-3-662-45917-1_2</unstructured_citation>
293+
</citation>
294+
<citation key="birkedal_MatchingBigraphs_2007">
295+
<article_title>Matching of bigraphs</article_title>
296+
<author>Birkedal</author>
297+
<journal_title>Electronic Notes in Theoretical Computer
298+
Science</journal_title>
299+
<issue>4</issue>
300+
<volume>175</volume>
301+
<doi>10.1016/j.entcs.2007.04.013</doi>
302+
<issn>1571-0661</issn>
303+
<cYear>2007</cYear>
304+
<unstructured_citation>Birkedal, L., Damgaard, T. C.,
305+
Glenstrup, A. J., &amp; Milner, R. (2007). Matching of bigraphs.
306+
Electronic Notes in Theoretical Computer Science, 175(4), 3–19.
307+
https://doi.org/10.1016/j.entcs.2007.04.013</unstructured_citation>
308+
</citation>
309+
<citation key="damgaard_InductiveCharacterizationMatching_2013">
310+
<article_title>An inductive characterization of matching in
311+
binding bigraphs</article_title>
312+
<author>Damgaard</author>
313+
<journal_title>Formal Aspects of Computing</journal_title>
314+
<issue>2</issue>
315+
<volume>25</volume>
316+
<doi>10.1007/s00165-011-0184-5</doi>
317+
<issn>1433-299X</issn>
318+
<cYear>2013</cYear>
319+
<unstructured_citation>Damgaard, T. C., Glenstrup, A. J.,
320+
Birkedal, L., &amp; Milner, R. (2013). An inductive characterization of
321+
matching in binding bigraphs. Formal Aspects of Computing, 25(2),
322+
257–288.
323+
https://doi.org/10.1007/s00165-011-0184-5</unstructured_citation>
324+
</citation>
325+
<citation key="bacci_DBtkToolkitDirected_2009">
326+
<article_title>DBtk: A toolkit for directed
327+
bigraphs</article_title>
328+
<author>Bacci</author>
329+
<journal_title>Proceedings of the 3rd international
330+
conference on algebra and coalgebra in computer science</journal_title>
331+
<doi>10.1007/978-3-642-03741-2_28</doi>
332+
<isbn>978-3-642-03740-5</isbn>
333+
<cYear>2009</cYear>
334+
<unstructured_citation>Bacci, G., Grohmann, D., &amp;
335+
Miculan, M. (2009). DBtk: A toolkit for directed bigraphs. Proceedings
336+
of the 3rd International Conference on Algebra and Coalgebra in Computer
337+
Science, 413–422.
338+
https://doi.org/10.1007/978-3-642-03741-2_28</unstructured_citation>
339+
</citation>
340+
<citation key="sevegnani_BigraphERRewritingAnalysis_2016">
341+
<article_title>BigraphER: Rewriting and analysis engine for
342+
bigraphs</article_title>
343+
<author>Sevegnani</author>
344+
<journal_title>28th international conference on computer
345+
aided verification</journal_title>
346+
<volume>9780</volume>
347+
<doi>10.1007/978-3-319-41540-6_27</doi>
348+
<isbn>978-3-319-41540-6</isbn>
349+
<cYear>2016</cYear>
350+
<unstructured_citation>Sevegnani, M., &amp; Calder, M.
351+
(2016). BigraphER: Rewriting and analysis engine for bigraphs. In S.
352+
Chaudhuri &amp; A. Farzan (Eds.), 28th international conference on
353+
computer aided verification (Vol. 9780, pp. 494–501). Springer
354+
International Publishing.
355+
https://doi.org/10.1007/978-3-319-41540-6_27</unstructured_citation>
356+
</citation>
357+
<citation key="ISO19508_2014">
358+
<article_title>ISO/IEC 19508:2014 Information technology -
359+
Object Management Group Meta Object Facility (MOF) Core</article_title>
360+
<author>ISO/IEC 19508:2014</author>
361+
<cYear>2014</cYear>
362+
<unstructured_citation>ISO/IEC 19508:2014. (2014). ISO/IEC
363+
19508:2014 Information technology - Object Management Group Meta Object
364+
Facility (MOF) Core [ISO/IEC Standard]. International Organization for
365+
Standardization (ISO).
366+
https://www.iso.org/standard/61844.html</unstructured_citation>
367+
</citation>
368+
</citation_list>
369+
</journal_article>
370+
</journal>
371+
</body>
372+
</doi_batch>

‎joss.06491/10.21105.joss.06491.pdf

216 KB
Binary file not shown.

0 commit comments

Comments
 (0)