作者: 和諧 時(shí)間: 2025-3-21 22:36 作者: 違反 時(shí)間: 2025-3-22 01:11
Thomas A. Henzinger,Barbara Jobstmann,Verena Wolfnal and technical levels. In particular, policies are a cornerstone for the governance system of financial institutions. In international organizations, a lot of policies span all country-local representatives and span all organizational levels. This work is part of a series concerning the improveme作者: avulsion 時(shí)間: 2025-3-22 08:36 作者: 遺傳學(xué) 時(shí)間: 2025-3-22 11:35 作者: 僵硬 時(shí)間: 2025-3-22 15:45 作者: 談判 時(shí)間: 2025-3-22 20:14
Parosh Aziz Abdulla,Giorgio Delzanno,Ahmed Rezinebuted and heterogeneous partial models. A main goal of the presented project is to provide engineers with integrated views on the relevant technical planning information. To realise this, two aspects have to be considered: access level integration and semantic level integration. For the integration 作者: 描述 時(shí)間: 2025-3-22 21:51 作者: 審問 時(shí)間: 2025-3-23 03:49
Roberto Barbuti,Francesca Levi,Paolo Milazzo,Guido Scatena, all stakeholders have to adhere to common standards. Currently, cross-organizational business relationships are being setup based on a wide variety of existing standards that involve different technical representations, semantics and process specifications. The resulting business standards dilemma作者: 吊胃口 時(shí)間: 2025-3-23 07:24
Yohan Boichut,Pierre-Cyrille Héam,Olga Kouchnarenko like cost reduction, efficiency, flexibility and the focus on core competencies. New solutions in e-Procurement of raw and semi-finished materials are likely to be developed in the coming years, as stakeholders realize the significant benefits of a seamless collaboration supported on interoperable 作者: arousal 時(shí)間: 2025-3-23 10:24 作者: 使長胖 時(shí)間: 2025-3-23 16:03 作者: 大酒杯 時(shí)間: 2025-3-23 19:25
Eero Lehtonenol means that readers can learn about the environment in man.Interoperability: the ability of a system or a product to work with other systems or products without special effort from the user is a key issue in manufacturing and industrial enterprise generally. It is fundamental to the production of 作者: 膝蓋 時(shí)間: 2025-3-23 22:19 作者: chronology 時(shí)間: 2025-3-24 05:01
Mila Majster-Cederbaum,Christoph Minnameierto meet the increasing users demand in connectivity, among which mega cities that have introduce air mobility. This latter will increase the mobility externalities and complexify its management. In the past decade, mobility as a service paradigm has been proven as the best approach to address such i作者: 狼群 時(shí)間: 2025-3-24 07:38 作者: 殘廢的火焰 時(shí)間: 2025-3-24 10:54
Mouna Chaouch-Saad,Bernadette Charron-Bost,Stephan Merzgineers and computer scientists working in manufacturing and other process industries and to software engineers and electronic and manufacturing engineers working in the academic environment..978-1-84996-758-7978-1-84800-221-0Series ISSN 2199-2533 Series E-ISSN 2199-2541 作者: BRUNT 時(shí)間: 2025-3-24 15:31
Pieter Collins,Ivan S. Zapreevgineers and computer scientists working in manufacturing and other process industries and to software engineers and electronic and manufacturing engineers working in the academic environment..978-1-84996-758-7978-1-84800-221-0Series ISSN 2199-2533 Series E-ISSN 2199-2541 作者: faucet 時(shí)間: 2025-3-24 22:56 作者: 解脫 時(shí)間: 2025-3-25 01:36
cross newly digital value chains. The resulting complexity makes integration even harder than it was before – and it was near impossible before. There is some hope, however. That hope is formal modeling, with associated metrics and continuous improvement of processes based on customer and supplier f作者: Influx 時(shí)間: 2025-3-25 03:37 作者: incubus 時(shí)間: 2025-3-25 08:55 作者: Vldl379 時(shí)間: 2025-3-25 13:47 作者: chapel 時(shí)間: 2025-3-25 17:54 作者: Herbivorous 時(shí)間: 2025-3-25 21:22
Moshe Y. Vardibe delivered by the processes. This research proposes a method for constructing policy models. Ontology is defined for interoperability purposes of the models of different organizational levels. The main formal analyse that is used for verification purposes is the reliability of the policy system an作者: 打包 時(shí)間: 2025-3-26 03:53 作者: Transfusion 時(shí)間: 2025-3-26 05:53
Mohamed Faouzi Atig,Peter Habermehlineers with integrated transparent views on the model data, domain specific ontologies and mappings between these ontologies and different database schemas have been developed. A combined approach for the integration of distributed heterogeneous partial models in civil engineering planning processes作者: 腐爛 時(shí)間: 2025-3-26 12:32 作者: 摻和 時(shí)間: 2025-3-26 13:04 作者: 小卷發(fā) 時(shí)間: 2025-3-26 19:34 作者: 無能的人 時(shí)間: 2025-3-27 00:53
Mila Majster-Cederbaum,Christoph Minnameierontext of multidimensional urban mobility, which includes land and air modes. To that end, we present and discuss the building blocks of the underlying system and show which kinds of the interoperability occur and provide directions to solve them, within the frame of mobility as a service (MaaS).作者: Curmudgeon 時(shí)間: 2025-3-27 04:52
Anil Seth research gaps related to semantic reconciliation and the extraction of knowledge perspectives, in which semantic issues are approached through different points of view and multiple domains. The proposed approach considers unprocessed product requirements, further translated in features, and by that作者: 野蠻 時(shí)間: 2025-3-27 06:01 作者: 極大痛苦 時(shí)間: 2025-3-27 09:33
0302-9743 n logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures and predictability in iterative maps and new computational paradigms.978-3-642-04419-9978-3-642-04420-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: faculty 時(shí)間: 2025-3-27 16:49
On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems,s as well as (unbounded) dynamic creation of parallel threads. Each procedure can have a finite number of local variables, and there is a finite number of global variables that can be accessed by all parallel threads. We assume that these variables range over a finite data domain (e.g., booleans).作者: 矛盾 時(shí)間: 2025-3-27 20:18
Formalisms for Specifying Markovian Population Models,ix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models— all describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, ease of 作者: Inexorable 時(shí)間: 2025-3-27 23:20
Model Checking as A Reachability Problem,automaton that accepts traces violating the specification. We then use graph algorithms to search the product graph for a counterexample trace. The basic theory of this approach was worked out in the 1980s, and the basic algorithms were developed during the 1990s. Both explicit and symbolic implemen作者: 斷言 時(shí)間: 2025-3-28 04:17 作者: Jocose 時(shí)間: 2025-3-28 06:22 作者: disparage 時(shí)間: 2025-3-28 13:36
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates,This allows biological systems modelling when the exact rates are not known, but are supposed to lie in some intervals. On these (abstract) models we perform probabilistic model checking obtaining lower and upper bounds for the probabilities of reaching states satisfying given properties. These boun作者: 清楚說話 時(shí)間: 2025-3-28 17:22
How to Tackle Integer Weighted Automata Positivity,abstractions is studied to build the deterministic reachability graphs allowing us to semi-decide the positivity problem on these automata. Moreover, the papers reports on the implementations and experimental results, and discusses other encodings.作者: ABOUT 時(shí)間: 2025-3-28 18:47 作者: ARCHE 時(shí)間: 2025-3-28 22:55 作者: Memorial 時(shí)間: 2025-3-29 06:53
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order,cally. In this model the set of successors of a regular set of configurations can be non-regular, making forward analysis of these models difficult. We refine the model by adding the associative-commutative properties of parallel composition, and we define Presburger weighted tree automata, an exten作者: interlude 時(shí)間: 2025-3-29 09:02 作者: foodstuff 時(shí)間: 2025-3-29 11:40
Abstract Counterexamples for Non-disjunctive Abstractions,ly used, for example in selecting predicates for predicate abstraction. To date, however, it has been applied primarily to powerset abstractions, which allow one to speak of an abstract transition system and abstract states. Here, we describe a general framework for CEGAR in non-disjunctive abstract作者: 乏味 時(shí)間: 2025-3-29 18:24
Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Basednent-based systems to obtain a first approximation of the reachable global state space. In order to improve this approximation we introduce a new technique we call cross-checking. The resulting approximation can be used to study global properties of component-based systems, which we demonstrate here作者: Lignans 時(shí)間: 2025-3-29 22:08
0302-9743 009. The 20 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes作者: promote 時(shí)間: 2025-3-30 02:36
Automatic Verification of Directory-Based Consistency Protocols,cation procedure computes an approximated backward reachability analysis by using a symbolic representation of sets of configurations. Termination is ensured by using the theory of well-quasi orderings.作者: consolidate 時(shí)間: 2025-3-30 07:12
Abstract Counterexamples for Non-disjunctive Abstractions,d Predicate Abstraction (IPA), a promising technique for synthesizing quantified inductive invariants of infinite-state systems. In principle, it can be applied to other non-disjunctive abstractions occurring in program analysis.作者: floaters 時(shí)間: 2025-3-30 08:29
Conference proceedings 20090 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics o作者: LIEN 時(shí)間: 2025-3-30 13:48 作者: Hallowed 時(shí)間: 2025-3-30 19:14
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates,perform probabilistic model checking obtaining lower and upper bounds for the probabilities of reaching states satisfying given properties. These bounds are under- and over-approximations, respectively, of the probabilities one would obtain by verifying the models with exact kinetic rates belonging to the intervals.作者: accessory 時(shí)間: 2025-3-30 23:35 作者: pancreas 時(shí)間: 2025-3-31 02:05 作者: 移植 時(shí)間: 2025-3-31 07:08
Model Checking as A Reachability Problem,tations, such as SPIN and and SMV, are widely used. It turns out, however, that there are still many gaps in our understanding of the algorithmic issues involved in automata-theoretic model checking. This talk covers the fundamentals of automata-theoretic model checking, reviews recent progress, and outlines areas that require further research.作者: concubine 時(shí)間: 2025-3-31 12:19
Computable ,, for Discrete-Time and Continuous-Space Dynamic Systems,m, we consider discrete-time continuous-space dynamic systems for which we study the computability of the standard semantics of .. and provide a variant thereof computable in the sense of Type-2 Theory of Effectivity.作者: ticlopidine 時(shí)間: 2025-3-31 15:44 作者: ARCH 時(shí)間: 2025-3-31 20:09 作者: 禍害隱伏 時(shí)間: 2025-3-31 22:39 作者: LATER 時(shí)間: 2025-4-1 02:40
Reachability for Continuous and Hybrid Systems,In this talk I present some past, present and future work concerning reachability computation for continuous and hybrid systems.作者: Affiliation 時(shí)間: 2025-4-1 07:10
Algorithmic Information Theory and Foundations of Probability,The question how and why mathematical probability theory can be applied to the “real world” has been debated for centuries. We try to survey the role of algorithmic information theory (Kolmogorov complexity) in this debate.作者: Alopecia-Areata 時(shí)間: 2025-4-1 12:08
An Undecidable Permutation of the Natural Numbers,In this paper, an undecidability result concerning a permutation of natural numbers is presented. More precisely, it is shown that for a certain piecewise defined permutation, which consists of five affine transformations, it is undecidable whether a given number belongs to a finite cycle or not.作者: 帶來 時(shí)間: 2025-4-1 17:06
The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane,In this paper, we consider the periodic tiling problem which was proved undecidable in the Euclidean plane by Yu. Gurevich and I. Koriakov, see [3]. Here, we prove that the same problem for the hyperbolic plane is also undecidable.作者: 敵意 時(shí)間: 2025-4-1 19:55
