作者: Champion 時間: 2025-3-21 23:48 作者: Diaphragm 時間: 2025-3-22 00:45 作者: Sarcoma 時間: 2025-3-22 07:48 作者: Rustproof 時間: 2025-3-22 10:27
A universal reactive machine, universal Turing machine simulates it. We introduce the concept of universality for reactive systems and construct a CCS process universal in the sense that, given an encoding of . CCS process, it behaves like this process up to weak bisimulation. This construction has a rather non-constructive use作者: Parallel 時間: 2025-3-22 16:45 作者: Parallel 時間: 2025-3-22 20:55
Adding partial orders to linear temporal logic,xecution sequences. This is a desirable feature in specifying concurrent systems which allows formalizing frequently used arguments such as ‘in an equivalent execution sequence’, or ‘in a consistent global state, not necessarily on the execution sequence’ to be formalized. However, due to the additi作者: Congruous 時間: 2025-3-22 23:42
Reachability analysis of pushdown automata: Application to model-checking,e automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (such as model-checking for branching-time logics), we consider the more general class of . pushdown systems and use . finite-state automata as a representation struct作者: Favorable 時間: 2025-3-23 01:23
Synthesis of nets with inhibitor arcs,aper we deal with the synthesis of elementary net systems extended with inhibitor arcs, i.e. arcs that test for absence of tokens in a place. We characterize the class of transitions systems corresponding to the sequential execution of these nets, which is a proper extension of the one obtained by t作者: 易于 時間: 2025-3-23 07:18
An algebraic theory of multiple clocks,f Milner‘s CCS that combines the idea of . from the algebra PMC with the assumption of . familiar from timed process algebras such as TPL. Using a typical class of examples drawn from hardware design, we motivate why these features are useful and in some cases necessary for modeling and verifying di作者: –DOX 時間: 2025-3-23 12:18 作者: 愛好 時間: 2025-3-23 17:44 作者: Aids209 時間: 2025-3-23 19:34
Axiomatizing flat iteration,of atomic actions. It generalizes prefix iteration, in which the first argument is a single action. Complete finite equational axiomatizations are given for five notions of bisimulation congruence over basic CCS with flat iteration, viz. strong congruence, branching congruence, .-congruence, delay c作者: 慢慢啃 時間: 2025-3-23 23:31 作者: ANT 時間: 2025-3-24 04:22
On the complexity of verifying concurrent transition systems,the program‘s implementation correlate with the behaviors of a transition system that models its specification. In this paper, we investigate the effect of concurrency on the complexity of implementation verification. We consider trace-based and tree-based approaches to the verification of concurren作者: 打火石 時間: 2025-3-24 08:37 作者: ANTE 時間: 2025-3-24 13:54 作者: 多節(jié) 時間: 2025-3-24 15:00
Reachability analysis of pushdown automata: Application to model-checking,ncorporate this procedure into the automata-theoretic approach to model-checking to define new model-checking algorithms for pushdown systems against both linear and branching-time properties. From these results we derive upper bounds for several model-checking problems as well as matching lower bounds.作者: 要素 時間: 2025-3-24 21:31 作者: PHIL 時間: 2025-3-24 23:29
A Comparison of FTZs in the World,chronously) cyclic? The question is of interest because many real-world systems are composed partially of cyclic sequential processes and have behaviour which is conceived of as being made up of transactions, which in our case are the asynchronous cycles.作者: Blood-Vessels 時間: 2025-3-25 04:27 作者: cloture 時間: 2025-3-25 07:41 作者: Tdd526 時間: 2025-3-25 14:19 作者: Confound 時間: 2025-3-25 19:51
A universal reactive machine,se that, given an encoding of . CCS process, it behaves like this process up to weak bisimulation. This construction has a rather non-constructive use of silent actions and we argue that this would be the case for any universal CCS process.作者: 調(diào)色板 時間: 2025-3-25 22:31
Proving safety properties of infinite state systems by compilation into Presburger arithmetic,ity sets. Our implementation is made of a decomposition module and an arithmetic module, the latter being built upon Boudet-Comon‘s algorithm for solving the decision problem for Presburger arithmetic. Our approach will be illustrated on three nontrivial examples of Petri nets with unbounded places and parametric initial markings.作者: Little 時間: 2025-3-26 02:24
Conference proceedings 1997997..The 24 revised full papers presented were selected by the program committee for inclusion in the volume from a total of 41 high-quality submissions. The volume covers all current topics in the science of concurrency theory and its applications, such as reactive systems, hybrid systems, model ch作者: hereditary 時間: 2025-3-26 07:04
Conference proceedings 1997ns. The volume covers all current topics in the science of concurrency theory and its applications, such as reactive systems, hybrid systems, model checking, partial orders, state charts, program logic calculi, infinite state systems, verification, and others.作者: 彎彎曲曲 時間: 2025-3-26 09:14 作者: negotiable 時間: 2025-3-26 13:49 作者: exorbitant 時間: 2025-3-26 19:27
Institutional and Financial Analysis,ntersection. We show that the denotational model of. (resp. .) is conservative over . (resp. tcc). We also show that the denotational models are fully abstract for an operational semantics that records probability information.作者: 后退 時間: 2025-3-26 20:56 作者: filicide 時間: 2025-3-27 02:59
Synthesis of nets with inhibitor arcs,he execution of nets without inhibitor arcs. Finally, we try to minimize the number of inhibitor arcs; we look for conditions guaranteeing that an inhibitor arc is really used, i.e. its presence influences the behaviour of the net.作者: ALLEY 時間: 2025-3-27 05:37 作者: Obvious 時間: 2025-3-27 12:12 作者: Offensive 時間: 2025-3-27 17:39 作者: 溫室 時間: 2025-3-27 17:57 作者: Interim 時間: 2025-3-27 23:17 作者: ineluctable 時間: 2025-3-28 02:55 作者: FACET 時間: 2025-3-28 08:14
Deterministic Time Table Transit Assignmentcharts, which allow refinement of arbitrary states, in contrast to concepts in the literature where only basic and root states are subject of refinement. The third main result shows that refinement morphisms are compatible with the behavior of statecharts as defined in the formal semantics.作者: geometrician 時間: 2025-3-28 13:14 作者: Simulate 時間: 2025-3-28 17:22 作者: yohimbine 時間: 2025-3-28 21:08 作者: Synchronism 時間: 2025-3-29 02:13
https://doi.org/10.1007/978-981-10-0218-2t a symbolic procedure for checking the receptiveness of linear hybrid modules. Finally, we present an assume-guarantee principle for reasoning about timed and hybrid modules, and a method for synthesizing receptive controllers of timed and hybrid modules.作者: 退潮 時間: 2025-3-29 06:35
An Overview of European National Modelsis turned out to be much simpler than the only direct proof found. In the setting of flat iteration on the other hand, the completeness theorems for delay and weak (but not .-) congruence can equally well be obtained by reduction to the one for strong congruence, without using branching congruence a作者: 寡頭政治 時間: 2025-3-29 11:17 作者: Finasteride 時間: 2025-3-29 11:47 作者: 試驗 時間: 2025-3-29 17:49
Modularity for timed and hybrid systems,t a symbolic procedure for checking the receptiveness of linear hybrid modules. Finally, we present an assume-guarantee principle for reasoning about timed and hybrid modules, and a method for synthesizing receptive controllers of timed and hybrid modules.作者: 粗糙濫制 時間: 2025-3-29 22:51 作者: Infiltrate 時間: 2025-3-30 00:39
Fair simulation, by . (?AFMC is the universal fragment of the alternation-free .-calculus). The locality of the definition leads us to a polynomial-time algorithm for checking fair simulation for finite-state systems with weak and strong fairness constraints. Finally, fair simulation implies fair trace-containment,作者: 無能力 時間: 2025-3-30 05:24 作者: convert 時間: 2025-3-30 10:01 作者: Diastole 時間: 2025-3-30 15:11 作者: GRIN 時間: 2025-3-30 18:13
A Comparison of FTZs in the World,ary results of an investigation into the following. Given that all the processes are cyclic, in what circumstances will the system as a whole be (asynchronously) cyclic? The question is of interest because many real-world systems are composed partially of cyclic sequential processes and have behavio作者: GRAIN 時間: 2025-3-30 23:16
https://doi.org/10.1007/978-981-10-0218-2Firstly, the until operator is strengthened by indexing it with the regular programs of propositional dynamic logic (PDL). Secondly, the core formulas of the logic are decorated with names of sequential agents drawn from fixed finite set. The resulting logic has a natural semantics in terms of the r作者: 類型 時間: 2025-3-31 03:32
https://doi.org/10.1007/978-981-10-0218-2 able to meet its liveness assumptions no matter how the other modules behave. In a real-time world, liveness is automatically present in the form of .. The receptiveness condition, then, translates to the requirement that a module must be able to let time diverge no matter how the environment behav作者: Madrigal 時間: 2025-3-31 08:41 作者: Contort 時間: 2025-3-31 12:13 作者: Parameter 時間: 2025-3-31 14:26 作者: 對待 時間: 2025-3-31 21:24
Studies in International Performancee automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (such as model-checking for branching-time logics), we consider the more general class of . pushdown systems and use . finite-state automata as a representation struct作者: dermatomyositis 時間: 2025-3-31 22:59 作者: BILL 時間: 2025-4-1 05:51 作者: 難解 時間: 2025-4-1 07:37
Deterministic Time Table Transit Assignmenttion nets developed by Meseguer and Montanari. We apply the framework of high-level-replacement systems, a categorical generalization of graph transformation systems, in order to define union as horizontal as well as transformation and refinement as vertical structuring techniques for statecharts. T作者: 痛打 時間: 2025-4-1 14:11
Tom E. Worsley,Russell C. E. Harrists within Presburger arithmetic. An application of our method is the automatic verification of safety properties of Petri nets with infinite reachability sets. Our implementation is made of a decomposition module and an arithmetic module, the latter being built upon Boudet-Comon‘s algorithm for solv作者: ANTH 時間: 2025-4-1 16:22
An Overview of European National Modelsof atomic actions. It generalizes prefix iteration, in which the first argument is a single action. Complete finite equational axiomatizations are given for five notions of bisimulation congruence over basic CCS with flat iteration, viz. strong congruence, branching congruence, .-congruence, delay c作者: Aerophagia 時間: 2025-4-1 20:34
