Filters








32 Hits in 2.9 sec

Well-structured languages

Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
<span title="2007-06-12">2007</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cnqseeosvrf6tnj6sc3lbn2y4e" style="color: black;">Acta Informatica</a> </i> &nbsp;
A pumping lemma for PN Our second pumping lemma states properties of languages of Petri nets (more precisely, languages in the class L G (PN)).  ...  This study is made possible by two stronger pumping lemmata for these models. The rest of this paper is structured as follows.  ...  Closure Properties of EPN The pumping lemmata on PN and PN+NBA can also be used to show that neither L G (PN) nor L G (PN+NBA) are closed under iteration.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00236-007-0050-3">doi:10.1007/s00236-007-0050-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/o2ynn2rqqbgrffybm3u44o3gna">fatcat:o2ynn2rqqbgrffybm3u44o3gna</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080419023611/http://www.ulb.ac.be/di/ssd/cfv/TechReps/TechRep_CFV_2006_66.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e1/18/e118d91292c5255036bd7f79be9626062c001587.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00236-007-0050-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On the ω-language Expressive Power of Extended Petri Nets

A. Finkel, G. Geeraerts, J.-F. Raskin, L. Van Begin
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
We compare the expressive power of Petri nets, Petri nets extended with nonblocking arcs and Petri nets extended with transfer arcs, in terms of ω-languages.  ...  In this paper, we study the expressive power of several monotonic extensions of Petri nets.  ...  Acknowledgements We would like to address many thanks to Raymond Devillers for proof-reading the paper and giving us many judicious advices.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2004.11.030">doi:10.1016/j.entcs.2004.11.030</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bh47yymxf5g6bpahfw3qafexjy">fatcat:bh47yymxf5g6bpahfw3qafexjy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20041224190041/http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FGRV-express04.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b3/01/b301f6dfbb21f6648c3588c510e09e3fe77c209e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2004.11.030"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Deciding Bisimilarity between BPA and BPP Processes [chapter]

Petr Jančar, Antonín Kučera, Faron Moller
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We provide an effective procedure for testing if this condition holds of a given BPP, and in the positive case we provide an effective construction for a particular form of one-counter automaton which  ...  We identify a necessary condition for when a given BPP process can be expressed as a BPA process.  ...  First we extend the net AE by two fresh places Ô and Õ.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45187-7_10">doi:10.1007/978-3-540-45187-7_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wobbv7td6zbgrlbqhejmivjyoa">fatcat:wobbv7td6zbgrlbqhejmivjyoa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190227032231/http://pdfs.semanticscholar.org/8966/6b5a07ab628c1d212d6c5bbbdbda710c5238.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/89/66/89666b5a07ab628c1d212d6c5bbbdbda710c5238.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45187-7_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Reachability in Petri Nets with Inhibitor Arcs

Klaus Reinhardt
<span title="">2008</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
Especially the reachability problem is decidable for Petri nets with only one inhibitor arc, which solves an open problem in [11] .  ...  This generalizes Presburger arithmetics and allows to decide the reachability problem for those Petri nets where inhibitor arcs occur only in some restricted way.  ...  Acknowledgement I thank Klaus-Jörn Lange and Andreas Krebs, for many helpful discussions on this version and also Volker Diekert and Henning Fernau for many helpful discussions on previous versions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2008.12.042">doi:10.1016/j.entcs.2008.12.042</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mszfeck2c5hl5e5se23uzpoize">fatcat:mszfeck2c5hl5e5se23uzpoize</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190327061908/https://core.ac.uk/download/pdf/82199576.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/70/7f709202ceedcf015d3aeb9a1c961f87aa12c992.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2008.12.042"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

On the ω-language expressive power of extended Petri nets

A. Finkel, G. Geeraerts, J.-F. Raskin, L. Van Begin
<span title="">2006</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
We compare the expressive power of Petri nets, Petri nets extended with non-blocking arcs and Petri nets extended with transfer arcs, in terms of -languages.  ...  In this paper, we study the expressive power of several monotonic extensions of Petri nets.  ...  Acknowledgements We would like to address many thanks to Raymond Devillers for proof-reading the paper and giving us many judicious advices.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2006.02.008">doi:10.1016/j.tcs.2006.02.008</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vkpjkpg6ojd35krax3vxhk4c7i">fatcat:vkpjkpg6ojd35krax3vxhk4c7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190217005642/https://core.ac.uk/download/pdf/82075491.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/02/0e/020e708dbef3fda7ee62b536fc40936a6b0e82ff.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2006.02.008"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

DAG Automata for Meaning Representation

Frank Drewes
<span title="">2017</span> <i title="Association for Computational Linguistics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ejd55qqkonc55awpya2mqejjom" style="color: black;">Proceedings of the 15th Meeting on the Mathematics of Language</a> </i> &nbsp;
Pumping Swapping edges also yields two pumping lemmata. Both work by iterated application of the swapping operation.  ...  Petri nets with a zero cycle are also said to be structurally cyclic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18653/v1/w17-3409">doi:10.18653/v1/w17-3409</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/mol/Drewes17.html">dblp:conf/mol/Drewes17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/en7wqw4cmbf47pqzal77k5gdlm">fatcat:en7wqw4cmbf47pqzal77k5gdlm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180612013209/http://aclweb.org/anthology/W17-3409" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b6/58/b6589394a0aca6488c616f25544a8a30aa8bd250.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18653/v1/w17-3409"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Model Checking Data Flows in Concurrent Network Updates (Full Version) [article]

Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch, Ernst-Rüdiger Olderog
<span title="2019-11-14">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
the data flow caused by each transition of the Petri net.  ...  For safe Petri nets with transits, we reduce the verification of temporal flow properties to a circuit model checking problem that can be solved with effective verification techniques like IC3, interpolation  ...  By this, the proofs for all lemmata and the theorem of this paper are made available.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.11061v2">arXiv:1907.11061v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/onq5wltecrbcrh6l4tifzx6ehe">fatcat:onq5wltecrbcrh6l4tifzx6ehe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200825094818/https://arxiv.org/pdf/1907.11061v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/57/fe5773cdb11fd2639c6ed11c340126d2aefae895.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1907.11061v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Regular Separability of Well Structured Transition Systems [article]

Wojciech Czerwiński and Sławomir Lasota and Roland Meyer and Sebastian Muskalla and K Narayan Kumar and Prakash Saivasan
<span title="2018-07-05">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our second result shows that for Petri nets, the complexity of the backwards coverability algorithm yields a bound on the size of the regular separator. We complement it by a lower bound construction.  ...  Our first result shows that, under very mild assumptions, every two disjoint WSTS languages are regular separable: There is a regular language containing one of them and being disjoint from the other.  ...  For Petri nets, one may use any representation of the coverability set.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1702.05334v4">arXiv:1702.05334v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vsg5lnkarna2fl4vsxlyk62ugm">fatcat:vsg5lnkarna2fl4vsxlyk62ugm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191026231311/https://arxiv.org/pdf/1702.05334v4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b4/52/b452538c32954190cd317c0ad1e144854f893efc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1702.05334v4" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Long-Run Average Behaviour of Probabilistic Vector Addition Systems

Toma Brazdil, Stefan Kiefer, Antonin Kucera, Petr Novotny
<span title="">2015</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cnybbxuptncftdgxtodn5edz7m" style="color: black;">2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science</a> </i> &nbsp;
As a byproduct of our study, we discover counterexamples falsifying some classical results about stochastic Petri nets published in the 80s.  ...  For stable two-counter pVASS, we show the same result, but we do not provide any upper complexity bound.  ...  The analysis of stochastic Petri nets (SPNs) has primarily focused on long-run average behaviour.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lics.2015.15">doi:10.1109/lics.2015.15</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/lics/BrazdilKKN15.html">dblp:conf/lics/BrazdilKKN15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iryhgfse5zam3mjf2e2arfosxu">fatcat:iryhgfse5zam3mjf2e2arfosxu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829175506/http://www.fi.muni.cz/usr/kucera/papers/lics2015.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/88/e4/88e4be4b7283430230800a1bd0ad3465667c0a5d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lics.2015.15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

On a Hierarchy of Languages with Catenation and Shuffle [chapter]

Nils Erik Flick, Manfred Kudlek
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Such combinations of both operators are especially useful for modelling some areas of concurrency, and in particular the behaviour of client/server systems [2] , and also for semantics of Petri nets,  ...  To prove the following lemma iteration lemmata for the classes RAT ( , ), LIN ( , ) and ALG( , ), similar to such for REG, LIN and CF are applied.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-31653-1_40">doi:10.1007/978-3-642-31653-1_40</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c24ur5pauzgf5ouetn25md3il4">fatcat:c24ur5pauzgf5ouetn25md3il4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171116065859/http://ceur-ws.org/Vol-928/0103.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2c/0c/2c0c054e27e392ef09b37c8d5f09d4111e187dd1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-31653-1_40"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 803 of Mathematical Reviews Vol. 15, Issue Index [page]

<i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
(German and Russian summaries) 83a:68074 Two pumping lemmata for Petri nets. (German and Russian summaries) 83):68066 Chen, Wai Kai See Onaga, Kenji, 83h:68088 Cherkasova, L. A. (with Kotov, V. E.)  ...  A Petri net extension for the description of combined mathematical models] 83g:68085 Jensen, Kurt How to find invariants for coloured Petri nets. 83e:68074 Coloured Petri nets and the invariant method.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1983_15_index_2/page/803" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1983_15_index_2/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Long-Run Average Behaviour of Probabilistic Vector Addition Systems [article]

Tomas Brazdil, Stefan Kiefer, Antonin Kucera, Petr Novotny
<span title="2015-06-19">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
As a byproduct of our study, we discover counterexamples falsifying some classical results about stochastic Petri nets published in the~80s.  ...  For stable two-counter pVASS, we show the same result, but we do not provide any upper complexity bound.  ...  The analysis of stochastic Petri nets (SPNs) has primarily focused on long-run average behaviour.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1505.02655v2">arXiv:1505.02655v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/admpccs47jh2zmz5pd2ymewsnm">fatcat:admpccs47jh2zmz5pd2ymewsnm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200911053832/https://arxiv.org/pdf/1505.02655v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cf/77/cf77a2904cbf529ff75315d2cdb133353c4dd3f0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1505.02655v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Decidability and Closure Properties of Equational Tree Languages [chapter]

Hitoshi Ohsaki, Toshinori Takai
<span title="">2002</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In the paper we show the emptiness problem for AC-tree automata and the intersection-emptiness problem for regular AC-tree automata, each of which was open in our previous work [20] , are decidable, by  ...  a straightforward reduction to the reachability problem for ground AC-term rewriting.  ...  The authors would like to thank Ralf Treinen for his continuous help. We also thank to three anonymous referees for their comments and criticism.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45610-4_9">doi:10.1007/3-540-45610-4_9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7rql35eurfce5lfoxnfcdh7y3m">fatcat:7rql35eurfce5lfoxnfcdh7y3m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808123041/http://ocvs.cfv.jp/tr-data/PS2002-004.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/40/d3/40d366c126d1af9f9001ec5d6a7b1f4092888174.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45610-4_9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Entropy of regular timed languages

Eugene Asarin, Nicolas Basset, Aldric Degorre
<span title="">2015</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
For languages accepted by deterministic timed automata, we give exact formulas for volumes.  ...  For timed languages, we define size measures: volume for languages with a fixed finite number of events, and entropy (growth rate) as asymptotic measure for an unbounded number of events.  ...  We expect that our techniques based on positive operators will be useful for the analysis of timed probabilistic Petri nets and automata, as in articles cited above.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2015.03.003">doi:10.1016/j.ic.2015.03.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dayj6uf3w5clndhg64fol2xs54">fatcat:dayj6uf3w5clndhg64fol2xs54</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928200427/https://hal.archives-ouvertes.fr/hal-01078613/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f3/d3/f3d38bda7b6a63e565b6f9461b7cec760cf0cd25.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2015.03.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 1935 of Mathematical Reviews Vol. , Issue Subject Index [page]

<i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
A graphical calculus for mobile systems. (English summary) Hirshfeld, Yoram (with Moller, Faron) Pushdown automata, multiset automata, and Petri nets.  ...  (English summary) 2002a:68018 Démiési, Pal (with Kudiek, Manfred) Strong iteration lemmata for regular, linear, context- free, and linear indexed languages.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2002_subject-index_0/page/1935" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2002_subject-index_0/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 32 results