references.bib

@article{LOUNIS2018135,
title = "Stochastic-based Semantics Of Attack-Defense Trees For Security Assessment",
journal = "Electronic Notes in Theoretical Computer Science",
volume = "337",
pages = "135 - 154",
year = "2018",
note = "Proceedings of the Ninth International Workshop on the Practical Application of Stochastic Modelling (PASM)",
issn = "1571-0661",
doi = "https://doi.org/10.1016/j.entcs.2018.03.038",
url = "http://www.sciencedirect.com/science/article/pii/S1571066118300422",
author = "Karim Lounis",
keywords = "Graphical Security Models, Attack-Defense Trees, Attack-trees, Security Assessments, CTMCs, Stochastic Petri-nets",
abstract = "Losses caused by cyber-attacks are considerably increasing each year. The need for an optimal security assessment methodology that combines mathematical foundations with practical and user-friendly representations has become imperatively crucial. In this paper, we propose a stochastic security assessment methodology that adopts attack-defense trees model to represent security scenarios, and stochastic models to perform both qualitative and quantitative assessment. We illustrate our approach with a simple but realistic example study."
}

@article{2013CaCA,
journal = {Computing and Networking (CANDAR), 2013 First International Symposium on},
isbn = {1-4799-2795-3},
year = {2013},
title = {Convertibility and Conversion Algorithm of Well-Structured Workflow Net to Process Tree},
month = {December},
}

@article{Pudar:2009:PPM:2639527.2639705,
 author = {Pudar, Srdjan and Manimaran, G. and Liu, Chen-Ching},
 title = {PENET: A Practical Method and Tool for Integrated Modeling of Security Attacks and Countermeasures},
 journal = {Comput. Secur.},
 issue_date = {November, 2009},
 volume = {28},
 number = {8},
 month = nov,
 year = {2009},
 issn = {0167-4048},
 pages = {754--771},
 numpages = {18},
 url = {http://dx.doi.org/10.1016/j.cose.2009.05.007},
 doi = {10.1016/j.cose.2009.05.007},
 acmid = {2639705},
 publisher = {Elsevier Advanced Technology Publications},
 address = {Oxford, UK, UK},
 keywords = {Attack Modeling, Attack trees, Computer security, Cyber security, Petri nets, Software development, Survivability},
} 
@article{Schneier1999,
title = "Attack Trees",
journal = "Dr. Dobb's Journal",
volume = "",
pages = "",
year = "1999",
issn = "",
doi = "",
url = "https://www.schneier.com/academic/archives/1999/12/attack_trees.html",
author = "Bruce Schneier",
keywords = "",
abstract = ""
}

@article{KORDY20141,
title = "DAG-based attack and defense modeling: Don’t miss the forest for the attack trees",
journal = "Computer Science Review",
volume = "13-14",
pages = "1 - 38",
year = "2014",
issn = "1574-0137",
doi = "https://doi.org/10.1016/j.cosrev.2014.07.001",
url = "http://www.sciencedirect.com/science/article/pii/S1574013714000100",
author = "Barbara Kordy and Ludovic Piètre-Cambacédès and Patrick Schweitzer",
keywords = "Graphical models for security, Attack trees, Bayesian networks, Attack and defense modeling, Quantitative and qualitative security assessment, Security measures",
abstract = "This paper presents the current state of the art on attack and defense modeling approaches that are based on directed acyclic graphs (DAGs). DAGs allow for a hierarchical decomposition of complex scenarios into simple, easily understandable and quantifiable actions. Methods based on threat trees and Bayesian networks are two well-known approaches to security modeling. However there exist more than 30 DAG-based methodologies, each having different features and goals. The objective of this survey is to summarize the existing methodologies, compare their features, and propose a taxonomy of the described formalisms. This article also supports the selection of an adequate modeling technique depending on user requirements."
}
@article{city8206,
          volume = {2},
          number = {4},
          author = {T. Chen and J. C. Sanchez-Aarnoutse and J. Buford},
            note = {{\copyright} 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.},
           title = {Petri net modeling of cyber-physical attacks on smart grid},
             doi = {10.1109/TSG.2011.2160000},
         journal = {IEEE Transactions on Smart Grid},
           pages = {741 -- 749},
            year = {2011},
        keywords = {Coordinated attack, cyber-physical systems, Petri net, smart grid},
             url = {http://openaccess.city.ac.uk/8206/},
        abstract = {This paper investigates the use of Petri nets for modeling coordinated cyber-physical attacks on the smart grid. Petri nets offer more flexibility and expressiveness than traditional attack trees to represent the actions of simultaneous attackers. However, Petri net models for attacks on very large critical infrastructures such as the smart grid require a great amount of manual effort and detailed expertise in cyber-physical threats. To overcome these obstacles, we propose a novel hierarchical method to construct large Petri nets from a number of smaller Petri nets that can be created separately by different domain experts. The construction method is facilitated by a model description language that enables identical places in different Petri nets to be matched. The new modeling approach is described for an example attack on smart meters, and its efficacy is demonstrated by a proof-of-concept Python program.}
}


@inproceedings{McDermott:2001:ANP:366173.366183,
 author = {McDermott, J. P.},
 title = {Attack Net Penetration Testing},
 booktitle = {Proceedings of the 2000 Workshop on New Security Paradigms},
 series = {NSPW '00},
 year = {2000},
 isbn = {1-58113-260-3},
 location = {Ballycotton, County Cork, Ireland},
 pages = {15--21},
 numpages = {7},
 url = {http://doi.acm.org/10.1145/366173.366183},
 doi = {10.1145/366173.366183},
 acmid = {366183},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@ARTICLE{2018arXiv180805415B,
   author = {{Baez}, J.~C. and {Master}, J.},
    title = "{Open Petri Nets}",
  journal = {ArXiv e-prints},
archivePrefix = "arXiv",
   eprint = {1808.05415},
 primaryClass = "math.CT",
 keywords = {Mathematics - Category Theory, Computer Science - Logic in Computer Science},
     year = 2018,
    month = aug,
   adsurl = {http://adsabs.harvard.edu/abs/2018arXiv180805415B},
  adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}

@INPROCEEDINGS{1652085,
author={Dalton and Mills and Colombi and Raines},
booktitle={2006 IEEE Information Assurance Workshop},
title={Analyzing Attack Trees using Generalized Stochastic Petri Nets},
year={2006},
volume={},
number={},
pages={116-123},
keywords={Petri nets;security of data;stochastic processes;generalized stochastic Petri nets;attack trees;graphical representations;attack modeling;Stochastic processes;Petri nets;Tree graphs;Computational modeling;Analytical models;Milling machines;Computer networks;Software;Visualization;Costs},
doi={10.1109/IAW.2006.1652085},
ISSN={},
month={June},}

@article{Lautenbach,
author = {Lautenbach, Kurt and Pinl, Alexander},
year = {2018},
month = {11},
pages = {},
title = {Probability Propagation in Petri Nets}
}
@InProceedings{10.1007/978-3-642-00596-1_25,
author="Abdulla, Parosh Aziz
and Mayr, Richard",
editor="de Alfaro, Luca",
title="Minimal Cost Reachability/Coverability in Priced Timed Petri Nets",
booktitle="Foundations of Software Science and Computational Structures",
year="2009",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="348--363",
abstract="We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non-negative, while even the question of zero-cost coverability is undecidable in the case of general integer costs.",
isbn="978-3-642-00596-1"
}

@book{ZIMMERMANN2008,
title = "Stochastic Discrete Event Systems",
publisher = "Springer Berlin Heidelberg",
year = "1990",
volume = "",
series = "",
address = "",
edition = "1",
month = "",
isbn = "9783540741732",
doi = "",
url = "",
author = "Armin Zimmermann"
}

@article{MESEGUER1990105,
title = "Petri nets are monoids",
journal = "Information and Computation",
volume = "88",
number = "2",
pages = "105 - 155",
year = "1990",
issn = "0890-5401",
doi = "https://doi.org/10.1016/0890-5401(90)90013-8",
url = "http://www.sciencedirect.com/science/article/pii/0890540190900138",
author = "José Meseguer and Ugo Montanari"
}
@article{doi:10.1093/jigpal/jzu010,
author = {Lopes, Bruno and Benevides, Mario and Haeusler, Edward Hermann},
title = {Propositional dynamic logic for Petri nets},
journal = {Logic Journal of the IGPL},
volume = {22},
number = {5},
pages = {721-736},
year = {2014},
doi = {10.1093/jigpal/jzu010},
URL = {http://dx.doi.org/10.1093/jigpal/jzu010},
eprint = {/oup/backfile/content_public/journal/jigpal/22/5/10.1093/jigpal/jzu010/2/jzu010.pdf}
}
@article{LOPES201467,
title = "Extending Propositional Dynamic Logic for Petri Nets",
journal = "Electronic Notes in Theoretical Computer Science",
volume = "305",
pages = "67 - 83",
year = "2014",
note = "Proceedings of the 8th Workshop on Logical and Semantic Frameworks (LSFA)",
issn = "1571-0661",
doi = "https://doi.org/10.1016/j.entcs.2014.06.006",
url = "http://www.sciencedirect.com/science/article/pii/S1571066114000528",
author = "Bruno Lopes and Mario Benevides and Edward Hermann Haeusler",
keywords = "Dynamic Logic, Petri Nets, Stochastic Petri Nets, program verification"
}
@inproceedings{Benton:2018:SEC:3236950.3236975,
 author = {Benton, Nick},
 title = {Semantic Equivalence Checking for HHVM Bytecode},
 booktitle = {Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming},
 series = {PPDP '18},
 year = {2018},
 isbn = {978-1-4503-6441-6},
 location = {Frankfurt am Main, Germany},
 pages = {3:1--3:8},
 articleno = {3},
 numpages = {8},
 url = {http://doi.acm.org/10.1145/3236950.3236975},
 doi = {10.1145/3236950.3236975},
 acmid = {3236975},
 publisher = {ACM},
 address = {New York, NY, USA},
} 
@unpublished{soton261825,
          volume = {72},
           title = {On the Algebraic Structure of Petri Nets},
          author = {V. Sassone},
            year = {2000},
           pages = {133--148},
         journal = {Bulletin of the European Association for Theoretical Computer Science},
        keywords = {petri nets, processes of petri nets, compositional petri nets, petri nets calculi, categorical semantics},
             url = {https://eprints.soton.ac.uk/261825/},
        abstract = {This paper retraces, collects, and summarises the contributions of the author --- both individually and in collaboration with others --- on the theme of algebraic, compositional approaches to the semantics of Petri nets.}
}
@article{BRUNI2001207,
title = "Functorial Models for Petri Nets",
journal = "Information and Computation",
volume = "170",
number = "2",
pages = "207 - 236",
year = "2001",
issn = "0890-5401",
doi = "https://doi.org/10.1006/inco.2001.3050",
url = "http://www.sciencedirect.com/science/article/pii/S0890540101930500",
author = "Roberto Bruni and José Meseguer and Ugo Montanari and Vladimiro Sassone"
}
@article{SASSONE1996277,
title = "An axiomatization of the algebra of Petri net concatenable processes",
journal = "Theoretical Computer Science",
volume = "170",
number = "1",
pages = "277 - 296",
year = "1996",
issn = "0304-3975",
doi = "https://doi.org/10.1016/S0304-3975(96)80709-2",
url = "http://www.sciencedirect.com/science/article/pii/S0304397596807092",
author = "Vladimiro Sassone"
}
@InProceedings{10.1007/3-540-44988-4_6,
author="Best, Eike
and Wimmel, Harro",
editor="Nielsen, Mogens
and Simpson, Dan",
title="Reducing k-Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets",
booktitle="Application and Theory of Petri Nets 2000",
year="2000",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="63--82",
abstract="It is a well-known fact that for every k-safe Petri net, i.e. a Petri net in which no place contains more than k ∈ ℕ tokens under any reachable marking, there is a 1-safe Petri net with the same interleaving behaviour. Indeed these types of Petri nets generate regular languages. In this paper, we show that this equivalence of k-safe and 1-safe Petri nets holds also for their pomset languages, a true-concurrency semantics.",
isbn="978-3-540-44988-1"
}
@InProceedings{10.1007/3-540-60218-6_13,
author="Nielsen, Mogens
and Priese, Lutz
and Sassone, Vladimiro",
editor="Lee, Insup
and Smolka, Scott A.",
title="Characterizing behavioural congruences for Petri nets",
booktitle="CONCUR '95: Concurrency Theory",
year="1995",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="175--189",
abstract="IDEA OF STARTING PLACE AND ENDING TRANSITION We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising from four simple notions of behaviour, viz., traces, maximal traces, step, and maximal step traces, and from the corresponding four notions of bisimulation, viz., weak and weak step bisimulation and their maximal versions. We characterize such congruences via universal contexts and via games, providing in such a way an understanding of their discerning powers.",
isbn="978-3-540-44738-2"
}