MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Selective mu-calculus and Formula-Based Equivalence of Transition Systems (1999) [3 citations — 3 self]

by Roberto Barbuti ,  Nicoletta De Francesco ,  Antonella Santone ,  Gigliola Vaglini
Add To MetaCart

Abstract:

this paper we present a new temporal logic, the selective mu-calculus, and an equivalence between transition systems based on the formulae of this logic. This property preserving equivalence can be used to reduce the size of transition systems. The equivalence (called ae-

Citations

357 Introduction to the ISO specification language LOTOS – Bolognesi, Brinksma - 1987
209 An automata-theoretic approach to branchingtime model checking – Bernholtz, Vardi, et al. - 1994
82 Tableau-based model checking in the propositional mucalculus – Cleaveland - 1990
77 Three logics for branching bisimulation – Nicola, Vaandrager - 1990
63 CADP - a protocol validation and verification toolbox – Fernandez, Garavel, et al. - 1996
48 Property preserving simulations – Bensalem, Bouajjani, et al. - 1992
40 Local model checking for infinite state spaces – Bradfield, Stirling - 1990
31 Aboard AUTO – Simone, Vergamini - 1989
28 Safety for branching time semantics, in – Bouajjani, Fernandez, et al. - 1991
27 Formula-dependent equivalence for compositional CTL model checking – Aziz, Shiple, et al. - 1994
26 Symbolic Equivalence Checking – Fernandez, Kerbrat, et al. - 1993
23 A practical technique for process abstraction – Bruns - 1993
17 On the fly" verification of behavioural equivalences and preorders – Fernandez, Mounier
11 The Concurrency Workbench: Operating Instructions – Cleaveland, Parrow, et al. - 1988
11 Ald'ebaran: A tool for verification of communicating processes – Fernandez - 1989
10 A Case Study in Safety-Critical Design – Bruns - 1992
9 Compositional Semantics of ESTEREL and Verification by Compositional Reductions – Simone, Ressouche - 1994
8 Selective mu-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems – Barbuti, Francesco, et al. - 1997
3 Constructing Reduced Models for Temporal Properties Verification – Barbuti, Francesco, et al. - 1998
2 a Tool for Reducing State Explosion in Verification of Lotos Programs – LORETO - 1998
2 State Space Reduction by Non-Standard Semantics for Deadlock Analysis – Francesco, Santone, et al. - 1998
2 The Weakest Propositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic – Kaivola, Valmari - 1992
View or Download | Add to My Collection | Correct Errors