標(biāo)題: Titlebook: Application and Theory of Petri Nets and Concurrency; 35th International C Gianfranco Ciardo,Ekkart Kindler Conference proceedings 2014 Spr [打印本頁(yè)] 作者: ACORN 時(shí)間: 2025-3-21 17:23
書目名稱Application and Theory of Petri Nets and Concurrency影響因子(影響力)
書目名稱Application and Theory of Petri Nets and Concurrency影響因子(影響力)學(xué)科排名
書目名稱Application and Theory of Petri Nets and Concurrency網(wǎng)絡(luò)公開度
書目名稱Application and Theory of Petri Nets and Concurrency網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Application and Theory of Petri Nets and Concurrency被引頻次
書目名稱Application and Theory of Petri Nets and Concurrency被引頻次學(xué)科排名
書目名稱Application and Theory of Petri Nets and Concurrency年度引用
書目名稱Application and Theory of Petri Nets and Concurrency年度引用學(xué)科排名
書目名稱Application and Theory of Petri Nets and Concurrency讀者反饋
書目名稱Application and Theory of Petri Nets and Concurrency讀者反饋學(xué)科排名
作者: 迅速飛過 時(shí)間: 2025-3-21 20:37
https://doi.org/10.1007/978-3-540-33978-6ntroduce an unfolding, called ., that turns out to be related to flow event structures, hence dependencies and conflict are still represented. Furthermore, this unfolding gives also a more compact representation of the executions of a multi-clock net, similarly to what approaches like trellises or merged processes do.作者: ABYSS 時(shí)間: 2025-3-22 03:18
Elements de Theorie des Matroides-complete formalisms and, in particular, safety properties are undecidable for them. Second, we consider locally-timed processes, where each process carries a single real valued clock. For them, we prove decidability of safety properties by a non-trivial instantiation of the framework of Well-Structured Transition Systems.作者: STALL 時(shí)間: 2025-3-22 06:15 作者: 相同 時(shí)間: 2025-3-22 10:35 作者: 外表讀作 時(shí)間: 2025-3-22 14:27 作者: disparage 時(shí)間: 2025-3-22 18:07
https://doi.org/10.1007/978-3-540-33978-6of causalities and conflicts between high and low level activities. This leads to an algorithm for checking BNDC for safe Petri nets which relies on the construction of suitable complete prefixes of the unfolding. A prototype tool provides very promising results.作者: Jogging 時(shí)間: 2025-3-22 22:54
Complex Networks and Link Streams for the Empirical Analysis of Large Softwareinteracted at time .. For instance, such a triplet may model a call between two modules at run time. Analyzing such streams directly turns out to be much easier and powerful than transforming them into dynamic graphs that poorly capture their dynamics. We present our work on this topic, with directions for applications in software analysis.作者: Platelet 時(shí)間: 2025-3-23 03:02
Discovering Block-Structured Process Models from Incomplete Event Logsble to rediscover a model of the original system. Furthermore, we show in experiments that our approach even rediscovers models from incomplete event logs that are much smaller than required by other process discovery algorithms.作者: MOTIF 時(shí)間: 2025-3-23 08:36
Learning Transparent Data Automataand hence for tDA, equivalence is shown to be decidable. On these grounds, in the spirit of Angluin’s L. algorithm we develop an active learning algorithm for tDA. They are incomparable to register automata and variants, for which learning algorithms were given recently.作者: 溫順 時(shí)間: 2025-3-23 11:46 作者: bioavailability 時(shí)間: 2025-3-23 15:52 作者: Adulate 時(shí)間: 2025-3-23 18:57
Elements de Theorie des Matroidestching lower bound has been known. Last, we show .-completeness for the containment and equivalence problems of conservative Petri nets. .-hardness of the problems mentioned above still holds if they are restricted to ordinary 1-conservative Petri nets.作者: 橢圓 時(shí)間: 2025-3-24 01:00
https://doi.org/10.1007/978-981-287-888-5tokens that is live and reversible. We also introduce a polynomial time transformation of well-formed Choice-Free systems into well-formed T-systems and we deduce from it a polynomial time sufficient condition of liveness and reversibility for well-formed Choice-Free systems. We show that neither one of these two approaches subsumes the other.作者: 錯(cuò)誤 時(shí)間: 2025-3-24 04:15
Der-Hwa Victoria Rau,Gerald Rauand witnesses. The CTL model checker employs symbolic data structures (decision diagrams) implemented in the Meddly library [6], developed Iowa State University, while the CSL. model checker uses advanced solution methods, recently published, for Markov Renewal Processes.作者: 平淡而無(wú)味 時(shí)間: 2025-3-24 08:08 作者: glisten 時(shí)間: 2025-3-24 12:36
A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Applicationtching lower bound has been known. Last, we show .-completeness for the containment and equivalence problems of conservative Petri nets. .-hardness of the problems mentioned above still holds if they are restricted to ordinary 1-conservative Petri nets.作者: 肌肉 時(shí)間: 2025-3-24 15:12 作者: 浸軟 時(shí)間: 2025-3-24 19:39 作者: 狂怒 時(shí)間: 2025-3-24 23:28 作者: Host142 時(shí)間: 2025-3-25 05:40 作者: appall 時(shí)間: 2025-3-25 09:45 作者: 使激動(dòng) 時(shí)間: 2025-3-25 12:36
Flow Unfolding of Multi-clock Netsntroduce an unfolding, called ., that turns out to be related to flow event structures, hence dependencies and conflict are still represented. Furthermore, this unfolding gives also a more compact representation of the executions of a multi-clock net, similarly to what approaches like trellises or merged processes do.作者: 嫌惡 時(shí)間: 2025-3-25 17:49
Dynamic Networks of Timed Petri Nets-complete formalisms and, in particular, safety properties are undecidable for them. Second, we consider locally-timed processes, where each process carries a single real valued clock. For them, we prove decidability of safety properties by a non-trivial instantiation of the framework of Well-Structured Transition Systems.作者: 山羊 時(shí)間: 2025-3-25 21:56 作者: 狂怒 時(shí)間: 2025-3-26 01:23 作者: Synchronism 時(shí)間: 2025-3-26 05:45 作者: Munificent 時(shí)間: 2025-3-26 09:43
Patricia A. Holroyd,Suzanne G. Straitearl [10]) and probabilistic Horn abduction (D. Pool [12]). In contrast to Bayesian networks, the algorithms are not ”hidden” but part of the nets. The net structure together with a simple firing rule allows uncertain reasoning in backward and forward direction, where backward and forward direction 作者: Landlocked 時(shí)間: 2025-3-26 15:34 作者: 信條 時(shí)間: 2025-3-26 20:14 作者: 圓柱 時(shí)間: 2025-3-26 22:49
Elysium. Die vierte Ekloge Vergilsl based on timed-arc Petri nets and study the foundational problems of soundness and strong (time-bounded) soundness. We explore the decidability of these problems and show, among others, that soundness is decidable for monotonic workflow nets while reachability is undecidable. For general timed-arc作者: Indolent 時(shí)間: 2025-3-27 02:04 作者: 前奏曲 時(shí)間: 2025-3-27 06:13 作者: 果核 時(shí)間: 2025-3-27 12:01
,Sous-algèbres de Cartan éléments réguliers,nces of pairs of letters from a finite and, respectively, infinite alphabet. The model of DA is closely related to general Petri nets, for which no active learning algorithms have been introduced so far. This paper defines transparent data automata (tDA) as a strict subclass of deterministic DA. Yet作者: 軌道 時(shí)間: 2025-3-27 16:49
https://doi.org/10.1007/978-3-540-33978-6w how an algebraic decomposition allows one to expose both concurrency and spatial distribution in the statespace..Concretely, we introduce a high-level domain specific language (DSL), ., for the construction of nets in terms of their components. We use . to express several well-known parametric exa作者: Angioplasty 時(shí)間: 2025-3-27 20:12
https://doi.org/10.1007/978-3-540-33978-6This allows for a clear characterization of dependencies and the conflicts between occurrences of transitions in the net. This relation is somehow lost if more compact representations of the executions of nets are considered, . in trellises or merged processes of multi-clock nets. In this paper we i作者: mediocrity 時(shí)間: 2025-3-28 00:44 作者: 激怒某人 時(shí)間: 2025-3-28 03:06
https://doi.org/10.1007/978-3-540-33978-6approaches to behavioral analysis of such systems have been based on declarative abstractions defined as sets of behavioral relations. However, these relations are typically defined in an ad-hoc manner. In this paper, we address the lack of a systematic exploration of the fundamental relations that 作者: terazosin 時(shí)間: 2025-3-28 07:59
https://doi.org/10.1007/978-3-540-34391-2ords) as a natural generalisation of finite state transducers (FSTs)..Concerning weights, we use the algebraic structure of continuous concurrent semirings which is based on bisemirings and induces a natural order on its elements. Using the operations of this algebra, it is possible to define the we作者: 傷心 時(shí)間: 2025-3-28 11:23
https://doi.org/10.1007/978-3-540-34391-2 As opposed to their non-structural variants which require exponential space, these properties need polynomial time only. The algorithm searches for a counter-example in the form of a multiset of arcs computed by means of linear programming. Yet the minimal length of a pathological cycle can be expo作者: 違反 時(shí)間: 2025-3-28 15:35
https://doi.org/10.1007/978-3-540-34391-2ions (ODEs) when their indexing parameter grows very large. This approximation cannot capture the stochastic nature of the process and, consequently, it can provide an erroneous view of the behavior of the Markov chain if the indexing parameter is not sufficiently high. Important phenomena that cann作者: 兵團(tuán) 時(shí)間: 2025-3-28 19:15
Elements de Theorie des Matroidesith each other (e.g., in order to gain access to some shared resources) and be created or become garbage dynamically. We introduce dense time in two different ways. First, we consider that each token in each process carries a real valued clock. We prove that this model can faithfully simulate Turing作者: Abrade 時(shí)間: 2025-3-29 01:27
Elements de Theorie des Matroidess of Petri nets with arbitrary arc multiplicities. As an example of application, we use these techniques to obtain .-completeness for the reachability and the covering problems of conservative Petri nets, generalizing known results for ordinary 1-conservative Petri nets. We also prove .-completeness作者: 職業(yè) 時(shí)間: 2025-3-29 05:13 作者: 搜尋 時(shí)間: 2025-3-29 11:14
Der-Hwa Victoria Rau,Gerald Rauave been recently introduced in GreatSPN. Through a new (Java-based) graphical interface for the GSPN model definition, the user can now access model checking of three different logics: the classical branching temporal logic CTL, and two stochastic logics, CSL and its superset CSL.. This allows to i作者: 解脫 時(shí)間: 2025-3-29 13:56 作者: escalate 時(shí)間: 2025-3-29 18:03
978-3-319-07733-8Springer International Publishing Switzerland 2014作者: 厭食癥 時(shí)間: 2025-3-29 23:07
A Programming Language for Spatial Distribution of Net Systemsw how an algebraic decomposition allows one to expose both concurrency and spatial distribution in the statespace..Concretely, we introduce a high-level domain specific language (DSL), ., for the construction of nets in terms of their components. We use . to express several well-known parametric examples.作者: gnarled 時(shí)間: 2025-3-30 02:37
Conference proceedings 2014eld in Tunis, Tunisia, in June 2014. The 15 regular papers and 4 tool papers presented in this volume were carefully reviewed and selected from 48 submissions. In addition the book contains 3 invited talks in full paper length. The papers cover various topics in the field of Petri nets and related models of concurrency.作者: 摻假 時(shí)間: 2025-3-30 08:05
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159078.jpg作者: transplantation 時(shí)間: 2025-3-30 11:55
,Algèbres de Lie semi-simples déployées,This paper presents efficient, specialised synthesis and reengineering algorithms for the case that a transition system is finite, persistent and reversible. It also shows by means of a complex example that structural properties of the synthesised Petri nets may not necessarily be entailed.作者: 爭(zhēng)吵 時(shí)間: 2025-3-30 13:20 作者: 有發(fā)明天才 時(shí)間: 2025-3-30 18:23 作者: engender 時(shí)間: 2025-3-30 23:03
Energy-Utility Analysis for Resilient Systems Using Probabilistic Model Checkingerview how these quantitative measures for resilience mechanisms can be computed when the resilient systems are modeled either as discrete or continuous-time Markov chains. All the presented concepts of multi-objective reasoning are not supported by state-of-the-art probabilistic model checkers yet.作者: Arbitrary 時(shí)間: 2025-3-31 01:24
Process Model Discovery: A Method Based on Transition System Decompositionls are combined into a single process model. It is proven, that the structural and behavioral properties of submodels are inherited by the unified process model. The proposed discovery algorithm is illustrated using a running example.作者: 中世紀(jì) 時(shí)間: 2025-3-31 08:43 作者: Libido 時(shí)間: 2025-3-31 11:08
On Weighted Petri Net Transducersf (sequential or parallel) composed partial words equals the corresponding bisemiring composition of the weights of its components..To be able to create complex PNTs through composition of simple PNTs, we introduce clean PNTs and the composition operations union, product, closure, parallel product a作者: 客觀 時(shí)間: 2025-3-31 15:43
Exhibition of a Structural Bug with Wingst of arcs that represents a pathological cycle. Interestingly the number of distinct wings we need is at most equal to the dimension of vectors which helps to describe in a concise way the underlying bug and to analyse it..Next we tackle the problem of computing a pathological multiset built over wi作者: Antagonism 時(shí)間: 2025-3-31 21:23 作者: Directed 時(shí)間: 2025-4-1 00:44
Elwyn Simons: A Search for Originserview how these quantitative measures for resilience mechanisms can be computed when the resilient systems are modeled either as discrete or continuous-time Markov chains. All the presented concepts of multi-objective reasoning are not supported by state-of-the-art probabilistic model checkers yet.
