作者: colloquial 時間: 2025-3-21 23:35
Generalized Universality made highly available to all of them. At the heart of this fundamental reduction lies the so called . abstraction, key to providing the illusion of single shared service, despite replication..Yet, as universal as it may be, consensus is just one specific instance of a more general abstraction, . wh作者: 發(fā)起 時間: 2025-3-22 00:45
Causal Nets: A Modeling Language Tailored towards Process Discoveryhe primary reason is that conventional modeling languages (e.g., Petri nets, BPMN, EPCs, and ULM ADs) have difficulties representing the observed behavior properly and/or succinctly. Moreover, discovered process models tend to have deadlocks and livelocks. Therefore, we advocate a new representation作者: COMMA 時間: 2025-3-22 04:54
On Causal Semantics of Petri Netsondition/event-systems, the notion of process as defined by Carl Adam Petri provides a notion of a run of a system where causal dependencies are reflected in terms of a partial order. A wellknown problem is how to generalise this notion for nets where places may carry several tokens. Goltz and Reisi作者: 巨頭 時間: 2025-3-22 10:46 作者: META 時間: 2025-3-22 13:58
Timed Automata Can Always Be Made Implementablel systems, properties proven formally on a timed automaton may be lost at implementation. In order to ensure implementability, several approaches have been considered, corresponding to different hypotheses on the implementation platform. We address two of these: A timed automaton is samplable if its作者: META 時間: 2025-3-22 20:24
Coarse Abstractions Make Zeno Behaviours Difficult to Detecto detect them, or dually, find runs that are non-Zeno. Over the years important improvements have been obtained in checking reachability properties for timed automata. We show that some of these very efficient optimizations make testing for Zeno runs costly. In particular we show NP-completeness for作者: NATTY 時間: 2025-3-22 21:32 作者: CHOKE 時間: 2025-3-23 04:33
A Spectrum of Behavioral Relations over LTSs on Probability Distributionsterizations of the main behavioral relations on PLTSs have been studied. In particular, Parma and Segala?[2007] define a probabilistic Hennessy-Milner logic interpreted over distributions, whose logical equivalence/preorder when restricted to Dirac distributions coincide with standard bisimulation/s作者: nauseate 時間: 2025-3-23 09:04
Fixed-Delay Events in Generalized Semi-Markov Processes Revisitedlowing two fixed-delay events and one variable-delay event may cause an unstable behavior of a GSMP. In particular, we show that a frequency of a given state may not be defined for almost all runs (or more generally, an invariant measure may not exist). We use this observation to disprove several re作者: 斜 時間: 2025-3-23 09:47
Semantic Analysis of Gossip Protocols for Wireless Sensor Networkspropose a compositional analysis technique to study formal probabilistic models of gossip protocols in the context of wireless sensor networks. We introduce a simple probabilistic timed process calculus for modelling wireless sensor networks. A simulation theory is developed to compare probabilistic作者: Misnomer 時間: 2025-3-23 14:06
An Automaton over Data Words That Captures EMSO Logichabet. As a model of an implementation, we introduce class register automata, a one-way automata model over words with multiple data values. Our model combines register automata and class memory automata. It has natural interpretations. In particular, it captures communicating automata with an unbou作者: Amorous 時間: 2025-3-23 21:36
Advanced Ramsey-Based Büchi Automata Inclusion Testing which are efficient in many practical cases have been proposed. We build on one of these, which is known as the .. It has recently been shown that the basic Ramsey-based approach can be drastically optimized by using powerful subsumption techniques, which allow one to prune the search-space when lo作者: 暖昧關系 時間: 2025-3-24 01:22 作者: 最有利 時間: 2025-3-24 05:02
Granularity and Concurrent Separation Logicns such as assignments. Running on physical hardware, these assumptions can fail to hold in practice, which puts in question reasoning about their concurrent execution. We address an observation, due to John Reynolds, that processes proved sound in concurrent separation logic are separated to an ext作者: relieve 時間: 2025-3-24 08:38 作者: AWL 時間: 2025-3-24 12:35 作者: CHOKE 時間: 2025-3-24 15:55 作者: Deduct 時間: 2025-3-24 22:24 作者: oxidize 時間: 2025-3-25 01:26 作者: 戲服 時間: 2025-3-25 03:34
Semantic Analysis of Gossip Protocols for Wireless Sensor Networks protocols that have similar behaviour up to a certain probability. This theory is used to prove a number of algebraic laws which revealed to be very effective to evaluate the performances of gossip networks with and without communication collisions.作者: 錢財 時間: 2025-3-25 11:22 作者: Eructation 時間: 2025-3-25 14:28
Typed ,-calculiems can also be obtained. We first present a new type system for the calculus of explicit fusions by Wischik and Gardner, then one for the distributed .-calculus of Hennessy and Riely and finally show how existing type systems for secrecy and authenticity in the spi calculus can be represented and shown to be safe.作者: Essential 時間: 2025-3-25 17:03 作者: Countermand 時間: 2025-3-25 23:06
https://doi.org/10.1007/978-3-86226-854-2 the LU-extrapolation of Behrmann et al. We analyze the source of this complexity in detail and give general conditions on extrapolation operators that guarantee a (low) polynomial complexity of Zenoness checking. We propose a slight weakening of the LU-extrapolation that satisfies these conditions.作者: Engaging 時間: 2025-3-26 00:52 作者: pulmonary 時間: 2025-3-26 04:50
https://doi.org/10.1007/978-3-322-95003-1e formula is equivalent to one whose graph is in a particular normal form. Entailment between two such formulae then reduces to a graph homomorphism problem. We also discuss natural syntactic extensions that render entailment intractable.作者: Indicative 時間: 2025-3-26 09:34 作者: JECT 時間: 2025-3-26 15:53
0302-9743 rnational Conference on Concurrency Theory, CONCUR 2011, held in Aachen, Germany, September 5-10, 2011. .The 32 revised full papers were carefully reviewed and selected from 94 submissions. The papers are organized in topics such as real-time systems, probabilistic systems, automata, separation logi作者: bourgeois 時間: 2025-3-26 18:34 作者: heterogeneous 時間: 2025-3-26 23:36
On Locality and the Exchange Law for Concurrent Processesdard models: one uses sets of traces, and the other is state-based, using assertions and weakest preconditions. We relate the latter to standard models of the heap as a partial function. We exploit the power of algebra to unify models and classify their variations.作者: 商品 時間: 2025-3-27 01:46
https://doi.org/10.1007/978-3-662-33887-2mining, fuzzy mining, and genetic mining). However, unlike existing approaches, we provide declarative semantics more suitable for process mining. To clarify these semantics and to illustrate the non-local nature of this new representation, we relate causal nets to Petri nets.作者: Meager 時間: 2025-3-27 08:59 作者: agonist 時間: 2025-3-27 12:23
https://doi.org/10.1007/978-3-322-97207-1 strong bisimulation relations, which characterizes PCTL and PCTL. exactly. We also extend weak bisimulations characterizing PCTL and PCTL. without next operator, respectively. Thus, our paper bridges the gap between logical and behavioral equivalences in this setting.作者: graphy 時間: 2025-3-27 14:35 作者: heckle 時間: 2025-3-27 21:50
Grundlagen der empirischen Analysen, such a GSMP always possesses an invariant measure which means that the frequencies of states are always well defined and we provide algorithms for approximation of these frequencies. Additionally, we show that the positive results remain valid even if we allow an arbitrary number of reasonably restricted fixed-delay events.作者: 出價 時間: 2025-3-27 21:58 作者: chance 時間: 2025-3-28 04:12 作者: 手術刀 時間: 2025-3-28 06:40 作者: 法律 時間: 2025-3-28 14:11
Timed Automata Can Always Be Made Implementablell positive parameter..We propose a construction which makes timed automata implementable in the above sense: From any timed automaton ., we build a timed automaton .′ that exhibits the same behaviour as ., and moreover .′ is both robust and samplable by construction.作者: Seminar 時間: 2025-3-28 15:50 作者: 小母馬 時間: 2025-3-28 21:44
A Spectrum of Behavioral Relations over LTSs on Probability Distributionsof a notion of bisimulation/simulation defined on a LTS of probability distributions (DLTS). We show that the standard spectrum of behavioral relations on nonprobabilistic LTSs as well as its logical characterization in terms of Hennessy-Milner logic scales to the probabilistic setting when considering DLTSs.作者: MUT 時間: 2025-3-29 01:13
Fixed-Delay Events in Generalized Semi-Markov Processes Revisited such a GSMP always possesses an invariant measure which means that the frequencies of states are always well defined and we provide algorithms for approximation of these frequencies. Additionally, we show that the positive results remain valid even if we allow an arbitrary number of reasonably restricted fixed-delay events.作者: 現(xiàn)實 時間: 2025-3-29 06:52
An Automaton over Data Words That Captures EMSO Logicl existential monadic second-order logic that does not impose any restriction on the number of variables. We study the realizability problem and show that every formula from that logic can be effectively, and in elementary time, translated into an equivalent class register automaton.作者: machination 時間: 2025-3-29 10:55 作者: DUCE 時間: 2025-3-29 15:04
https://doi.org/10.1007/978-3-322-95003-1on of the separation of processes is given and is shown to be stronger than existing race-freedom results for the logic. Exploiting this, sufficient criteria are then established for an operation of refinement of processes capable of changing the atomicity of assignments.作者: Diastole 時間: 2025-3-29 19:30
Granularity and Concurrent Separation Logicon of the separation of processes is given and is shown to be stronger than existing race-freedom results for the logic. Exploiting this, sufficient criteria are then established for an operation of refinement of processes capable of changing the atomicity of assignments.作者: right-atrium 時間: 2025-3-29 20:37 作者: Evolve 時間: 2025-3-30 03:20
https://doi.org/10.1007/978-3-8350-9151-1ultiply..This paper presents, two decades after .-set consensus was introduced, the generalization with .?>?1 of state machine replication. We show that with .-set consensus, any number of processes can emulate . state machines of which at least one remains highly available. While doing so, we also 作者: 裝入膠囊 時間: 2025-3-30 06:38
https://doi.org/10.1007/978-3-662-39719-0en multiplicity does not occur. For this subclass, we define abstract processes as equivalence classes of Goltz-Reisig processes. We justify this approach by showing that we obtain exactly one maximal abstract process if and only if the underlying net is conflict-free with respect to a canonical not作者: Decimate 時間: 2025-3-30 11:32 作者: 威脅你 時間: 2025-3-30 15:23 作者: 去掉 時間: 2025-3-30 16:47 作者: 量被毀壞 時間: 2025-3-30 23:03
Generalized Universalityultiply..This paper presents, two decades after .-set consensus was introduced, the generalization with .?>?1 of state machine replication. We show that with .-set consensus, any number of processes can emulate . state machines of which at least one remains highly available. While doing so, we also 作者: 虛度 時間: 2025-3-31 02:50
On Causal Semantics of Petri Netsen multiplicity does not occur. For this subclass, we define abstract processes as equivalence classes of Goltz-Reisig processes. We justify this approach by showing that we obtain exactly one maximal abstract process if and only if the underlying net is conflict-free with respect to a canonical not作者: 粗野 時間: 2025-3-31 05:43
On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freexpressiveness of a recently proposed deterministic freeze logic .[..,..] (with NP-complete satisfiability) to .. As our second main result, we show by an explicit reduction that .[..,..] lies strictly within the unary, non-punctual logic .[..,.. ]. This shows that deterministic freezing with punctua作者: 關心 時間: 2025-3-31 12:28
Advanced Ramsey-Based Büchi Automata Inclusion Testingmples. The new algorithm was implemented and tested on automata derived from real-world model checking benchmarks, and on the Tabakov-Vardi random model, thus showing the usefulness of the proposed techniques.作者: Foam-Cells 時間: 2025-3-31 13:23
Full Abstraction in a Subtyped pi-Calculus with Linear Typesed calculus, we introduce a new proof method centring on non-deterministic computational adequacy and definability. Partially suggested by a technique used by Quaglia and Walker for their full abstraction result, the new proof method extends the framework used in game-based semantics to the May/Must作者: antenna 時間: 2025-3-31 20:32
https://doi.org/10.1007/978-3-642-23217-6concurrent processes; distributed computing; model checking; probabilistic automata; reactive systems; sy作者: 溫和女孩 時間: 2025-3-31 21:57
978-3-642-23216-9Springer-Verlag GmbH Berlin Heidelberg 2011作者: MURAL 時間: 2025-4-1 04:43
