Filters








9,420 Hits in 2.3 sec

Bisimulation and Model Checking [chapter]

Kathi Fisler, Moshe Y. Vardi
1999 Lecture Notes in Computer Science  
A variety of verification tools use bisimulation minimization to check equivalence between systems, to minimize components before composition, or to reduce a state space prior to model checking.  ...  From each, we produce an on-the-fly model checker for invariant properties and compare this model checker to a conventional one based on backwards reachability.  ...  It is therefore unclear that performing bisimulation minimization before model checking saves resources over simply model checking the original system.  ... 
doi:10.1007/3-540-48153-2_29 fatcat:ea3sj35lpng3vlnzdvkfkmsrfu

Bisimulation, modal logic and model checking games

C Stirling
1999 Logic Journal of the IGPL  
doi:10.1093/jigpal/7.1.103 fatcat:fasy5xn3hzc4jcbvsrhn7477l4

Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation [chapter]

Panagiotis Manolios, Kedar Namjoshi, Robert Sumners
1999 Lecture Notes in Computer Science  
We present an approach to verification that combines the strengths of model-checking and theorem proving.  ...  system, which we model-check.  ...  Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation  ... 
doi:10.1007/3-540-48683-6_32 fatcat:dgigcrt7ujfodlawdgv5g7rfni

Control software model checking using bisimulation functions for nonlinear systems

James Kapinski, Alexandre Donze, Flavio Lerda, Hitashyam Maka, Silke Wagner, Bruce H. Krogh
2008 2008 47th IEEE Conference on Decision and Control  
Source-code model checking verifies the correctness of control systems including features that are introduced by the software implementation, such as concurrency and task interleaving.  ...  Sets of reachable continuous states are computed using numerical simulation and bisimulation functions.  ...  The concluding section discusses directions for further research on the theory of model checking for control system software and on methods for improving the performance of our model checking tool.  ... 
doi:10.1109/cdc.2008.4739247 dblp:conf/cdc/KapinskiDLMWK08 fatcat:gxfuk2ql6nd5bpa4urbk3lulum

Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking [chapter]

Joost-Pieter Katoen, Tim Kemna, Ivan Zapreev, David N. Jansen
Tools and Algorithms for the Construction and Analysis of Systems  
This paper studies the effect of bisimulation minimisation in model checking of monolithic discrete-time and continuous-time Markov chains as well as variants thereof with rewards.  ...  We consider probabilistic bisimulation as well as versions thereof that are tailored to the property to be checked.  ...  This research has been performed as part of the MC=MC project that is financed by the Netherlands Organization for Scientific Research (NWO), and the project VOSS2 that is financed by NWO and the German  ... 
doi:10.1007/978-3-540-71209-1_9 dblp:conf/tacas/KatoenKZJ07 fatcat:zw3hzx6pbna23elkzipehqsj4a

Model-Checking Bisimulation-Based Information Flow Properties for Infinite State Systems [chapter]

Deepak D'Souza, K. R. Raghavendra
2012 Lecture Notes in Computer Science  
Model-checking bisimulation-based information flow properties for infi Weak bisimulation Bisimulation-based information flow properties Model-checking pushdown systems Model-checking Petri nets Conclusion  ...  Model-checking bisimulation-based information flow properties for infi Weak bisimulation Bisimulation-based information flow properties Model-checking pushdown systems Model-checking Petri nets Conclusion  ... 
doi:10.1007/978-3-642-33167-1_34 fatcat:zlosfjboo5eobdw2iq2jnnvaki

Bisimulation Minimization in an Automata-Theoretic Verification Framework [chapter]

Kathi Fisler, Moshe Y. Vardi
1998 Lecture Notes in Computer Science  
In most cases, however, the cost of performing this reduction still outweighs that of conventional model checking.  ...  Bisimulation is a seemingly attractive state-space minimization technique because it can be computed automatically and yields the smallest model preserving all -calculus formulas.  ...  Looking only at the model checking and language emptiness times, the results are mixed.  ... 
doi:10.1007/3-540-49519-3_9 fatcat:f6mgmsyoerfjhhw3uingt7whry

Robust Vacuity for Branching Temporal Logic

Arie Gurfinkel, Marsha Chechik
2012 ACM Transactions on Computational Logic  
Vacuous satisfaction misleads users of model-checking into thinking that a system is correct. It is a serious problem in practice. There are several existing definitions of vacuity.  ...  We believe that in most practical applications, bisimulation vacuity provides both the desired theoretical properties and is tractable computationally.  ...  Here, we reduce model-checking under bisimulation semantics to model-checking under tree semantics, which was shown by Kupferman in [Kupferman 1997 ] to be in EXPTIME for EQCTL and in 2EXPTIME for EQCTL  ... 
doi:10.1145/2071368.2071369 fatcat:ie7fwooqqfeihay2rl3doo2qqe

Symbolic bisimulation for open and parameterized systems

Zechen Hou, Eric Madelaine
2020 Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM 2020  
Then we propose two algorithms to check StrFH-Bisimulation: the first one requires a (user-defined) relation between the states of two finite OAs, and checks whether it is a StrFH-Bisimulation.  ...  Open Automata (OA) are symbolic and parameterized models for open concurrent systems. Here open means partially specified systems, that can be instantiated or assembled to build bigger systems.  ...  Acknowledgments This work is partially supported by the National Key Research and Development Project 2017YFB1001800, and the National Natural Science Foundation of China (61972150, 61572195, 61672229,  ... 
doi:10.1145/3372884.3373161 dblp:conf/pepm/HouM20 fatcat:kxvo3qshxnfevj35nbtg3q5xyu

Robust Vacuity for Branching Temporal Logic [article]

Arie Gurfinkel, Marsha Chechik
2010 arXiv   pre-print
Vacuous satisfaction misleads users of model-checking into thinking that a system is correct. There are several existing definitions of vacuity.  ...  Our new definition -- bisimulation vacuity -- is a proper non-trivial extension of both syntactic and trace vacuity.  ...  Here, we reduce model-checking under bisimulation semantics to model-checking under tree semantics, which was shown by Kupferman in [Kupferman 1997 ] to be in EXPTIME for EQCTL and in 2EXPTIME for EQCTL  ... 
arXiv:1002.4616v2 fatcat:xtcoi46vcff73awtof2i2vxh6i

Arenas of Finite State Machines [article]

Giordano Pola, Maria D. Di Benedetto, Elena De Santis
2011 arXiv   pre-print
We propose a notion of compositional bisimulation that allows checking bisimulation equivalence of AFSMs by directly exploiting their communication networks and hence, without the need of expanding the  ...  Compositional bisimulation allows a computational complexity reduction when checking bisimulation equivalence of AFSMs, as formally quantified in the paper.  ...  Acknowledgement: The authors thank Alberto Sangiovanni Vincentelli, Davide Pezzuti, Pasquale Palumbo and Letizia Giampietro for fruitful discussions on the topics of this paper.  ... 
arXiv:1106.0342v2 fatcat:cqryyrdzwvggfhinssgvliym3i

Bisimulator 2.0: An On-the-Fly Equivalence Checker based on Boolean Equation Systems

Radu Mateescu, Emilie Oudot
2008 2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design  
Weak equivalences can be encoded as maximal fixed point BESs by directly translating their mathematical definitions (see the table below, first row, for the BES of branching bisimulation [1]).  ...  These enhancements were incorporated into the BISIMU-LATOR 2.0 equivalence checker of the CADP toolbox, and led to significant performance improvements.  ...  Existing techniques for on-the-fly equivalence checking include synchronous product exploration [3, 1] , model checking of characteristic formulas [6] , and HORNSAT resolution [11] .  ... 
doi:10.1109/memcod.2008.4547690 dblp:conf/memocode/MateescuO08 fatcat:mawfwke5sjbopodoqrnupnnxry

On the Correctness of Model Transformations in the Development of Embedded Systems [chapter]

Gabor Karsai, Anantha Narayanan
2008 Lecture Notes in Computer Science  
to check properties on the verification conditions Approaches (1): Certification through bisimilarity checking Problem description: Statechart to EHA transformation Bisimulation Checking bisimulation  ...  in S such that q → q' and (p', q' ) is in R And for all q' in S q → q' implies that there is a p' in S such that p → p' and (p', q' ) is in R Use cross-links to trace the relation R, and check if it is  ...  Translate the source and target models using semantic anchoring to their behavior models 2.  ... 
doi:10.1007/978-3-540-77419-8_1 fatcat:jkisn2ee7ndb5mvdtdtxrkimum

Model checking for coalition announcement logic

Natasha Alechina
2018 Logical Investigations  
The model-checking problem for CAL is PSPACE-complete, and the protocol requires polynomial space (but exponential time).  ...  The main new technical result in the talk is a model checking algorithm for CAL, that is, an algorithm for evaluating a CAL formula in a given finite model.  ...  checking CAL Model checking problem for a logic L: given a (finite) model M of L and a formula φ of L, does it hold that M |= φ?  ... 
doi:10.21146/2074-1472-2018-24-2-59-69 fatcat:tnrvg6iggrhinnki6z3cuu7f74

Nondeterministic Fuzzy Simulation and Bisimulation

Hui Deng, Zhi Li
2020 Chinese journal of electronics  
As the abstraction and equivalent technologies, simulation and bisimulation have been applied to the simplifications of some classical and uncertain models structures.  ...  fuzzy simulation and bisimulation.  ...  model checking [6−9] , lattice-valued model checking [10−13] and fuzzy model checking [14, 15] .  ... 
doi:10.1049/cje.2020.01.007 fatcat:ymc45cmlwrcgjpydupxho4jqja
« Previous Showing results 1 — 15 out of 9,420 results