標(biāo)題: Titlebook: CONCUR‘93; 4th International Co Eike Best Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 Automata.Automaten.CONCUR‘93.C [打印本頁] 作者: clannish 時間: 2025-3-21 18:15
書目名稱CONCUR‘93影響因子(影響力)
書目名稱CONCUR‘93影響因子(影響力)學(xué)科排名
書目名稱CONCUR‘93網(wǎng)絡(luò)公開度
書目名稱CONCUR‘93網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱CONCUR‘93被引頻次
書目名稱CONCUR‘93被引頻次學(xué)科排名
書目名稱CONCUR‘93年度引用
書目名稱CONCUR‘93年度引用學(xué)科排名
書目名稱CONCUR‘93讀者反饋
書目名稱CONCUR‘93讀者反饋學(xué)科排名
作者: calamity 時間: 2025-3-21 20:53
https://doi.org/10.1007/978-3-476-03524-0systems to asynchronous transition systems, showing that time gives a link between true concurrency and interleaving. Moreover, we can provide a complete axiomatisation of bisimulation for our algebra; a result that is often problematic in a timed setting..Another advantage of incorporating timing i作者: 襲擊 時間: 2025-3-22 03:20 作者: Migratory 時間: 2025-3-22 08:30
On the ill-timed but well-caused,systems to asynchronous transition systems, showing that time gives a link between true concurrency and interleaving. Moreover, we can provide a complete axiomatisation of bisimulation for our algebra; a result that is often problematic in a timed setting..Another advantage of incorporating timing i作者: Genetics 時間: 2025-3-22 10:17
Branching time temporal logic and amorphous tree automata, .. is linear in |ψ| and the extension required for satisfiability is exponential. Based on that, we get a polynomial model checking procedure and an exponential decision procedure for CTL, both match the known lower bounds. This is the first time that a model checking algorithm for a branching-time作者: 陳腐思想 時間: 2025-3-22 14:00 作者: 陳腐思想 時間: 2025-3-22 20:03 作者: 廢除 時間: 2025-3-22 22:22
https://doi.org/10.1007/978-3-0348-7771-8wait for a message and it is therefore controlled by its environment. We show that the broadcast model of CBS can be interpreted in a model based on synchronous parallelism. This is demonstrated by presenting a translation to SCCS and proving that the translation is correct up to strong bisimulation equivalence.作者: 種子 時間: 2025-3-23 01:28
David J. Krieger,Christian J. J?ggirised on auxiliary proof systems for deciding on equalities or more general boolean identities over the expression language for data. The completeness of these proof systems are thus relative to the completeness of the auxiliary proof systems.作者: GROG 時間: 2025-3-23 08:25 作者: dainty 時間: 2025-3-23 10:30
https://doi.org/10.1007/978-3-658-44120-3ed information. One can thus hope to be able to verify properties of a concurrent system without computing all interleavings of its executions. This paper overviews a collection of techniques that make this possible.作者: 朝圣者 時間: 2025-3-23 14:43 作者: 拾落穗 時間: 2025-3-23 21:10
0302-9743 ic aim of the CONCURconferences is to communicate advances in concurrencytheoryand applications.The volume contains 31 papers selected from 113submissions,together with four invited papers and two abstractsofinvited talks. The invited talks are: "The lambda-calculuswithmultiplicities" (extended abst作者: Buttress 時間: 2025-3-23 22:51
Natur als Grundlage und Ziel der Wirtschaft, further to present a complete axiomatisation for this class of basic parallel processes. This result can be viewed as a proper extension of Milner‘s complete axiomatisation of bisimulation equivalence on regular processes.作者: allergen 時間: 2025-3-24 06:13 作者: 證明無罪 時間: 2025-3-24 08:16
Interpreting broadcast communication in SCCS,wait for a message and it is therefore controlled by its environment. We show that the broadcast model of CBS can be interpreted in a model based on synchronous parallelism. This is demonstrated by presenting a translation to SCCS and proving that the translation is correct up to strong bisimulation equivalence.作者: 離開真充足 時間: 2025-3-24 11:27
Proof systems for message-passing process algebras,rised on auxiliary proof systems for deciding on equalities or more general boolean identities over the expression language for data. The completeness of these proof systems are thus relative to the completeness of the auxiliary proof systems.作者: 小說 時間: 2025-3-24 16:28
Refinement and decomposition of value-passing action systems,cation and refinement is similar to the refinement calculus approach [1, 10, 12]. The theoretical basis for communication and distribution is Hoare‘s CSP [6]. Use of the refinement and decomposition rules is illustrated by the design of an unordered buffer.作者: 削減 時間: 2025-3-24 19:15 作者: 多產(chǎn)子 時間: 2025-3-25 02:36 作者: Obedient 時間: 2025-3-25 04:34 作者: 受人支配 時間: 2025-3-25 08:32 作者: mastoid-bone 時間: 2025-3-25 12:58 作者: bromide 時間: 2025-3-25 17:03 作者: Pandemic 時間: 2025-3-25 21:30 作者: 整體 時間: 2025-3-26 02:40
,On the reduction of chocs bisimulation to π-calculus bisimulation,ere is a simple definition of bisimulation for . which satisfies natural laws and congruence rules, moreover the synchronization trees associated to . processes are finitely branching. We propose . as an intermediate step towards the definition of a tool for the verification of Chocs bisimulation.作者: 用不完 時間: 2025-3-26 06:46 作者: Instrumental 時間: 2025-3-26 11:24
Conference proceedings 1993the CONCURconferences is to communicate advances in concurrencytheoryand applications.The volume contains 31 papers selected from 113submissions,together with four invited papers and two abstractsofinvited talks. The invited talks are: "The lambda-calculuswithmultiplicities" (extended abstract) by G作者: 可行 時間: 2025-3-26 14:10
Aldo Clerico MD,Michele Emdin MD, PhDA multiset (or Petri net) semantics is defined for the .-calculus with replication. The semantic mapping is a strong bisimulation, and structurally congruent processes have the same semantics.作者: 鬼魂 時間: 2025-3-26 19:03 作者: 用手捏 時間: 2025-3-26 22:35
A multiset semantics for the pi-calculus with replication,A multiset (or Petri net) semantics is defined for the .-calculus with replication. The semantic mapping is a strong bisimulation, and structurally congruent processes have the same semantics.作者: DAMP 時間: 2025-3-27 01:30 作者: CHARM 時間: 2025-3-27 07:36
https://doi.org/10.1007/3-540-57208-2Automata; Automaten; CONCUR‘93; Concurrency; Parallelism; Program Verification; Programmiersemantik; Progra作者: irreducible 時間: 2025-3-27 09:35
978-3-540-57208-4Springer-Verlag Berlin Heidelberg 1993作者: APEX 時間: 2025-3-27 14:53
Daniel Villarreal,Ronald H. Freemanimplified before verifying that it satisfies a temporal logic formula. Most previous work on this problem is based on property-preserving mappings between transition systems. The results presented here allow direct simplification of process terms for some important classes of temporal properties.作者: Panther 時間: 2025-3-27 18:45
Daniel Villarreal,Ronald H. Freemanram development the CCL rule cannot be derived from simpler ones. Within a non-modular set-up the CCL rule can be . however from a simpler independence rule and an analog of the expansion rule for process algebras.作者: giggle 時間: 2025-3-27 22:54 作者: 孤獨無助 時間: 2025-3-28 02:27 作者: Conscientious 時間: 2025-3-28 09:33
https://doi.org/10.1007/978-3-476-03524-0 a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more effective way to reason about this notion by means of an embedding of Chocs into a richer calculus endowed with a notion of ‘a(chǎn)ctivation’ channel which we christen .. is the name of a new internal action which i作者: 散開 時間: 2025-3-28 12:31
,Naturproduktivit?t und Wirtschaftsproze?,valences, ～ is preserved by name substitution and (hence) by input prefix. The differences among all these equivalences already appear in the sublanguage without restriction: Here the definition of ～ can be factorised into a “standard” part which, modulo the different syntax of actions, is the CCS b作者: Glycogen 時間: 2025-3-28 17:40
Natur als Grundlage und Ziel der Wirtschaft,mposition operator, namely the so-called . and . processes. In this paper, we extend this result to the whole class. The decidability proof permits us further to present a complete axiomatisation for this class of basic parallel processes. This result can be viewed as a proper extension of Milner‘s 作者: 多嘴多舌 時間: 2025-3-28 20:15
David J. Krieger,Christian J. J?ggidden or restricted by translation to noise. This paper types CBS and restricts it to processes with a unique response to each input. Nondeterminism arises only if two processes in parallel both wish to transmit. These restrictions do not reduce the programming power of CBS. But strong and weak bisim作者: Suggestions 時間: 2025-3-28 23:35
https://doi.org/10.1007/978-3-0348-7771-8roadcast communication is an atomic and synchronous event — all participants act at the same instant. However, it is asymmetric in the sense that a sender may autonomously transmit a message without concern to whether anyone is listening, whereas a receiver cannot just receive on its own, it has to 作者: ELUDE 時間: 2025-3-29 05:49 作者: 松果 時間: 2025-3-29 07:13 作者: 加強防衛(wèi) 時間: 2025-3-29 12:30 作者: Ornithologist 時間: 2025-3-29 17:14 作者: 富饒 時間: 2025-3-29 22:50 作者: INCUR 時間: 2025-3-30 02:16 作者: 偶然 時間: 2025-3-30 04:54
Daniel Villarreal,Ronald H. Freemanimplified before verifying that it satisfies a temporal logic formula. Most previous work on this problem is based on property-preserving mappings between transition systems. The results presented here allow direct simplification of process terms for some important classes of temporal properties.作者: analogous 時間: 2025-3-30 10:55 作者: Laconic 時間: 2025-3-30 14:22 作者: 假 時間: 2025-3-30 18:58 作者: callous 時間: 2025-3-30 21:37 作者: Expressly 時間: 2025-3-31 01:19 作者: aggressor 時間: 2025-3-31 06:13 作者: VALID 時間: 2025-3-31 10:13 作者: Eviction 時間: 2025-3-31 17:21 作者: NAIVE 時間: 2025-3-31 20:23
,On the reduction of chocs bisimulation to π-calculus bisimulation, a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more effective way to reason about this notion by means of an embedding of Chocs into a richer calculus endowed with a notion of ‘a(chǎn)ctivation’ channel which we christen .. is the name of a new internal action which i作者: BLANK 時間: 2025-4-1 00:30
,A theory of bisimulation for the π-calculus,valences, ～ is preserved by name substitution and (hence) by input prefix. The differences among all these equivalences already appear in the sublanguage without restriction: Here the definition of ～ can be factorised into a “standard” part which, modulo the different syntax of actions, is the CCS b作者: Rheumatologist 時間: 2025-4-1 04:15
