Skip to content

Commit

Permalink
Merge pull request #5490 from openjournals/joss.06491
Browse files Browse the repository at this point in the history 
Merging automatically
  • Loading branch information
@editorialbot
editorialbot authored Jun 11, 2024
2 parents 9982ec4 + 2726482 commit a418687
Show file tree
Hide file tree
Showing 3 changed files with 1,020 additions and 0 deletions.
372 changes: 372 additions & 0 deletions joss.06491/10.21105.joss.06491.crossref.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,372 @@
<?xml version="1.0" encoding="UTF-8"?>
<doi_batch xmlns="http://www.crossref.org/schema/5.3.1"
xmlns:ai="http://www.crossref.org/AccessIndicators.xsd"
xmlns:rel="http://www.crossref.org/relations.xsd"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
version="5.3.1"
xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schemas/crossref5.3.1.xsd">
<head>
<doi_batch_id>20240611190811-19352221ae12757c5d206110e1ffb95a740d5e19</doi_batch_id>
<timestamp>20240611190811</timestamp>
<depositor>
<depositor_name>JOSS Admin</depositor_name>
<email_address>[email protected]</email_address>
</depositor>
<registrant>The Open Journal</registrant>
</head>
<body>
<journal>
<journal_metadata>
<full_title>Journal of Open Source Software</full_title>
<abbrev_title>JOSS</abbrev_title>
<issn media_type="electronic">2475-9066</issn>
<doi_data>
<doi>10.21105/joss</doi>
<resource>https://joss.theoj.org</resource>
</doi_data>
</journal_metadata>
<journal_issue>
<publication_date media_type="online">
<month>06</month>
<year>2024</year>
</publication_date>
<journal_volume>
<volume>9</volume>
</journal_volume>
<issue>98</issue>
</journal_issue>
<journal_article publication_type="full_text">
<titles>
<title>BiGGer: A Model Transformation Tool written in Java for
Bigraph Rewriting in GrGen.NET</title>
</titles>
<contributors>
<person_name sequence="first" contributor_role="author">
<given_name>Dominik</given_name>
<surname>Grzelak</surname>
<ORCID>https://orcid.org/0000-0001-6334-2356</ORCID>
</person_name>
</contributors>
<publication_date>
<month>06</month>
<day>11</day>
<year>2024</year>
</publication_date>
<pages>
<first_page>6491</first_page>
</pages>
<publisher_item>
<identifier id_type="doi">10.21105/joss.06491</identifier>
</publisher_item>
<ai:program name="AccessIndicators">
<ai:license_ref applies_to="vor">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="am">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="tdm">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
</ai:program>
<rel:program>
<rel:related_item>
<rel:description>Software archive</rel:description>
<rel:inter_work_relation relationship-type="references" identifier-type="doi">10.5281/zenodo.11565998</rel:inter_work_relation>
</rel:related_item>
<rel:related_item>
<rel:description>GitHub review issue</rel:description>
<rel:inter_work_relation relationship-type="hasReview" identifier-type="uri">https://github.com/openjournals/joss-reviews/issues/6491</rel:inter_work_relation>
</rel:related_item>
</rel:program>
<doi_data>
<doi>10.21105/joss.06491</doi>
<resource>https://joss.theoj.org/papers/10.21105/joss.06491</resource>
<collection property="text-mining">
<item>
<resource mime_type="application/pdf">https://joss.theoj.org/papers/10.21105/joss.06491.pdf</resource>
</item>
</collection>
</doi_data>
<citation_list>
<citation key="steinberg_EMFEclipseModeling_2008">
<volume_title>EMF: Eclipse modeling framework</volume_title>
<author>Steinberg</author>
<isbn>978-0-321-33188-5</isbn>
<cYear>2008</cYear>
<unstructured_citation>Steinberg, D., Budinsky, F., &amp;
Paternostro, M. (2008). EMF: Eclipse modeling framework (2nd Revised
edition). Addison-Wesley Professional.
ISBN: 978-0-321-33188-5</unstructured_citation>
</citation>
<citation key="milner_SpaceMotionCommunicating_2009">
<volume_title>The space and motion of communicating
agents</volume_title>
<author>Milner</author>
<isbn>978-0-521-73833-0</isbn>
<cYear>2009</cYear>
<unstructured_citation>Milner, R. (2009). The space and
motion of communicating agents (1st ed.). Cambridge University Press.
ISBN: 978-0-521-73833-0</unstructured_citation>
</citation>
<citation key="milner_EmbeddingsContextsLink_2005">
<article_title>Embeddings and contexts for link
graphs</article_title>
<author>Milner</author>
<journal_title>Formal methods in software and systems
modeling: Essays dedicated to Hartmut Ehrig on the occasion of his 60th
birthday</journal_title>
<doi>10.1007/978-3-540-31847-7_20</doi>
<isbn>978-3-540-31847-7</isbn>
<cYear>2005</cYear>
<unstructured_citation>Milner, R. (2005). Embeddings and
contexts for link graphs. In H.-J. Kreowski, U. Montanari, F. Orejas, G.
Rozenberg, &amp; G. Taentzer (Eds.), Formal methods in software and
systems modeling: Essays dedicated to Hartmut Ehrig on the occasion of
his 60th birthday (pp. 343–351). Springer.
https://doi.org/10.1007/978-3-540-31847-7_20</unstructured_citation>
</citation>
<citation key="ehrig_BigraphsMeetDouble_2004">
<article_title>Bigraphs meet double pushouts</article_title>
<author>Ehrig</author>
<journal_title>Current trends in theoretical computer
science</journal_title>
<doi>10.1142/9789812562494_0038</doi>
<isbn>978-981-238-783-7</isbn>
<cYear>2004</cYear>
<unstructured_citation>Ehrig, H. (2004). Bigraphs meet
double pushouts. In Current trends in theoretical computer science (Vol.
1–0, pp. 27–40). World Scientific.
https://doi.org/10.1142/9789812562494_0038</unstructured_citation>
</citation>
<citation key="ehrig_FundamentalsAlgebraicGraph_2006">
<volume_title>Fundamentals of algebraic graph
transformation</volume_title>
<author>Ehrig</author>
<doi>10.1007/3-540-31188-2</doi>
<isbn>978-3-540-31187-4</isbn>
<cYear>2006</cYear>
<unstructured_citation>Ehrig, H., Ehrig, K., Prange, U.,
&amp; Taentzer, G. (2006). Fundamentals of algebraic graph
transformation. Springer-Verlag.
https://doi.org/10.1007/3-540-31188-2</unstructured_citation>
</citation>
<citation key="chiapperini_ComputingEmbeddingsDirected_2020">
<article_title>Computing embeddings of directed
bigraphs</article_title>
<author>Chiapperini</author>
<journal_title>Graph transformation</journal_title>
<doi>10.1007/978-3-030-51372-6_3</doi>
<isbn>978-3-030-51372-6</isbn>
<cYear>2020</cYear>
<unstructured_citation>Chiapperini, A., Miculan, M., &amp;
Peressotti, M. (2020). Computing embeddings of directed bigraphs. In F.
Gadducci &amp; T. Kehrer (Eds.), Graph transformation (pp. 38–56).
Springer International Publishing.
https://doi.org/10.1007/978-3-030-51372-6_3</unstructured_citation>
</citation>
<citation key="gassara_ExecutingBigraphicalReactive_2019">
<article_title>Executing bigraphical reactive
systems</article_title>
<author>Gassara</author>
<journal_title>Discrete Applied Mathematics</journal_title>
<volume>253</volume>
<doi>10.1016/j.dam.2018.07.006</doi>
<issn>0166-218X</issn>
<cYear>2019</cYear>
<unstructured_citation>Gassara, A., Bouassida Rodriguez, I.,
Jmaiel, M., &amp; Drira, K. (2019). Executing bigraphical reactive
systems. Discrete Applied Mathematics, 253, 73–92.
https://doi.org/10.1016/j.dam.2018.07.006</unstructured_citation>
</citation>
<citation key="grzelak_BigraphicalDomainspecificLanguage_2021">
<article_title>Bigraphical Domain-specific Language (BDSL):
User Manual</article_title>
<author>Grzelak</author>
<cYear>2021</cYear>
<unstructured_citation>Grzelak, D. (2021). Bigraphical
Domain-specific Language (BDSL): User Manual [Report]. Technische
Universität Dresden.
https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-752170</unstructured_citation>
</citation>
<citation key="geiss_GrGenFastSPOBased_2006">
<article_title>GrGen: A fast SPO-based graph rewriting
tool</article_title>
<author>Geiß</author>
<journal_title>Graph transformations</journal_title>
<doi>10.1007/11841883_27</doi>
<isbn>978-3-540-38872-2</isbn>
<cYear>2006</cYear>
<unstructured_citation>Geiß, R., Batz, G. V., Grund, D.,
Hack, S., &amp; Szalkowski, A. (2006). GrGen: A fast SPO-based graph
rewriting tool. In A. Corradini, H. g, U. Montanari, L. Ribeiro, &amp;
G. Rozenberg (Eds.), Graph transformations (pp. 383–397). Springer
Berlin Heidelberg.
https://doi.org/10.1007/11841883_27</unstructured_citation>
</citation>
<citation key="jakumeit_GrGenNETUser_2023">
<article_title>The GrGen.NET user manual: Refers to
GrGen.NET release 6.7</article_title>
<author>Jakumeit</author>
<cYear>2023</cYear>
<unstructured_citation>Jakumeit, E., Blomer, J., &amp; Geiß,
R. (2023). The GrGen.NET user manual: Refers to GrGen.NET release 6.7.
https://www.grgen.de/GrGenNET-Manual.pdf</unstructured_citation>
</citation>
<citation key="varro_BenchmarkingGraphTransformation_2005">
<article_title>Benchmarking for graph
transformation</article_title>
<author>Varro</author>
<journal_title>2005 IEEE symposium on visual languages and
human-centric computing (VL/HCC’05)</journal_title>
<doi>10.1109/VLHCC.2005.23</doi>
<isbn>978-0-7695-2443-6</isbn>
<cYear>2005</cYear>
<unstructured_citation>Varro, G., Schurr, A., &amp; Varro,
D. (2005). Benchmarking for graph transformation. 2005 IEEE Symposium on
Visual Languages and Human-Centric Computing (VL/HCC’05), 79–88.
https://doi.org/10.1109/VLHCC.2005.23</unstructured_citation>
</citation>
<citation key="geiss_ImprovementsVarroBenchmark_2007">
<article_title>On improvements of the Varró benchmark for
graph transformation tools</article_title>
<author>Geiß</author>
<volume>2007</volume>
<doi>10.5445/IR/1000007369</doi>
<issn>1432-7864</issn>
<cYear>2007</cYear>
<unstructured_citation>Geiß, R., &amp; Kroll, M. (2007). On
improvements of the Varró benchmark for graph transformation tools (No.
7; Interner Bericht. Fakultät Für Informatik, Universität Karlsruhe,
Vol. 2007). Universität Karlsruhe (TH).
https://doi.org/10.5445/IR/1000007369</unstructured_citation>
</citation>
<citation key="sevegnani_SATBasedAlgorithm_2010">
<article_title>A SAT based algorithm for the matching
problem in bigraphs with sharing</article_title>
<author>Sevegnani</author>
<cYear>2010</cYear>
<unstructured_citation>Sevegnani, M., Unsworth, C., &amp;
Calder, M. (2010). A SAT based algorithm for the matching problem in
bigraphs with sharing (Technical Report TR-2010-311; p. 27). Department
of Computing Science, University of Glasgow.</unstructured_citation>
</citation>
<citation key="miculan_CSPImplementationBigraph_2014">
<article_title>A CSP implementation of the bigraph embedding
problem</article_title>
<author>Miculan</author>
<cYear>2014</cYear>
<unstructured_citation>Miculan, M., &amp; Peressotti, M.
(2014). A CSP implementation of the bigraph embedding problem.
http://arxiv.org/abs/1412.1042</unstructured_citation>
</citation>
<citation key="grzelak_BigraphEcoreMetamodel_2023">
<article_title>Bigraph ecore metamodel (BEM): An
EMOF-compliant specification for bigraphs</article_title>
<author>Grzelak</author>
<cYear>2023</cYear>
<unstructured_citation>Grzelak, D. (2023). Bigraph ecore
metamodel (BEM): An EMOF-compliant specification for bigraphs.
https://zenodo.org/records/10043063</unstructured_citation>
</citation>
<citation key="kehrer_EMOFCompliantAbstractSyntax_2016">
<article_title>An EMOF-compliant abstract syntax for
bigraphs</article_title>
<author>Kehrer</author>
<journal_title>Electronic Proceedings in Theoretical
Computer Science</journal_title>
<volume>231</volume>
<doi>10.4204/EPTCS.231.2</doi>
<issn>2075-2180</issn>
<cYear>2016</cYear>
<unstructured_citation>Kehrer, T., Tsigkanos, C., &amp;
Ghezzi, C. (2016). An EMOF-compliant abstract syntax for bigraphs.
Electronic Proceedings in Theoretical Computer Science, 231, 16–30.
https://doi.org/10.4204/EPTCS.231.2</unstructured_citation>
</citation>
<citation key="bacci_FindingForestTree_2014">
<article_title>Finding a forest in a tree</article_title>
<author>Bacci</author>
<journal_title>Trustworthy global computing</journal_title>
<doi>10.1007/978-3-662-45917-1_2</doi>
<isbn>978-3-662-45917-1</isbn>
<cYear>2014</cYear>
<unstructured_citation>Bacci, G., Miculan, M., &amp; Rizzi,
R. (2014). Finding a forest in a tree. In M. Maffei &amp; E. Tuosto
(Eds.), Trustworthy global computing (pp. 17–33). Springer Berlin
Heidelberg.
https://doi.org/10.1007/978-3-662-45917-1_2</unstructured_citation>
</citation>
<citation key="birkedal_MatchingBigraphs_2007">
<article_title>Matching of bigraphs</article_title>
<author>Birkedal</author>
<journal_title>Electronic Notes in Theoretical Computer
Science</journal_title>
<issue>4</issue>
<volume>175</volume>
<doi>10.1016/j.entcs.2007.04.013</doi>
<issn>1571-0661</issn>
<cYear>2007</cYear>
<unstructured_citation>Birkedal, L., Damgaard, T. C.,
Glenstrup, A. J., &amp; Milner, R. (2007). Matching of bigraphs.
Electronic Notes in Theoretical Computer Science, 175(4), 3–19.
https://doi.org/10.1016/j.entcs.2007.04.013</unstructured_citation>
</citation>
<citation key="damgaard_InductiveCharacterizationMatching_2013">
<article_title>An inductive characterization of matching in
binding bigraphs</article_title>
<author>Damgaard</author>
<journal_title>Formal Aspects of Computing</journal_title>
<issue>2</issue>
<volume>25</volume>
<doi>10.1007/s00165-011-0184-5</doi>
<issn>1433-299X</issn>
<cYear>2013</cYear>
<unstructured_citation>Damgaard, T. C., Glenstrup, A. J.,
Birkedal, L., &amp; Milner, R. (2013). An inductive characterization of
matching in binding bigraphs. Formal Aspects of Computing, 25(2),
257–288.
https://doi.org/10.1007/s00165-011-0184-5</unstructured_citation>
</citation>
<citation key="bacci_DBtkToolkitDirected_2009">
<article_title>DBtk: A toolkit for directed
bigraphs</article_title>
<author>Bacci</author>
<journal_title>Proceedings of the 3rd international
conference on algebra and coalgebra in computer science</journal_title>
<doi>10.1007/978-3-642-03741-2_28</doi>
<isbn>978-3-642-03740-5</isbn>
<cYear>2009</cYear>
<unstructured_citation>Bacci, G., Grohmann, D., &amp;
Miculan, M. (2009). DBtk: A toolkit for directed bigraphs. Proceedings
of the 3rd International Conference on Algebra and Coalgebra in Computer
Science, 413–422.
https://doi.org/10.1007/978-3-642-03741-2_28</unstructured_citation>
</citation>
<citation key="sevegnani_BigraphERRewritingAnalysis_2016">
<article_title>BigraphER: Rewriting and analysis engine for
bigraphs</article_title>
<author>Sevegnani</author>
<journal_title>28th international conference on computer
aided verification</journal_title>
<volume>9780</volume>
<doi>10.1007/978-3-319-41540-6_27</doi>
<isbn>978-3-319-41540-6</isbn>
<cYear>2016</cYear>
<unstructured_citation>Sevegnani, M., &amp; Calder, M.
(2016). BigraphER: Rewriting and analysis engine for bigraphs. In S.
Chaudhuri &amp; A. Farzan (Eds.), 28th international conference on
computer aided verification (Vol. 9780, pp. 494–501). Springer
International Publishing.
https://doi.org/10.1007/978-3-319-41540-6_27</unstructured_citation>
</citation>
<citation key="ISO19508_2014">
<article_title>ISO/IEC 19508:2014 Information technology -
Object Management Group Meta Object Facility (MOF) Core</article_title>
<author>ISO/IEC 19508:2014</author>
<cYear>2014</cYear>
<unstructured_citation>ISO/IEC 19508:2014. (2014). ISO/IEC
19508:2014 Information technology - Object Management Group Meta Object
Facility (MOF) Core [ISO/IEC Standard]. International Organization for
Standardization (ISO).
https://www.iso.org/standard/61844.html</unstructured_citation>
</citation>
</citation_list>
</journal_article>
</journal>
</body>
</doi_batch>
Binary file added joss.06491/10.21105.joss.06491.pdf
View file
Binary file not shown.
Loading

0 comments on commit a418687

Please sign in to comment.