作者: 防銹 時間: 2025-3-21 21:08 作者: Habituate 時間: 2025-3-22 04:27
An action based framework for verifying logical and behavioural properties of concurrent systems,s algebra and its associated logics. The logic is an action based version of the branching time logic CTL which we call ACTL; it is interpreted over transition labelled structures while CTL is interpreted over state labelled ones. The core of the system are two existing tools, AUTO and EMC. The firs作者: pus840 時間: 2025-3-22 07:38
A linear-time model-checking algorithm for the alternation-free modal mu-calculus,ystems of equations. This logic is as expressive as the alternation-free fragment of the modal mu-calculus identified by Emerson and Lei, and it may therefore be used to encode a number of temporal logics and behavioral preorders. Our algorithm determines whether a process satisfies a formula in tim作者: HAIL 時間: 2025-3-22 11:42
Automatic temporal verification of buffer systems,em for verifying RTL definable properties of such systems. The proof method is modular. Although our method is not complete, we feel, as illustrated by the example, that it can be applied to some practical examples. Theorem 3.1 holds for any fragment . of temporal logic as long as the formulae in . 作者: 啜泣 時間: 2025-3-22 14:52
Mechanically checked proofs of kernel specifications,yer-Moore theorem prover to prove the correctness of an implementation. The kernel specification had first been given in terms of a labeled transition system. It was transcribed into the Boyer-Moore logic so that an attempt could be made to mechanically check correctness proofs.作者: 啜泣 時間: 2025-3-22 20:52
A top down approach to the formal specification of SCI cache coherence,andard called the Scalable Coherent Interface. We first give the the most abstract (top level) specification of a memory system. We then introduce a private cache for each processor, and specify the notion of cache coherence. We refine the specifications of the memory operations for use with caches,作者: monogamy 時間: 2025-3-23 00:12
The lotos model of a fault protected system and its verification using a petri net based approach,st. Contrary to other similar Petri net based techniques, our approach avoids to build the whole Petri net from the Lotos specification before verification. In contrast to finite automata based methods, our method can analyse Lotos systems with unbounded state spaces. Our method is founded on a Plac作者: vasospasm 時間: 2025-3-23 03:49 作者: analogous 時間: 2025-3-23 06:02 作者: –吃 時間: 2025-3-23 12:34
PAM: A process algebra manipulator, by directly manipulating process terms. The logic that PAM implements is equational logic plus recursion, with some features tailored to the particular requirements of process algebras. Equational reasoning is implemented by rewriting, while recursion is dealt with by induction. Proofs are construc作者: incite 時間: 2025-3-23 17:39
A proof assistant for PSF, on state space exploration, we use an axiomatic approach. The axioms we use for the construction of proofs, are based on ACP. Besides these standard axioms we also consider tactics for shortening proofs. We use PSF (Process Specification Formalism), an extension of ACP with abstract data types, to 作者: Inclement 時間: 2025-3-23 20:47 作者: Guileless 時間: 2025-3-24 00:35
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233351.jpg作者: hair-bulb 時間: 2025-3-24 03:57
Computer Aided Verification978-3-540-46763-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: left-ventricle 時間: 2025-3-24 08:36
Denis Cavallucci,Stelian Brad,Pavel Livotovyer-Moore theorem prover to prove the correctness of an implementation. The kernel specification had first been given in terms of a labeled transition system. It was transcribed into the Boyer-Moore logic so that an attempt could be made to mechanically check correctness proofs.作者: 柔美流暢 時間: 2025-3-24 12:54 作者: caldron 時間: 2025-3-24 18:14
Mechanically checked proofs of kernel specifications,yer-Moore theorem prover to prove the correctness of an implementation. The kernel specification had first been given in terms of a labeled transition system. It was transcribed into the Boyer-Moore logic so that an attempt could be made to mechanically check correctness proofs.作者: Expostulate 時間: 2025-3-24 20:54
Avoiding state explosion by composition of minimal covering graphs,cation of Petri nets properties from the point of view of reusability of partial results already obtained. We give two algorithms which allow to compute the minimal covering graph of a Petri net by composing the minimal covering graphs of each of its modules.作者: 故意釣到白楊 時間: 2025-3-25 00:56
Procure Software Delivery EnvironmentWe present a sound and complete tableau proof system for establishing whether a set of elements of an arbitrary transition system model has a property expressed in (a slight extension of) the modal mu-calculus. The proof system, we beleive, offers a very general verification method applicable to a wide range of computational systems.作者: 法律 時間: 2025-3-25 04:18
Add Monitoring, Logging and AlertingWe show that the branching bisimulation equivalence introduced by Rob van Glabbeek is decidable for the class of normed, recursively defined BPA processes with silent actions, thus generalizing the decidability result for strong bisimilarity by Baeten, Bergstra, and Klop.作者: 附錄 時間: 2025-3-25 09:57 作者: V洗浴 時間: 2025-3-25 14:47
https://doi.org/10.1007/978-3-540-76801-2This paper describes decision procedures for bisimulation and simulation relations between two transition systems. The algorithms proposed here do not need to previously construct them: the verification can be performed during their generation. In addition, a diagnosis is computed when the two transitions systems are not equivalent.作者: AVANT 時間: 2025-3-25 18:30
Taming infinite state spaces,We present a sound and complete tableau proof system for establishing whether a set of elements of an arbitrary transition system model has a property expressed in (a slight extension of) the modal mu-calculus. The proof system, we beleive, offers a very general verification method applicable to a wide range of computational systems.作者: 加劇 時間: 2025-3-25 20:02 作者: LEER 時間: 2025-3-26 00:58 作者: 生命層 時間: 2025-3-26 06:27
,“On the fly” verification of behavioural equivalences and preorders,This paper describes decision procedures for bisimulation and simulation relations between two transition systems. The algorithms proposed here do not need to previously construct them: the verification can be performed during their generation. In addition, a diagnosis is computed when the two transitions systems are not equivalent.作者: 洞察力 時間: 2025-3-26 08:59
Procure Software Delivery Environmente to Milner‘s observation equivalence. This paper presents an algorithm which, given two branching bisimulation inequivalent finite state processes, produces a distinguishing formula in Hennessy-Milner logic extended with an ‘until’ operator. The algorithm, which is a modification of an algorithm du作者: 較早 時間: 2025-3-26 14:19 作者: heterogeneous 時間: 2025-3-26 18:14
https://doi.org/10.1007/978-1-4842-7252-7s algebra and its associated logics. The logic is an action based version of the branching time logic CTL which we call ACTL; it is interpreted over transition labelled structures while CTL is interpreted over state labelled ones. The core of the system are two existing tools, AUTO and EMC. The firs作者: 一小塊 時間: 2025-3-26 21:55 作者: 保全 時間: 2025-3-27 04:29 作者: deceive 時間: 2025-3-27 07:01
Denis Cavallucci,Stelian Brad,Pavel Livotovyer-Moore theorem prover to prove the correctness of an implementation. The kernel specification had first been given in terms of a labeled transition system. It was transcribed into the Boyer-Moore logic so that an attempt could be made to mechanically check correctness proofs.作者: 使入迷 時間: 2025-3-27 11:26
Andrei Vlad Florian,Stelian Bradandard called the Scalable Coherent Interface. We first give the the most abstract (top level) specification of a memory system. We then introduce a private cache for each processor, and specify the notion of cache coherence. We refine the specifications of the memory operations for use with caches,作者: 多嘴多舌 時間: 2025-3-27 16:28
https://doi.org/10.1007/978-3-540-76801-2st. Contrary to other similar Petri net based techniques, our approach avoids to build the whole Petri net from the Lotos specification before verification. In contrast to finite automata based methods, our method can analyse Lotos systems with unbounded state spaces. Our method is founded on a Plac作者: Vertebra 時間: 2025-3-27 20:35
Emergence, Locating and Measuring It, on the finite graph of the executions. We consider errors whose diagnostics are sequences of the graph. We define a minimality criterium for the diagnostics such that a finite number of minimal diagnostics give all the reasons of the error. Diagnostics are produced in a simplified form according to作者: synovium 時間: 2025-3-28 01:21 作者: patriot 時間: 2025-3-28 04:56
,Predicting Emergence from Cell’s Structure, by directly manipulating process terms. The logic that PAM implements is equational logic plus recursion, with some features tailored to the particular requirements of process algebras. Equational reasoning is implemented by rewriting, while recursion is dealt with by induction. Proofs are construc作者: Addictive 時間: 2025-3-28 07:34
Applications of Emergent Phenomena, on state space exploration, we use an axiomatic approach. The axioms we use for the construction of proofs, are based on ACP. Besides these standard axioms we also consider tactics for shortening proofs. We use PSF (Process Specification Formalism), an extension of ACP with abstract data types, to 作者: compose 時間: 2025-3-28 13:45 作者: 有毛就脫毛 時間: 2025-3-28 17:35 作者: exhibit 時間: 2025-3-28 20:11 作者: 蜈蚣 時間: 2025-3-29 00:11
Procure Software Delivery Environmente to Cleaveland, works in conjunction with a partition-refinement algorithm for deciding branching bisimulation equivalence. Our algorithm provides a useful extension to the algorithm for deciding equivalence because it tells a user . certain finite state systems are inequivalent.作者: 逗留 時間: 2025-3-29 06:14
Summarization as a Denoising Extraction Tooldo not distinguish between two computations one of which is a stuttered extension of the other. In this case, we can use our approach for proving properties given by formulae in . as long as the theory of fifo buffers in the logic . is decidable.作者: 滲入 時間: 2025-3-29 10:14 作者: flavonoids 時間: 2025-3-29 13:15 作者: ELATE 時間: 2025-3-29 16:24 作者: 縮影 時間: 2025-3-29 20:15
https://doi.org/10.1007/978-3-540-76801-2ation. In contrast to finite automata based methods, our method can analyse Lotos systems with unbounded state spaces. Our method is founded on a Place/Transitionnet Lotos semantics. The method is applied to the verification of the Lotos model of fault protected system.作者: MELON 時間: 2025-3-30 00:31
Emergence, Locating and Measuring It,nostics such that a finite number of minimal diagnostics give all the reasons of the error. Diagnostics are produced in a simplified form according to a given abstraction. We define an equivalence on models which preserves the simplified diagnostics.作者: Agility 時間: 2025-3-30 06:45 作者: 無能的人 時間: 2025-3-30 09:44
Applications of Emergent Phenomena,axioms we also consider tactics for shortening proofs. We use PSF (Process Specification Formalism), an extension of ACP with abstract data types, to describe the processes subject to the verification.作者: Omniscient 時間: 2025-3-30 15:38 作者: Mettle 時間: 2025-3-30 20:25
A top down approach to the formal specification of SCI cache coherence,rivate cache for each processor, and specify the notion of cache coherence. We refine the specifications of the memory operations for use with caches, and finally outline the more complex bottom layers where directory structures and concurrency are introduced.作者: Factorable 時間: 2025-3-30 21:12
The lotos model of a fault protected system and its verification using a petri net based approach,ation. In contrast to finite automata based methods, our method can analyse Lotos systems with unbounded state spaces. Our method is founded on a Place/Transitionnet Lotos semantics. The method is applied to the verification of the Lotos model of fault protected system.作者: 格子架 時間: 2025-3-31 03:32
Error diagnosis in finite communicating systems,nostics such that a finite number of minimal diagnostics give all the reasons of the error. Diagnostics are produced in a simplified form according to a given abstraction. We define an equivalence on models which preserves the simplified diagnostics.作者: 污點(diǎn) 時間: 2025-3-31 05:01 作者: 集合 時間: 2025-3-31 09:56 作者: STANT 時間: 2025-3-31 13:28
Conference proceedings 199291. The objectiveof this series of workshops is to bring togetherresearchersand practitioners interested in the development and use ofmethods, tools and theories for automatic verification of(finite) state systems. The workshop provides a uniqueopportunity for comparing the numerous verification met作者: 別炫耀 時間: 2025-3-31 21:16 作者: 虛弱 時間: 2025-4-1 01:16 作者: hypertension 時間: 2025-4-1 02:00
https://doi.org/10.1007/978-1-4842-7252-7system, . on these subcomponents can be found. Hence the process variables make it possible to specify and reason about what are often referred to as ., and ...As reductions are algorithms that work on syntax, they can be considered as forming a bridge between traditional non-compositional model checking and compositional proof systems.作者: 突襲 時間: 2025-4-1 08:58
https://doi.org/10.1007/978-1-4842-7252-7ng time logic ACTL to CTL and from transition-labelled to state-labelled structures. The correctness of the integration is guaranteed by the proof that the two functions when coupled preserve satisfiability of logical formulae.作者: 詼諧 時間: 2025-4-1 14:11
Compositional checking of satisfaction,system, . on these subcomponents can be found. Hence the process variables make it possible to specify and reason about what are often referred to as ., and ...As reductions are algorithms that work on syntax, they can be considered as forming a bridge between traditional non-compositional model checking and compositional proof systems.作者: Nutrient 時間: 2025-4-1 15:37 作者: 填料 時間: 2025-4-1 19:10
