default search action
Search dblp for Publications
export results for "toc:db/journals/scp/scp183.bht:"
@article{DBLP:journals/scp/DuranRS19, author = {Francisco Dur{\'{a}}n and Camilo Rocha and Gwen Sala{\"{u}}n}, title = {A rewriting logic approach to resource allocation analysis in business process models}, journal = {Sci. Comput. Program.}, volume = {183}, year = {2019}, url = {https://doi.org/10.1016/j.scico.2019.102303}, doi = {10.1016/J.SCICO.2019.102303}, timestamp = {Mon, 28 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scp/DuranRS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scp/KappeLAT19, author = {Tobias Kapp{\'{e}} and Benjamin Lion and Farhad Arbab and Carolyn L. Talcott}, title = {Soft component automata: Composition, compilation, logic, and verification}, journal = {Sci. Comput. Program.}, volume = {183}, year = {2019}, url = {https://doi.org/10.1016/j.scico.2019.08.001}, doi = {10.1016/J.SCICO.2019.08.001}, timestamp = {Fri, 27 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scp/KappeLAT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/scp/TiganeKBBB19, author = {Samir Tigane and La{\"{\i}}d Kahloul and Saber Benharzallah and Souheib Baarir and Samir Bourekkache}, title = {Reconfigurable GSPNs: {A} modeling formalism of evolvable discrete-event systems}, journal = {Sci. Comput. Program.}, volume = {183}, year = {2019}, url = {https://doi.org/10.1016/j.scico.2019.102302}, doi = {10.1016/J.SCICO.2019.102302}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/scp/TiganeKBBB19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.