de Nicola, R. and Vaandrager, F. (1995) Three Logics for Branching Bisimulation. Journal of the Association of Computing Machinery 42 (2) 458--487. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
State Class Constructions for Branching Analysis of Time.. - Berthomieu, Vernadat (2003) (1 citation) (Correct)
....class graphs that preserve the branching properties of a TPN, that is of its state graph. Branching properties are those expressed in modal logics like HML or in branching time temporal logics like CTL . In absence of silent transitions, bisimilarity is known to preserve such properties [BCG88,NV95] So, we just want to build state class graphs which are bisimilar with the state graph of the TPN, omitting time information in the latter. The graph of atomic classes of [YR98] satis es this property. Their algorithm enforces (EE) AE) and (EA) It is easily shown that (AE) and (EE) imply ....
R. De Nicola and F. Vandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458487, 1995.
Bisimulations for Temporal Logic - Kurtonina, de Rijke (1997) (5 citations) (Correct)
....S as follows: w j= OE . iff 9y (Rwy y j= OE 8z (Swyz z j= See Berarducci [5] for further details on this operator. In our comparisons in this paper we focused on equivalence relations between models that were defined by fairly simple first order conditions. De Nicola and Vaandrager [8] study so called branching bisimulations whose definition involves non first order definable concepts like finitely many silent steps ; they show that on certain transition systems branching bisimulations and several temporal logics induce the same equivalence relations. The exact connection ....
R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. Journal of the Association for Computing Machinery, 42:458--487, 1995.
Ameliorating the State Space Explosion Problem - Namjoshi (1998) (3 citations) (Correct)
....on Transition Systems The notions of simulation [Milner 71] and bisimulation [Park 81, Milner 90] are the basic ways of comparing the structure of transition systems. There are several variants; an important one being bisimulation under stuttering (finite repetition) of state labelings [BCG 88, dNV 90, Milner 90] We present here the three main notions cited above. For simplicity, the definitions are with respect to a single structure; comparisons between structures can be reduced to this case by forming a single structure that is the disjoint union of the structures. In the following, let A ....
....are matched by bisimilar states. This is often too restrictive a notion, especially when stuttering (repetition of the same state) and (silent) actions are introduced by hiding details of processes. To take such stuttering into account, several variants of bisimulation have been proposed [BCG 88, dNV 90, Milner 90] We present here the definition of stuttering bisimulation, modified from the original definition in [BCG 88] which applies only to finite total structures. Definition 2.6 (Stuttering Bisimulation) A relation R S Theta S is a stuttering bisimulation on A iff R is symmetric and for ....
[Article contains additional citation context not shown here]
de Nicola, R., Vaandrager, F. Three logics for branching bisimulation. in LICS 1990. Full version in Journal of the ACM, 42(2):458-487, 1995.
Ameliorating the State Space Explosion Problem - Namjoshi (1998) (3 citations) (Correct)
....on Transition Systems The notions of simulation [Milner 71] and bisimulation [Park 81, Milner 90] are the basic ways of comparing the structure of transition systems. There are several variants; an important one being bisimulation under stuttering (finite repetition) of state labelings [BCG 88, dNV 90, Milner 90] We present here the three main notions cited above. For simplicity, the definitions are with respect to a single structure; comparisons between structures can be reduced to this case by forming a single structure that is the disjoint union of the structures. In the following, let A ....
....are matched by bisimilar states. This is often too restrictive a notion, especially when stuttering (repetition of the same state) and (silent) actions are introduced by hiding details of processes. To take such stuttering into account, several variants of bisimulation have been proposed [BCG 88, dNV 90, Milner 90] We present here the definition of stuttering bisimulation, modified from the original definition in [BCG 88] which applies only to finite total structures. Definition 2.6 (Stuttering Bisimulation) A relation R S Theta S is a stuttering bisimulation on A iff R is symmetric and for ....
[Article contains additional citation context not shown here]
De Nicola, R., Vaandrager, F. Three logics for Branching Bisimulation, 5th Annual IEEE Symp. on Logic in Computer Science, 1990. 147
Synthesizing Distunguishing Formulae for Real Time Systems - Godskesen, al. (1994) (Correct)
.... of (bi)simulation equivalences [Par81, Mil80, vGW89] the theoretical basis for generation of such diagnostic information is given in terms of a logical characterization of the equivalence: two systems are equivalent exactly when they satisfy the same formulas in a particular modal logic [HM85, DV91] Thus when two systems are found not to be equivalent, one may explain why by giving a formula satisfied by one but not the other. Algorithms for generating distinguishing formulae for finite state systems has been described in [Hil87, Cle90, Kor91, CC92, Pol92] and implemented in at least two ....
R. DeNicola and F.W. Vaandrager. Three logics for branching bisimulation (extended abstract). In Proceedings of Fifth Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, 1991.
Improving Partial Order Reductions for Universal.. - Penczek, Szreter.. (1998) (1 citation) (Correct)
....to motivate two more notions of simulation, namely visible and divergence insensitive visible simulation. These latter two will be used later on to understand the intuitive meaning of two of the options for constraints to obtain reduction that we explore. Definition 3.12. Branching simulation [6, 4]) A relation bs S 0 Theta S is a branching simulation between the states of two models M and M 0 if it satisfies the following conditions: 1. 0 bs and 2. if s 0 bs s and s b Gamma t, then either b = and s 0 bs t, or there exists a path s 0 = s 0 Gamma s 1 ....
....system is equipped with accepting conditions, which restrict the accepted tree to be composed of the concurrency fair paths only. W. Penczek et al. Improving Partial Order Reductions for Universal Branching Time Properties 11 ACTL GammaX , ACTL GammaX (without nexttime) 2, 10] [6, 4] [11] Universal fragment of Logic HML (with operations) Weak simulation i i i i i i i i i) P P P P P P P P Pq Branching simulation Stuttering simulation Visible simulation Figure 3. Connections between simulations and logics 4. The Algorithm The reduction algorithm is based upon a ....
R. deNicola, F. Vaandrager, Three Logics for Branching Bisimulation, Proc. of LICS, 1990, pp. 118--129.
A Simple Characterization of Stuttering Bisimulation - Namjoshi (1997) (6 citations) (Correct)
....The University of Texas at Austin, U.S.A. Abstract. Showing equivalence of two systems at different levels of abstraction often entails mapping a single step in one system to a sequence of steps in the other, where the relevant state information does not change until the last step. In [BCG 88,dNV 90] bisimulations that take into account such stuttering are formulated. These definitions are, however, difficult to use in proofs of bisimulation, as they often require one to exhibit a finite, but unbounded sequence of transitions to match a single transition; thus introducing a large ....
....of atomicity. This work was supported in part by SRC Contract 96 DP 388. The author can be reached at kedar cs.utexas.edu. A preliminary version of this paper appeared at the 17th Conference on Foundations of Software Technology and Theoretical Computer Science, December 1997. In [BCG 88,dNV 90] bisimulations that take into account such stuttering are defined. It is shown in [BCG 88] that states related by a stuttering bisimulation satisfy the same formulas of the powerful branching temporal logic CTL [EH 82] that do not use the next time operator, X. Although these definitions are ....
[Article contains additional citation context not shown here]
de Nicola, R., Vaandrager, F. Three logics for branching bisimulation. in LICS,
Logic Journal - Of The Editor-In-Chief (Correct)
....only primitive objects, while line talk was reduced to statements involving pairs of objects. This was an excellent idea for algebraic and model theoretic reasons, but it was not faithful to geometrical thinking. There are recent modal style axiomatizations of traditional geometrical spaces: cf. [7]. But these accept classical geometry in toto, and do not innovate. Also, these authors reduce everything to a one sorted modal universe, incurring a lot of spurious complexity. Earlier work by Goldblatt on modal topological structures may be relevant, too. But modal logics of space are not ....
....of an Improved Tense Logic . In Studies in Formal Semantics, F. Guenthner and Ch. Rohrer, eds. North Holland, Amsterdam, 1977. 6] J. W. de Bakker, W. P. de Roever and G. Rozenberg, eds. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Springer, Berlin, 1989. [7] Ph. Balbiani, L. Fari nas del Cerro, D. Vakarelov. Modal Logics for Incidence Geometries . Journal of Logic and Computation 7:1, 59 78, 1997. 8] J. Barwise. Admissible Sets and Structures. Springer Verlag, Berlin, 1975. 9] J. Barwise and J. van Benthem. Interpolation, Preservation, and ....
[Article contains additional citation context not shown here]
Rocco De Nicola and Frits Vaandrager. Three logics for branching bisimulation. In 1990 IEEE Fifth Annual Symposium on Logic in Computer Science, pages 118-129, Los Alamitos, CA, 1990. IEEE Computer Society Press. Full version available as Report CS-R9012, Centre for Mathematics and Computer Science, Amsterdam.
Forward and Backward Simulations - Part I: Untimed Systems - Lynch, Vaandrager (1995) (54 citations) Self-citation (Vaandrager) (Correct)
....approach, in which the behavior of a system is a sequence of (visible) actions. Another popular approach, followed for instance in [1] is based on states: the behavior of a system is a sequence of states (up to stuttering) These different approaches are, in some sense, equivalent. In [5], for instance, translations are presented between an action based model of labeled transition systems (LTS s) and a state base model of Kripke structures (KS s) These translations show that the concept of internal actions in action based approaches is the same, in some sense, as the concept of ....
....structures (KS s) These translations show that the concept of internal actions in action based approaches is the same, in some sense, as the concept of stuttering in state based approaches. However, if one takes our history variables and maps them to the state based world via the translation of [5], one gets something which is slightly different from the history variables of [1] due to a subtle difference in the treatment of internal actions stuttering. By slightly restricting our history and prophecy relations one can obtain history and prophecy variables that do correspond exactly to ....
R. De Nicola and F.W. Vaandrager. Three logics for branching bisimulation (extended abstract). In Proceedings 5 Annual Symposium on Logic in Computer Science, Philadelphia, USA, pages 118--129. IEEE Computer Society Press, 1990.
Math. Struct. in Comp. Science (2004), vol. 14, pp.. - Cambridge University Press (Correct)
No context found.
de Nicola, R. and Vaandrager, F. (1995) Three Logics for Branching Bisimulation. Journal of the Association of Computing Machinery 42 (2) 458--487.
Modal Transition Systems: A Foundation for - Three-Valued Program Analysis (Correct)
No context found.
R. de Nicola and F. Vaandrager. Three Logics for Branching Bisimulation. Journal of the Association of Computing Machinery, 42(2):458-487, March 1995.
Propositional Temporal Logics and - Equivalences Ursula Goltz (Correct)
No context found.
: deNicola, R., Vaandrager, F., Three Logics for Branching Bisimulation, Proc. of LICS, 1990.
Operational semantics for Petri Net components - Groote, Voorhoeve (Correct)
No context found.
R. De Nicola and F.W. Vaandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458--487, 1995.
Some of My Favourite Results in Classic Process Algebra - Aceto (2003) (Correct)
No context found.
R. De Nicola and F. W. Vaandrager, Three logics for branching bisimulation, J. Assoc. Comput. Mach., 32 (1995), pp. 458--487.
Studies in Computer Aided Verification of Protocols - Griffioen (2000) (Correct)
No context found.
R. De Nicola and F.W. Vaandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458--487, March 1995.
State/Event-based Software Model Checking - Edmund (2004) (Correct)
No context found.
R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. Journal of the ACM (JACM), 42(2):458-487, 1995.
A General Approach to Comparing Infinite-State Systems with .. - Kucera, Schnoebelen (2004) (Correct)
No context found.
R. de Nicola and F. Vaandrager. Three logics for branching bisimulation. Journal of the Association for Computing Machinery, 42(2):458--487, 1995.
Formal Modeling and Analysis of Power-Aware Real-Time Systems - Lee, Philippou, Sokolsky (2001) (1 citation) (Correct)
No context found.
Rocco De Nicola and Frits W. Vaandrager. Three logics for branching bisimulation. In Proceedings of LICS '90. IEEE Computer Society Press, 1990.
Fluent Model Checking for Event-based Systems - Giannakopoulou, Magee (2003) (1 citation) (Correct)
No context found.
R. De Nicola and F. W. Vaandrager, Three Logics for branching bisimulation, Journal of the ACM, Vol. 42, No. 2, pp. 458-487, 1995.
Behaviour Analysis of Communication Systems: Compositional.. - Siegle (2002) (1 citation) (Correct)
No context found.
R. De Nicola and F.W. Vaandrager. Three logics for branching bisimulation. J. of the ACM, 42:458--487, 1995.
Operational semantics for Petri Net components - Jan Friso Groote (Correct)
No context found.
R. De Nicola and F.W. Vaandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458--487, 1995.
Reasoning about Rings - Emerson, Namjoshi (1995) (31 citations) (Correct)
No context found.
de Nicola, R., Vaandrager, F. Three logics for branching bisimulation. in LICS,
Reasoning about Rings - Emerson, Namjoshi (1995) (31 citations) (Correct)
No context found.
De Nicola, R., Vaandrager, F. Three logics for Branching Bisimulation, 5th Annual IEEE Symp. on Logic in Computer Science, pp. 118-129, 1990.
Reasoning about Rings - Emerson, Namjoshi (1995) (31 citations) (Correct)
No context found.
de Nicola, R., Vaandrager, F. Three logics for branching bisimulation. in LICS,
Reasoning about Rings - Emerson, Namjoshi (1995) (31 citations) (Correct)
No context found.
De Nicola, R., Vaandrager, F. Three logics for Branching Bisimulation, 5th Annual IEEE Symp. on Logic in Computer Science, pp. 118-129, 1990.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC