1140 lines
37 KiB
BibTeX
1140 lines
37 KiB
BibTeX
@phdthesis{Petri66,
|
||
author = {Carl Adam Petri},
|
||
title = {Communication with automata},
|
||
school = {Universit\"at Hamburg},
|
||
year = {1966},
|
||
address = {},
|
||
language = {eng},
|
||
}
|
||
|
||
@ARTICLE{Petri:2008,
|
||
AUTHOR = {Petri, C. Adam and Reisig, W. },
|
||
TITLE = {{P}etri net},
|
||
YEAR = 2008,
|
||
JOURNAL = {Scholarpedia},
|
||
VOLUME = 3,
|
||
NUMBER = 4,
|
||
PAGES = 6477,
|
||
NOTE = {{revision \#91646}},
|
||
}
|
||
|
||
@incollection{Petri:1980,
|
||
year={1980},
|
||
isbn={978-3-540-10001-0},
|
||
booktitle={Net Theory and Applications},
|
||
volume={84},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Brauer, Wilfried},
|
||
doi={10.1007/3-540-10001-6_21},
|
||
title={Introduction to general net theory},
|
||
url={http://dx.doi.org/10.1007/3-540-10001-6_21},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Petri, C.A.},
|
||
pages={1-19},
|
||
language={English}
|
||
}
|
||
|
||
@article {FIPY:2005,
|
||
title = {Matrix Languages, Register Machines, Vector Addition Systems},
|
||
journal = {Third Brainstorming Week on Membrane Computing},
|
||
year = {2005},
|
||
month = {1/31//05-2/4/05},
|
||
pages = {155-167},
|
||
publisher = {F{\'e}nix Editora},
|
||
address = {Sevilla, Espa{\~n}a},
|
||
isbn = {84-609-6771-9},
|
||
author = {Rudolf Freund and Oscar Ibarra and Gheorghe P\u aun and Hsu-Chun Yen},
|
||
editor = {M. A. Guti{\'e}rrez Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
|
||
}
|
||
|
||
@INPROCEEDINGS{Leroux:2009,
|
||
author={Leroux, J\'er\^ome},
|
||
booktitle={Logic In Computer Science, 2009. LICS '09. 24th Annual IEEE Symposium on},
|
||
title={The General Vector Addition System Reachability Problem by Presburger Inductive Invariants},
|
||
year={2009},
|
||
month={Aug},
|
||
pages={4-13},
|
||
keywords={Petri nets;arithmetic;decidability;formal languages;reachability analysis;set theory;vectors;Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition;Parikh images;Presburger arithmetic;Presburger inductive invariant;decidability;finite sequence;general vector addition system reachability problem;net theory;Arithmetic;Computer science;Concurrent computing;Lattices;Logic;Petri nets;Upper bound;Zinc;Invariant;Linear;Petri Net;Presburger;Reachability;VAS},
|
||
doi={10.1109/LICS.2009.10},
|
||
ISSN={1043-6871},}
|
||
|
||
@article{Buning:1989,
|
||
author = {B\"{u}ning, Hans Kleine and Lettmann, Theodor and Mayr, Ernst W.},
|
||
title = {Projections of Vector Addition System Reachability Sets Are Semilinear},
|
||
journal = {Theoretical Computer Science},
|
||
issue_date = {29 May 1989},
|
||
volume = {64},
|
||
number = {3},
|
||
month = may,
|
||
year = {1989},
|
||
issn = {0304-3975},
|
||
pages = {343--350},
|
||
numpages = {8},
|
||
url = {http://dx.doi.org/10.1016/0304-3975(89)90055-8},
|
||
doi = {10.1016/0304-3975(89)90055-8},
|
||
acmid = {66735},
|
||
publisher = {Elsevier Science Publishers Ltd.},
|
||
address = {Essex, UK},
|
||
}
|
||
|
||
@article{Hopcroft1979135,
|
||
title = "On the reachability problem for 5-dimensional vector addition systems ",
|
||
journal = "Theoretical Computer Science ",
|
||
volume = "8",
|
||
number = "2",
|
||
pages = "135 - 159",
|
||
year = "1979",
|
||
note = "",
|
||
issn = "0304-3975",
|
||
doi = "http://dx.doi.org/10.1016/0304-3975(79)90041-0",
|
||
url = "http://www.sciencedirect.com/science/article/pii/0304397579900410",
|
||
author = "John Hopcroft and Jean-Jacques Pansiot"
|
||
}
|
||
|
||
@article{Greibach1978311,
|
||
title = "Remarks on blind and partially blind one-way multicounter machines ",
|
||
journal = "Theoretical Computer Science ",
|
||
volume = "7",
|
||
number = "3",
|
||
pages = "311 - 324",
|
||
year = "1978",
|
||
note = "",
|
||
issn = "0304-3975",
|
||
doi = "http://dx.doi.org/10.1016/0304-3975(78)90020-8",
|
||
url = "http://www.sciencedirect.com/science/article/pii/0304397578900208",
|
||
author = "Sheila A. Greibach"
|
||
}
|
||
|
||
@incollection{Yen06b,
|
||
author = {Hsu{-}Chun Yen},
|
||
title = {Introduction to {P}etri Net Theory},
|
||
booktitle = {Recent Advances in Formal Languages and Applications},
|
||
pages = {343--373},
|
||
year = {2006},
|
||
crossref = {DBLP:series/sci/2006-25},
|
||
url = {http://dx.doi.org/10.1007/978-3-540-33461-3_14},
|
||
doi = {10.1007/978-3-540-33461-3_14},
|
||
timestamp = {Mon, 10 Mar 2008 15:41:42 +0100},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/series/sci/Yen06b},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@book{DBLP:series/sci/2006-25,
|
||
editor = {Zolt{\'{a}}n {\'{E}}sik and
|
||
Carlos Mart{\'{\i}}n{-}Vide and
|
||
Victor Mitrana},
|
||
title = {Recent Advances in Formal Languages and Applications},
|
||
series = {Studies in Computational Intelligence},
|
||
volume = {25},
|
||
publisher = {Springer},
|
||
year = {2006},
|
||
isbn = {978-3-540-33460-6},
|
||
timestamp = {Mon, 10 Mar 2008 15:41:42 +0100},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/series/sci/2006-25},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@article{Agerwala:1973,
|
||
author = {Agerwala, Tilak and Flynn, Mike},
|
||
title = {Comments on Capabilities, Limitations and ``Correctness'' of {P}etri Nets},
|
||
journal = {SIGARCH Computer Architecture News},
|
||
issue_date = {December 1973},
|
||
volume = {2},
|
||
number = {4},
|
||
month = dec,
|
||
year = {1973},
|
||
issn = {0163-5964},
|
||
pages = {81--86},
|
||
numpages = {6},
|
||
url = {http://doi.acm.org/10.1145/633642.803973},
|
||
doi = {10.1145/633642.803973},
|
||
acmid = {803973},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA},
|
||
}
|
||
|
||
@article{Jensen1981317,
|
||
title = "Coloured {P}etri nets and the invariant-method ",
|
||
journal = "Theoretical Computer Science ",
|
||
volume = "14",
|
||
number = "3",
|
||
pages = "317 - 336",
|
||
year = "1981",
|
||
note = "",
|
||
issn = "0304-3975",
|
||
doi = "http://dx.doi.org/10.1016/0304-3975(81)90049-9",
|
||
url = "http://www.sciencedirect.com/science/article/pii/0304397581900499",
|
||
author = "Kurt Jensen"
|
||
}
|
||
|
||
@phdthesis{Ramchandani:1974,
|
||
author = {Ramchandani, Chander},
|
||
title = {Analysis of Asynchronous Concurrent Systems by Timed {P}etri Nets},
|
||
year = {1974},
|
||
publisher = {Massachusetts Institute of Technology},
|
||
address = {Cambridge, MA, USA},
|
||
}
|
||
|
||
@phdthesis{Hack:1976,
|
||
author = {Hack, Michel},
|
||
title = {Decidability Questions for {P}etri Nets},
|
||
year = {1976},
|
||
publisher = {Massachusetts Institute of Technology},
|
||
address = {Cambridge, MA, USA},
|
||
}
|
||
|
||
@phdthesis{Patil:1970,
|
||
author = {Patil, Suhas Shrikrishna},
|
||
title = {Coordination of Asynchronous Events},
|
||
year = {1970},
|
||
publisher = {Massachusetts Institute of Technology},
|
||
address = {Cambridge, MA, USA},
|
||
}
|
||
|
||
@ARTICLE{Reinhardt08,
|
||
author = {Klaus Reinhardt},
|
||
title = {Reachability in {P}etri Nets with Inhibitor Arcs},
|
||
journal = {Electronic Notes in Theoretical Computer Science},
|
||
year = {2008},
|
||
volume = {223},
|
||
pages = {239-264},
|
||
bibsource = {DBLP, http://dblp.uni-trier.de},
|
||
ee = {http://dx.doi.org/10.1016/j.entcs.2008.12.042}
|
||
}
|
||
|
||
@inproceedings{Mayr:1981,
|
||
author = {Mayr, Ernst W.},
|
||
title = {An Algorithm for the General {P}etri Net Reachability Problem},
|
||
booktitle = {Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing},
|
||
series = {STOC '81},
|
||
year = {1981},
|
||
location = {Milwaukee, Wisconsin, USA},
|
||
pages = {238--246},
|
||
numpages = {9},
|
||
url = {http://doi.acm.org/10.1145/800076.802477},
|
||
doi = {10.1145/800076.802477},
|
||
acmid = {802477},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA},
|
||
keywords = {Decidability, Petri net, Reachability problem, Vector addition system},
|
||
}
|
||
|
||
@ARTICLE{Zaitsev13,
|
||
author = {Dmitry A. Zaitsev},
|
||
title = {A Small Universal {P}etri Net},
|
||
journal = {EPTCS},
|
||
year = {2013},
|
||
volume = {128},
|
||
pages = {190-202},
|
||
note = {In Proceedings of Machines, Computations and Universality (MCU 2013),
|
||
arXiv:1309.1043},
|
||
owner = {ver},
|
||
timestamp = {2013.09.17}
|
||
}
|
||
|
||
@ARTICLE{Zaitsev2012,
|
||
author = {Dmitry A. Zaitsev},
|
||
title = {Universal {P}etri Net},
|
||
journal = {Cybernetics and Systems Analysis},
|
||
year = {2012},
|
||
volume = {48},
|
||
pages = {498-511},
|
||
number = {4},
|
||
doi = {10.1007/s10559-012-9429-4},
|
||
issn = {1060-0396},
|
||
keywords = {universal inhibitor Petri net; universal Turing machine; algorithm;
|
||
encoding; control flow},
|
||
language = {English},
|
||
publisher = {Springer US},
|
||
url = {http://dx.doi.org/10.1007/s10559-012-9429-4}
|
||
}
|
||
|
||
@incollection{BGMV2007,
|
||
year={2007},
|
||
isbn={978-3-540-73000-2},
|
||
booktitle={Computation and Logic in the Real World},
|
||
volume={4497},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Cooper, S.Barry and L\"owe, Benedikt and Sorbi, Andrea},
|
||
doi={10.1007/978-3-540-73001-9_5},
|
||
title={Producer/Consumer in Membrane Systems and {P}etri Nets},
|
||
url={http://dx.doi.org/10.1007/978-3-540-73001-9_5},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Bernardini, Francesco and Gheorghe, Marian and Margenstern, Maurice and Verlan, Sergey},
|
||
pages={43--52},
|
||
language={English}
|
||
}
|
||
|
||
@article{Bause1996,
|
||
year={1996},
|
||
issn={0001-5903},
|
||
journal={Acta Informatica},
|
||
volume={33},
|
||
number={5},
|
||
doi={10.1007/BF03036470},
|
||
title={On the analysis of {P}etri nets with static priorities},
|
||
url={http://dx.doi.org/10.1007/BF03036470},
|
||
publisher={Springer-Verlag},
|
||
author={Bause, Falko},
|
||
pages={669-685},
|
||
language={English}
|
||
}
|
||
|
||
@incollection{Bonnet2011,
|
||
year={2011},
|
||
isbn={978-3-642-22992-3},
|
||
booktitle={Mathematical Foundations of Computer Science 2011},
|
||
volume={6907},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Murlak, Filip and Sankowski, Piotr},
|
||
doi={10.1007/978-3-642-22993-0_16},
|
||
title={The Reachability Problem for Vector Addition System with One Zero-Test},
|
||
url={http://dx.doi.org/10.1007/978-3-642-22993-0_16},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Bonnet, R\'emi},
|
||
pages={145-157},
|
||
language={English}
|
||
}
|
||
|
||
@incollection{SF2004,
|
||
year={2004},
|
||
isbn={978-3-540-20895-2},
|
||
booktitle={Membrane Computing},
|
||
volume={2933},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Martín-Vide, Carlos and Mauri, Giancarlo and Păun, Gheorghe and Rozenberg, Grzegorz and Salomaa, Arto},
|
||
doi={10.1007/978-3-540-24619-0_11},
|
||
title={On the Dynamics of {PB} Systems: A {P}etri Net View},
|
||
url={http://dx.doi.org/10.1007/978-3-540-24619-0_11},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Dal Zilio, Silvano and Formenti, Enrico},
|
||
pages={153-167},
|
||
language={English}
|
||
}
|
||
|
||
@article{Bernardini200385,
|
||
title = "Dynamical aspects of {P} systems ",
|
||
journal = "Biosystems ",
|
||
volume = "70",
|
||
number = "2",
|
||
pages = "85 - 93",
|
||
year = "2003",
|
||
note = "Cell Computing ",
|
||
issn = "0303-2647",
|
||
doi = "http://dx.doi.org/10.1016/S0303-2647(03)00032-7",
|
||
url = "http://www.sciencedirect.com/science/article/pii/S0303264703000327",
|
||
author = "Francesco Bernardini and Vincenzo Manca",
|
||
keywords = "P systems",
|
||
keywords = "Membrane systems",
|
||
keywords = "Dynamical systems",
|
||
keywords = "Biological models",
|
||
keywords = "Periodicity",
|
||
keywords = "Almost periodicity "
|
||
}
|
||
|
||
@InCollection{Schroeppel1972,
|
||
Title = {A Two Counter Machine Cannot Calculate 2{N}},
|
||
Author = {Rich Schroeppel},
|
||
Booktitle = {AI Memos},
|
||
Publisher = {MIT AI Lab},
|
||
Year = {1972},
|
||
Language = {English},
|
||
Url = {http://hdl.handle.net/1721.1/6202}
|
||
}
|
||
|
||
@inproceedings{Kosaraju:1982,
|
||
author = {Kosaraju, S. Rao},
|
||
title = {Decidability of Reachability in Vector Addition Systems (Preliminary Version)},
|
||
booktitle = {Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing},
|
||
series = {STOC '82},
|
||
year = {1982},
|
||
isbn = {0-89791-070-2},
|
||
location = {San Francisco, California, USA},
|
||
pages = {267--281},
|
||
numpages = {15},
|
||
url = {http://doi.acm.org/10.1145/800070.802201},
|
||
doi = {10.1145/800070.802201},
|
||
acmid = {802201},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA},
|
||
}
|
||
|
||
@article{Lambert199279,
|
||
title = "A structure to decide reachability in {P}etri nets ",
|
||
journal = "Theoretical Computer Science ",
|
||
volume = "99",
|
||
number = "1",
|
||
pages = "79 - 104",
|
||
year = "1992",
|
||
note = "",
|
||
issn = "0304-3975",
|
||
doi = "http://dx.doi.org/10.1016/0304-3975(92)90173-D",
|
||
url = "http://www.sciencedirect.com/science/article/pii/030439759290173D",
|
||
author = "J.L. Lambert"
|
||
}
|
||
|
||
@incollection{Leroux2011,
|
||
year={2011},
|
||
isbn={978-3-642-21253-6},
|
||
booktitle={Language and Automata Theory and Applications},
|
||
volume={6638},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Dediu, Adrian-Horia and Inenaga, Shunsuke and Martín-Vide, Carlos},
|
||
doi={10.1007/978-3-642-21254-3_3},
|
||
title={Vector Addition System Reachability Problem: A Short Self-contained Proof},
|
||
url={http://dx.doi.org/10.1007/978-3-642-21254-3_3},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Leroux, J\'er\^ome},
|
||
pages={41-64},
|
||
language={English}
|
||
}
|
||
|
||
@Article{Barzdin,
|
||
Title = {Ob odnom klasse machin {T}uringa (machiny {M}inskogo), Russian},
|
||
Author = {Ian M. Barzdin},
|
||
Journal = {Algebra i Logika},
|
||
Year = {1963},
|
||
Pages = {42--51},
|
||
Volume = {1},
|
||
|
||
Owner = {ver},
|
||
Timestamp = {2013.09.16}
|
||
}
|
||
|
||
@article{Lambek61,
|
||
title={How to Program an Infinite Abacus},
|
||
author={Joachim Lambek},
|
||
journal={Canadian Mathematical Bulletin},
|
||
year={1961},
|
||
pages={295--302},
|
||
volume={4},
|
||
doi={10.4153/CMB-1961-032-6}
|
||
}
|
||
|
||
@article{Melzak61,
|
||
title={An informal arithmetical approach to computability and computation},
|
||
author={Zdzislaw Melzak},
|
||
journal={Canadian Mathematical Bulletin},
|
||
year={1961},
|
||
pages={279--293},
|
||
volume={4}
|
||
}
|
||
|
||
@incollection{FPRA:2006,
|
||
year={2006},
|
||
isbn={978-3-540-30948-2},
|
||
booktitle={Membrane Computing},
|
||
volume={3850},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Freund, Rudolf and Păun, Gheorghe and Rozenberg, Grzegorz and Salomaa, Arto},
|
||
doi={10.1007/11603047_20},
|
||
title={Towards a {P}etri Net Semantics for Membrane Systems},
|
||
url={http://dx.doi.org/10.1007/11603047_20},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Kleijn, Jetty H.C.M. and Koutny, Maciej and Rozenberg, Grzegorz},
|
||
pages={292-309},
|
||
language={English}
|
||
}
|
||
|
||
@incollection{KK2006,
|
||
year={2006},
|
||
isbn={978-3-540-69088-7},
|
||
booktitle={Membrane Computing},
|
||
volume={4361},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Hoogeboom, Hendrik Jan and Păun, Gheorghe and Rozenberg, Grzegorz and Salomaa, Arto},
|
||
doi={10.1007/11963516_5},
|
||
title={Synchrony and Asynchrony in Membrane Systems},
|
||
url={http://dx.doi.org/10.1007/11963516_5},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Kleijn, Jetty and Koutny, Maciej},
|
||
pages={66-85},
|
||
language={English}
|
||
}
|
||
|
||
@article{FH:2013,
|
||
year={2013},
|
||
issn={1567-7818},
|
||
journal={Natural Computing},
|
||
volume={12},
|
||
number={4},
|
||
doi={10.1007/s11047-013-9367-8},
|
||
title={Modeling membrane systems using colored stochastic {P}etri nets},
|
||
url={http://dx.doi.org/10.1007/s11047-013-9367-8},
|
||
publisher={Springer Netherlands},
|
||
keywords={Stochastic membrane systems with active membranes; Colored stochastic Petri nets; Dynamic color sets; Virus infection},
|
||
author={Liu, Fei and Heiner, Monika},
|
||
pages={617-629},
|
||
language={English}
|
||
}
|
||
|
||
@inproceedings{FO06,
|
||
author = {Rudolf Freund and
|
||
Marion Oswald},
|
||
title = {A Small Universal Antiport {P} System with Forbidden Context},
|
||
booktitle = {8th International Workshop on Descriptional Complexity of Formal Systems
|
||
- {DCFS} 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings},
|
||
pages = {259--266},
|
||
year = {2006},
|
||
crossref = {DBLP:conf/dcfs/2006},
|
||
timestamp = {Fri, 21 Oct 2011 14:43:44 +0200},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/dcfs/FreundO06},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@proceedings{DBLP:conf/dcfs/2006,
|
||
editor = {Hing Leung and
|
||
Giovanni Pighizzini},
|
||
title = {8th International Workshop on Descriptional Complexity of Formal Systems
|
||
- {DCFS} 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings},
|
||
publisher = {New Mexico State University, Las Cruces, New Mexico, {USA}},
|
||
year = {2006},
|
||
timestamp = {Fri, 21 Oct 2011 14:42:53 +0200},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/dcfs/2006},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@Article{AV11,
|
||
Title = {Minimization Strategies for Maximally Parallel Multiset Rewriting Systems},
|
||
Author = {Artiom Alhazov and Sergey Verlan},
|
||
Journal = {Theoretical Computer Science},
|
||
Year = {2011},
|
||
Number = {17},
|
||
Pages = {1581 - 1591},
|
||
Volume = {412},
|
||
|
||
Doi = {http://dx.doi.org/10.1016/j.tcs.2010.10.033},
|
||
Url = {http://www.sciencedirect.com/science/article/B6V1G-51C4RWM-1/2/8dd35e3d83efe5552d0d6dfb05e45afc}
|
||
}
|
||
|
||
@incollection{Frisco:2006,
|
||
year={2006},
|
||
isbn={978-3-540-30948-2},
|
||
booktitle={Membrane Computing},
|
||
volume={3850},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Freund, Rudolf and Păun, Gheorghe and Rozenberg, Grzegorz and Salomaa, Arto},
|
||
doi={10.1007/11603047_15},
|
||
title={P Systems, {P}etri Nets, and Program Machines},
|
||
url={http://dx.doi.org/10.1007/11603047_15},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Frisco, Pierluigi},
|
||
pages={209-223},
|
||
language={English}
|
||
}
|
||
|
||
@article{Karp1969147,
|
||
title = "Parallel program schemata ",
|
||
journal = "Journal of Computer and System Sciences ",
|
||
volume = "3",
|
||
number = "2",
|
||
pages = "147 - 195",
|
||
year = "1969",
|
||
note = "",
|
||
issn = "0022-0000",
|
||
doi = "http://dx.doi.org/10.1016/S0022-0000(69)80011-5",
|
||
url = "http://www.sciencedirect.com/science/article/pii/S0022000069800115",
|
||
author = "Richard M. Karp and Raymond E. Miller"
|
||
}
|
||
|
||
@article{KCJ1998,
|
||
year={1998},
|
||
issn={1433-2779},
|
||
journal={International Journal on Software Tools for Technology Transfer},
|
||
volume={2},
|
||
number={2},
|
||
doi={10.1007/s100090050021},
|
||
title={The practitioner’s guide to coloured {P}etri nets},
|
||
url={http://dx.doi.org/10.1007/s100090050021},
|
||
publisher={Springer-Verlag},
|
||
keywords={Key words: High-level Petri nets – Coloured Petri nets – Practical use – Modelling – Validation – Verification – Visualisation – Tool support},
|
||
author={Kristensen, Lars M. and Christensen, Soren and Jensen, Kurt},
|
||
pages={98-132},
|
||
language={English}
|
||
}
|
||
|
||
@incollection{Jensen1991,
|
||
year={1991},
|
||
isbn={978-3-540-53863-9},
|
||
booktitle={Advances in Petri Nets 1990},
|
||
volume={483},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Rozenberg, Grzegorz},
|
||
doi={10.1007/3-540-53863-1_31},
|
||
title={Coloured {P}etri nets: A high level language for system design and analysis},
|
||
url={http://dx.doi.org/10.1007/3-540-53863-1_31},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Jensen, Kurt},
|
||
pages={342-416},
|
||
language={English}
|
||
}
|
||
|
||
@inproceedings{Hack:1974,
|
||
author = {Hack, Michel},
|
||
title = {The Recursive Equivalence of the Reachability Problem and the Liveness Problem for {P}etri Nets and Vector Addition Systems},
|
||
booktitle = {Proceedings of the 15th Annual Symposium on Switching and Automata Theory (Swat 1974)},
|
||
series = {SWAT '74},
|
||
year = {1974},
|
||
pages = {156--164},
|
||
numpages = {9},
|
||
url = {http://dx.doi.org/10.1109/SWAT.1974.28},
|
||
doi = {10.1109/SWAT.1974.28},
|
||
acmid = {1440847},
|
||
publisher = {IEEE Computer Society},
|
||
address = {Washington, DC, USA},
|
||
}
|
||
|
||
@techreport{Keller1972,
|
||
title={Vector Replacement Systems: A Formalism for Modeling Asynchronous Systems},
|
||
author={Keller, Robert M.},
|
||
year={1972},
|
||
publisher={Department of Electrical Engineering Computer Sciences Laboratory Princeton University},
|
||
institution={Computer Science Lab, Princeton University},
|
||
number={117}
|
||
}
|
||
|
||
@article{CavaliereFOS07,
|
||
author = {Matteo Cavaliere and
|
||
Rudolf Freund and
|
||
Marion Oswald and
|
||
Dragos Sburlan},
|
||
title = {Multiset random context grammars, checkers, and transducers},
|
||
journal = {Theoretical Computer Science},
|
||
volume = {372},
|
||
number = {2-3},
|
||
pages = {136--151},
|
||
year = {2007},
|
||
url = {http://dx.doi.org/10.1016/j.tcs.2006.11.022},
|
||
doi = {10.1016/j.tcs.2006.11.022},
|
||
timestamp = {Mon, 26 Feb 2007 12:50:05 +0100},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/journals/tcs/CavaliereFOS07},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@article{BMVPR2002,
|
||
year={2002},
|
||
issn={0001-5903},
|
||
journal={Acta Informatica},
|
||
volume={38},
|
||
number={10},
|
||
doi={10.1007/s00236-002-0090-7},
|
||
title={Membrane systems with promoters/inhibitors},
|
||
url={http://dx.doi.org/10.1007/s00236-002-0090-7},
|
||
publisher={Springer-Verlag},
|
||
author={Bottoni, Paolo and Mart\'in-Vide, Carlos and P\u{a}un, Gheorghe and Rozenberg, Grzegorz},
|
||
pages={695-720},
|
||
language={English}
|
||
}
|
||
|
||
@incollection{IWYZ2005,
|
||
year={2005},
|
||
isbn={978-3-540-28061-3},
|
||
booktitle={Computing and Combinatorics},
|
||
volume={3595},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Wang, Lusheng},
|
||
doi={10.1007/11533719_91},
|
||
title={On Sequential and 1-Deterministic {P} Systems},
|
||
url={http://dx.doi.org/10.1007/11533719_91},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Ibarra, Oscar H. and Woodworth, Sara and Yen, Hsu-Chun and Dang, Zhe},
|
||
pages={905-914},
|
||
language={English}
|
||
}
|
||
|
||
@article{IGY2006,
|
||
author = {Ionescu, Mihai and P\u{a}un, Gheorghe and Yokomori, Takashi},
|
||
title = {Spiking Neural P Systems},
|
||
journal = {Fundam. Inf.},
|
||
issue_date = {August 2006},
|
||
volume = {71},
|
||
number = {2,3},
|
||
month = feb,
|
||
year = {2006},
|
||
issn = {0169-2968},
|
||
pages = {279--308},
|
||
numpages = {30},
|
||
url = {http://dl.acm.org/citation.cfm?id=1227505.1227513},
|
||
acmid = {1227513},
|
||
publisher = {IOS Press},
|
||
address = {Amsterdam, The Netherlands, The Netherlands},
|
||
keywords = {Spiking neurons, Turing computability, membrane computing, semilinear set},
|
||
}
|
||
|
||
@article{Frisco2005,
|
||
author = {Pierluigi Frisco},
|
||
title = {About {P} systems with symport/antiport},
|
||
journal = {Soft Computing},
|
||
volume = {9},
|
||
number = {9},
|
||
pages = {664--672},
|
||
year = {2005},
|
||
url = {http://dx.doi.org/10.1007/s00500-004-0396-1},
|
||
doi = {10.1007/s00500-004-0396-1},
|
||
timestamp = {Fri, 27 Jan 2006 08:38:29 +0100},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/journals/soco/Frisco05},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@incollection{FLMPVZ2014,
|
||
year={2014},
|
||
isbn={978-3-642-54238-1},
|
||
booktitle={Membrane Computing},
|
||
volume={8340},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Alhazov, Artiom and Cojocaru, Svetlana and Gheorghe, Marian and Rogozhin, Yurii and Rozenberg, Grzegorz and Salomaa, Arto},
|
||
doi={10.1007/978-3-642-54239-8_13},
|
||
title={Flattening in (Tissue) {P} Systems},
|
||
url={http://dx.doi.org/10.1007/978-3-642-54239-8_13},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Freund, Rudolf and Leporati, Alberto and Mauri, Giancarlo and Porreca, Antonio E. and Verlan, Sergey and Zandron, Claudio},
|
||
pages={173-188},
|
||
language={English}
|
||
}
|
||
|
||
@incollection{AS2005,
|
||
year={2005},
|
||
isbn={978-3-540-25080-7},
|
||
booktitle={Membrane Computing},
|
||
volume={3365},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Mauri, Giancarlo and P\u{a}un, Gheorghe and P\'erez-Jim\'enez, Mario J. and Rozenberg, Grzegorz and Salomaa, Arto},
|
||
doi={10.1007/978-3-540-31837-8_10},
|
||
title={Ultimately Confluent Rewriting Systems. Parallel Multiset-Rewriting with Permitting or Forbidding Contexts},
|
||
url={http://dx.doi.org/10.1007/978-3-540-31837-8_10},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Alhazov, Artiom and Sburlan, Drago\c{s}},
|
||
pages={178-189},
|
||
language={English}
|
||
}
|
||
|
||
@article{CPPPJ2007117,
|
||
title = "P systems with minimal parallelism ",
|
||
journal = "Theoretical Computer Science ",
|
||
volume = "378",
|
||
number = "1",
|
||
pages = "117 - 130",
|
||
year = "2007",
|
||
note = "",
|
||
issn = "0304-3975",
|
||
doi = "http://dx.doi.org/10.1016/j.tcs.2007.03.044",
|
||
url = "http://www.sciencedirect.com/science/article/pii/S0304397507002459",
|
||
author = "Gabriel Ciobanu and Linqiang Pan and Gheorghe P\u aun and Mario J. P\'erez-Jim\'enez",
|
||
keywords = "Membrane computing",
|
||
keywords = "P System",
|
||
keywords = "Universality",
|
||
keywords = "\{SAT\} Problem "
|
||
}
|
||
|
||
@incollection{Freund2005,
|
||
year={2005},
|
||
isbn={978-3-540-25080-7},
|
||
booktitle={Membrane Computing},
|
||
volume={3365},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Mauri, Giancarlo and Păun, Gheorghe and Pérez-Jiménez, MarioJ. and Rozenberg, Grzegorz and Salomaa, Arto},
|
||
doi={10.1007/978-3-540-31837-8_3},
|
||
title={Asynchronous {P} Systems and {P} Systems Working in the Sequential Mode},
|
||
url={http://dx.doi.org/10.1007/978-3-540-31837-8_3},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Freund, Rudolf},
|
||
pages={36-62},
|
||
language={English}
|
||
}
|
||
|
||
@inproceedings{CS2004,
|
||
author = {Matteo Cavaliere and
|
||
Drago\c{s} Sburlan},
|
||
title = {Time-Independent {P} Systems},
|
||
booktitle = {Membrane Computing, 5th International Workshop, {WMC} 2004, Milan,
|
||
Italy, June 14-16, 2004, Revised Selected and Invited Papers},
|
||
pages = {239--258},
|
||
year = {2004},
|
||
crossref = {DBLP:conf/membrane/2004},
|
||
url = {http://dx.doi.org/10.1007/978-3-540-31837-8_14},
|
||
doi = {10.1007/978-3-540-31837-8_14},
|
||
timestamp = {Mon, 08 Aug 2011 15:22:15 +0200},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/membrane/CavaliereS04},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@proceedings{DBLP:conf/membrane/2004,
|
||
editor = {Giancarlo Mauri and
|
||
Gheorghe P\u{a}un and
|
||
Mario J. P{\'{e}}rez{-}Jim{\'{e}}nez and
|
||
Grzegorz Rozenberg and
|
||
Arto Salomaa},
|
||
title = {Membrane Computing, 5th International Workshop, {WMC} 2004, Milan,
|
||
Italy, June 14-16, 2004, Revised Selected and Invited Papers},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {3365},
|
||
publisher = {Springer},
|
||
year = {2005},
|
||
isbn = {3-540-25080-8},
|
||
timestamp = {Mon, 21 Feb 2005 10:04:47 +0100},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/membrane/2004},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@incollection{Ivanov2012,
|
||
year={2012},
|
||
isbn={978-3-642-28023-8},
|
||
booktitle={Membrane Computing},
|
||
volume={7184},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Gheorghe, Marian and P\u{u}un, Gheorghe and Rozenberg, Grzegorz and Salomaa, Arto and Verlan, Sergey},
|
||
doi={10.1007/978-3-642-28024-5_16},
|
||
title={Basic Concurrency Resolution in Clock-Free {P} Systems},
|
||
url={http://dx.doi.org/10.1007/978-3-642-28024-5_16},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Ivanov, Sergiu},
|
||
pages={226-242},
|
||
language={English}
|
||
}
|
||
|
||
@article{Ivanov2013,
|
||
author = {Ivanov, Sergiu},
|
||
title = {A formal framework for clock-free networks of cells},
|
||
journal = {International Journal of Computer Mathematics},
|
||
volume = {90},
|
||
number = {4},
|
||
pages = {776-788},
|
||
year = {2013},
|
||
doi = {10.1080/00207160.2012.743652}
|
||
}
|
||
|
||
@incollection{Freund2010,
|
||
year={2010},
|
||
isbn={978-3-642-11466-3},
|
||
booktitle={Membrane Computing},
|
||
volume={5957},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={P\u{a}un, Gheorghe and P\'erez-Jim\'enez, Mario J. and Riscos-N\'u\~nez, Agust\'in and Rozenberg, Grzegorz and Salomaa, Arto},
|
||
doi={10.1007/978-3-642-11467-0_3},
|
||
title={Transition and Halting Modes in (Tissue) {P} Systems},
|
||
url={http://dx.doi.org/10.1007/978-3-642-11467-0_3},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Freund, Rudolf},
|
||
pages={18-29},
|
||
language={English}
|
||
}
|
||
|
||
@article{Ibarra2004379,
|
||
title = "Catalytic P systems, semilinear sets, and vector addition systems ",
|
||
journal = "Theoretical Computer Science ",
|
||
volume = "312",
|
||
number = "2–3",
|
||
pages = "379 - 399",
|
||
year = "2004",
|
||
note = "",
|
||
issn = "0304-3975",
|
||
doi = "http://dx.doi.org/10.1016/j.tcs.2003.10.028",
|
||
url = "http://www.sciencedirect.com/science/article/pii/S0304397503005735",
|
||
author = "Oscar H. Ibarra and Zhe Dang and Omer Egecioglu",
|
||
keywords = "Membrane computing",
|
||
keywords = "Catalytic system",
|
||
keywords = "Semilinear set",
|
||
keywords = "Vector addition system",
|
||
keywords = "Reachability problem "
|
||
}
|
||
|
||
@Article{Turing1936,
|
||
Title = {On Computable Numbers, with an Application to the {E}ntscheidungsproblem},
|
||
Author = {Alan M. Turing},
|
||
Journal = {Proceedings of the London Mathematical Society},
|
||
Year = {1936},
|
||
Number = {2},
|
||
Pages = {230--265},
|
||
Volume = {42},
|
||
|
||
Owner = {ver},
|
||
Publisher = {London Mathematical Society},
|
||
Timestamp = {2013.09.16}
|
||
}
|
||
|
||
@article{Wang:1957,
|
||
author = {Wang, Hao},
|
||
title = {A Variant to {T}uring's Theory of Computing Machines},
|
||
journal = {Journal of the ACM},
|
||
issue_date = {Jan. 1957},
|
||
volume = {4},
|
||
number = {1},
|
||
month = jan,
|
||
year = {1957},
|
||
issn = {0004-5411},
|
||
pages = {63--92},
|
||
numpages = {30},
|
||
url = {http://doi.acm.org/10.1145/320856.320867},
|
||
doi = {10.1145/320856.320867},
|
||
acmid = {320867},
|
||
publisher = {ACM},
|
||
address = {New York, NY, USA},
|
||
}
|
||
|
||
@article{Minsky1961,
|
||
author = {Minsky, Marvin},
|
||
title = {Recursive unsolvability of {P}ost's problem of “Tag” and other topics in the theory of {T}uring machines},
|
||
journal = {Annals of Mathematics, second series},
|
||
volume = {74},
|
||
year = {1961},
|
||
pages = {437--455},
|
||
}
|
||
|
||
@incollection{Paun2001,
|
||
year={2001},
|
||
isbn={978-1-85233-415-4},
|
||
booktitle={Unconventional Models of Computation, UMC'2K},
|
||
series={Discrete Mathematics and Theoretical Computer Science},
|
||
editor={Antoniou, I. and Calude, C.S. and Dinneen, M.J.},
|
||
doi={10.1007/978-1-4471-0313-4_7},
|
||
title={Computing with Membranes: Attacking {NP}-Complete Problems},
|
||
url={http://dx.doi.org/10.1007/978-1-4471-0313-4_7},
|
||
publisher={Springer London},
|
||
author={P\u{a}un, Gheorghe},
|
||
pages={94-115},
|
||
language={English}
|
||
}
|
||
|
||
@article{Baker1974315,
|
||
title = "Reversal-bounded multipushdown machines ",
|
||
journal = "Journal of Computer and System Sciences ",
|
||
volume = "8",
|
||
number = "3",
|
||
pages = "315 - 332",
|
||
year = "1974",
|
||
note = "",
|
||
issn = "0022-0000",
|
||
doi = "http://dx.doi.org/10.1016/S0022-0000(74)80027-9",
|
||
url = "http://www.sciencedirect.com/science/article/pii/S0022000074800279",
|
||
author = "Brenda S. Baker and Ronald V. Book"
|
||
}
|
||
|
||
@incollection{ARV2011,
|
||
year={2011},
|
||
isbn={978-3-642-18122-1},
|
||
booktitle={Membrane Computing},
|
||
volume={6501},
|
||
series={Lecture Notes in Computer Science},
|
||
editor={Gheorghe, Marian and Hinze, Thomas and Păun, Gheorghe and Rozenberg, Grzegorz and Salomaa, Arto},
|
||
doi={10.1007/978-3-642-18123-8_10},
|
||
title={A Small Universal Splicing P System},
|
||
url={http://dx.doi.org/10.1007/978-3-642-18123-8_10},
|
||
publisher={Springer Berlin Heidelberg},
|
||
author={Alhazov, Artiom and Rogozhin, Yurii and Verlan, Sergey},
|
||
pages={95-102},
|
||
language={English}
|
||
}
|
||
|
||
@Article{Shannon,
|
||
Title = {A Universal {T}uring Machine with Two Internal States},
|
||
Author = {Claude E. Shannon},
|
||
Journal = {Automata Studies, Annals of Mathematics Studies},
|
||
Year = {1956},
|
||
Pages = {157--165},
|
||
Volume = {34},
|
||
|
||
Owner = {ver},
|
||
Timestamp = {2013.09.17}
|
||
}
|
||
|
||
@InProceedings{Minsky62,
|
||
Title = {Size and structure of universal {T}uring machines using tag systems},
|
||
Author = {Marvin Minsky},
|
||
Booktitle = {Recursive Function Theory: Proceedings, Symposium in Pure Mathematics, Provelence},
|
||
Year = {1962},
|
||
Pages = {229-238},
|
||
Volume = {5},
|
||
|
||
Owner = {ver},
|
||
Timestamp = {2013.09.17}
|
||
}
|
||
|
||
@Article{Watanabe61,
|
||
Title = {5-symbol 8-state and 5-symbol 6-state universal {T}uring machines},
|
||
Author = {Shinichi Watanabe},
|
||
Journal = {Journal of the ACM},
|
||
Year = {1961},
|
||
Number = {4},
|
||
Pages = {476--483},
|
||
Volume = {8},
|
||
|
||
Owner = {ver},
|
||
Timestamp = {2013.09.17}
|
||
}
|
||
|
||
@inproceedings{IPV2014a,
|
||
author = {Sergiu Ivanov and
|
||
Elisabeth Pelz and
|
||
Sergey Verlan},
|
||
title = {Small Universal Non-deterministic {P}etri Nets with Inhibitor Arcs},
|
||
booktitle = {Descriptional Complexity of Formal Systems - 16th International Workshop,
|
||
{DCFS} 2014, Turku, Finland, August 5-8, 2014. Proceedings},
|
||
pages = {186--197},
|
||
year = {2014},
|
||
crossref = {DBLP:conf/dcfs/2014},
|
||
url = {http://dx.doi.org/10.1007/978-3-319-09704-6_17},
|
||
doi = {10.1007/978-3-319-09704-6_17},
|
||
timestamp = {Mon, 14 Jul 2014 13:19:05 +0200},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/dcfs/0001PV14},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@proceedings{DBLP:conf/dcfs/2014,
|
||
editor = {Helmut J{\"{u}}rgensen and
|
||
Juhani Karhum{\"{a}}ki and
|
||
Alexander Okhotin},
|
||
title = {Descriptional Complexity of Formal Systems - 16th International Workshop,
|
||
{DCFS} 2014, Turku, Finland, August 5-8, 2014. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {8614},
|
||
publisher = {Springer},
|
||
year = {2014},
|
||
url = {http://dx.doi.org/10.1007/978-3-319-09704-6},
|
||
doi = {10.1007/978-3-319-09704-6},
|
||
isbn = {978-3-319-09703-9},
|
||
timestamp = {Mon, 14 Jul 2014 13:14:30 +0200},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/dcfs/2014},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@InProceedings{IPV2014b,
|
||
Title = {Small Universal {P}etri Nets with Inhibitor Arcs},
|
||
Author = {Sergiu Ivanov and
|
||
Elisabeth Pelz and
|
||
Sergey Verlan},
|
||
Booktitle = {Computability in Europe},
|
||
Year = {2014},
|
||
|
||
Ee = {http://arxiv.org/abs/1312.4414},
|
||
Journal = {arXiv, CoRR}
|
||
}
|
||
|
||
@INCOLLECTION{detpelz,
|
||
author = {Elisabeth Pelz},
|
||
title = {Closure Properties of Deterministic {P}etri nets},
|
||
booktitle = {Symposium on Theoretical Aspects of Computer Science, STACS '87},
|
||
volume = {247},
|
||
series = {Lecture Notes in Computer Science},
|
||
pages = {371--382},
|
||
publisher = {Springer},
|
||
year = 1986
|
||
}
|
||
|
||
@article{Koiran:1999,
|
||
author = {Koiran, Pascal and Moore, Cristopher},
|
||
title = {Closed-form Analytic Maps in One and Two Dimensions Can Simulate Universal {T}uring Machines},
|
||
journal = {Theoretical Computer Science},
|
||
issue_date = {Jan. 6, 1999},
|
||
volume = {210},
|
||
number = {1},
|
||
month = jan,
|
||
year = {1999},
|
||
issn = {0304-3975},
|
||
pages = {217--223},
|
||
numpages = {7},
|
||
url = {http://dx.doi.org/10.1016/S0304-3975(98)00117-0},
|
||
doi = {10.1016/S0304-3975(98)00117-0},
|
||
acmid = {292115},
|
||
publisher = {Elsevier Science Publishers Ltd.},
|
||
address = {Essex, UK},
|
||
}
|
||
|
||
@Misc{gurobi,
|
||
Title = {Gurobi Optimizer Reference Manual},
|
||
|
||
Author = {Gurobi Optimization{, }Inc.},
|
||
Year = {2014},
|
||
|
||
Url = {http://www.gurobi.com}
|
||
}
|
||
|
||
@Book{AMPL,
|
||
Title = {AMPL: A Modeling Language for Mathematical Programming},
|
||
Author = {Robert Fourer and David M. Gay and Brian W. Kernighan},
|
||
Publisher = {Duxbury Press, Brooks/Cole Publishing Company},
|
||
Year = {2002},
|
||
Edition = {2nd},
|
||
|
||
ISBN = {0-534-38809-4}
|
||
}
|
||
|
||
@inproceedings{LerouxS14,
|
||
author = {J{\'{e}}r{\^{o}}me Leroux and
|
||
Philippe Schnoebelen},
|
||
title = {On Functions Weakly Computable by Petri Nets and Vector Addition Systems},
|
||
booktitle = {Reachability Problems - 8th International Workshop, {RP} 2014, Oxford,
|
||
UK, September 22-24, 2014. Proceedings},
|
||
pages = {190--202},
|
||
year = {2014},
|
||
crossref = {DBLP:conf/rp/2014},
|
||
url = {http://dx.doi.org/10.1007/978-3-319-11439-2_15},
|
||
doi = {10.1007/978-3-319-11439-2_15},
|
||
timestamp = {Tue, 28 Oct 2014 18:50:19 +0100},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/rp/LerouxS14},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@proceedings{DBLP:conf/rp/2014,
|
||
editor = {Jo{\"{e}}l Ouaknine and
|
||
Igor Potapov and
|
||
James Worrell},
|
||
title = {Reachability Problems - 8th International Workshop, {RP} 2014, Oxford,
|
||
UK, September 22-24, 2014. Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {8762},
|
||
publisher = {Springer},
|
||
year = {2014},
|
||
url = {http://dx.doi.org/10.1007/978-3-319-11439-2},
|
||
doi = {10.1007/978-3-319-11439-2},
|
||
isbn = {978-3-319-11438-5},
|
||
timestamp = {Mon, 15 Sep 2014 12:50:50 +0200},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/rp/2014},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@inproceedings{DufordJS99,
|
||
author = {Catherine Dufourd and
|
||
Petr Jancar and
|
||
Philippe Schnoebelen},
|
||
title = {Boundedness of Reset {P/T} Nets},
|
||
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
|
||
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
|
||
pages = {301--310},
|
||
year = {1999},
|
||
crossref = {DBLP:conf/icalp/99},
|
||
url = {http://dx.doi.org/10.1007/3-540-48523-6_27},
|
||
doi = {10.1007/3-540-48523-6_27},
|
||
timestamp = {Sun, 20 Sep 2009 11:17:52 +0200},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/icalp/DufordJS99},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@proceedings{DBLP:conf/icalp/99,
|
||
editor = {Ji\v{r}{\'{\i}} Wiedermann and
|
||
Peter van Emde Boas and
|
||
Mogens Nielsen},
|
||
title = {Automata, Languages and Programming, 26th International Colloquium,
|
||
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
|
||
series = {Lecture Notes in Computer Science},
|
||
volume = {1644},
|
||
publisher = {Springer},
|
||
year = {1999},
|
||
isbn = {3-540-66224-3},
|
||
timestamp = {Mon, 21 Jan 2002 15:41:36 +0100},
|
||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/icalp/99},
|
||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||
}
|
||
|
||
@article{Araki197685,
|
||
title = "Some decision problems related to the reachability problem for {P}etri nets ",
|
||
journal = "Theoretical Computer Science ",
|
||
volume = "3",
|
||
number = "1",
|
||
pages = "85 - 104",
|
||
year = "1976",
|
||
note = "",
|
||
issn = "0304-3975",
|
||
doi = "http://dx.doi.org/10.1016/0304-3975(76)90067-0",
|
||
url = "http://www.sciencedirect.com/science/article/pii/0304397576900670",
|
||
author = "Toshiro Araki and Tadao Kasami",
|
||
}
|