2,785 Hits in 2.7 sec

CTL* Model Checking on a Shared-Memory Architecture

Cornelia P. Inggs, Howard Barringer
2005 Electronical Notes in Theoretical Computer Science  
In this paper we present a parallel algorithm for CTL* model checking on a virtual shared-memory high-performance parallel machine architecture.  ...  The algorithm is automata-driven and follows a games approach where one player wins if the automaton is empty while the other player wins if the automaton is nonempty.  ...  This is followed by a description of the serial automata-driven game-theoretic algorithm for CTL* and its parallelisation in Sections 3 and 4.  ... 
doi:10.1016/j.entcs.2004.10.022 fatcat:3ud67xc5cngotf7ftrdunezrxe

Page 2065 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
It follows that the satisfiability and model- checking problems for ETL3, are PSPACE-complete, as are the ones for LTL and its earlier extensions with automata.  ...  Summary; “A key issue in the design of a model-checking tool is the choice of the formal language with which properties are speci- fied.  ... 

Effective State Exploration for Model Checking on a Shared Memory Architecture

Cornelia P. Inggs, Howard Barringer
2002 Electronical Notes in Theoretical Computer Science  
We then discuss implementation issues for parallel automata-theoretic model checking using this parallel state exploration algorithm.  ...  In this paper we present results from experimental studies investigating implementation strategies for explicit-state temporal-logic model checking on a virtual shared-memory high-performance parallel  ...  In the automata theoretic model checking context we consider, the temporal logic formula is first translated to an automaton A φ that accepts exactly all the computations that satisfy the formula.  ... 
doi:10.1016/s1571-0661(05)80395-0 fatcat:oy7l243covcvnntegq7tgmu2nq

Report on TIME 2013

Angelo Montanari
2014 Bulletin of the European Association for Theoretical Computer Science  
., the paper on "Extracting Unsatisfiable Cores for LTL via Temporal Resolution", by Schuppan) to satisfiability and model checking (e.g., the papers on "LTL Satisfiability Checking Revisited", by Li,  ...  Ten years later, at TIME 2001, time in TCS and DB entered the scene with topics like temporal logic as a specification language (LTL, CTL, CTL * , ATL), consistency checking and model checking algorithms  ... 
dblp:journals/eatcs/Montanari14 fatcat:4umikdbvibfynamhyr3fohuek4

Page 7289 of Mathematical Reviews Vol. , Issue 98K [page]

1998 Mathematical Reviews  
Karel Culik, 11 (1-SC-C; Columbia, SC) 98k:68124 68Q80 68Q30 Martin, Bruno Cellular automata universality revisited.  ...  Summary: “We study the complexity of model-checking Petri nets with respect to the propositional linear-time u-calculus.  ... 

On-the-fly Emptiness Check of Transition-Based Streett Automata [chapter]

Alexandre Duret-Lutz, Denis Poitrenaud, Jean-Michel Couvreur
2009 Lecture Notes in Computer Science  
In the automata theoretic approach to model checking, checking a state-space S against a linear-time property ϕ can be done in O(|S| × 2 O(|ϕ|) ) time.  ...  Here we describe an algorithm to check the emptiness of Streett automata, which allows model checking under n strong fairness hypotheses in O(|S| × 2 O(|ϕ|) × n).  ...  Introduction The Automata Theoretic Approach to Model Checking [29, 28] is a way to check that a model M verifies some property expressed as a temporal logic formula ϕ, in other words: to check whether  ... 
doi:10.1007/978-3-642-04761-9_17 fatcat:bfor6rr6rzbgjpdkliywntoiby

Automatic Verification of Real-Time Systems with Rich Data: An Overview [chapter]

Ernst-Rüdiger Olderog
2012 Lecture Notes in Computer Science  
We present an overview of the results of the project "Beyond Timed Automata" of the Collaborative Research Center AVACS (Automatic Verification and Analysis of Complex Systems) during the period 2008-2011  ...  the automatic verification of high-level specifications of systems exhibiting the three dimensions of process behavior, complex infinite data, and continuous real-time-beyond the capabilities of Timed Automata  ...  of the concrete specification needs to be model-checked by ARMC or SLAB.  ... 
doi:10.1007/978-3-642-29952-0_14 fatcat:tplffbonpngj7hsyxyhan5rm6m

Page 8149 of Mathematical Reviews Vol. , Issue 2004j [page]

2004 Mathematical Reviews  
Ong, Model checking Algol-like languages using game semantics (33-36); Margus Veanes, Modeling software: from the- ory to practice (37-46); Bharat Adsul and Milind Sohoni, Lo- cal normal forms for logics  ...  ISBN 3-540-40434-1 Contents: Alberto Bertoni, Carlo Mereghetti and Beatrice Palano, Quantum computing: l-way quantum automata (1-20); Javier Es- parza, An automata-theoretic approach to software verification  ... 

Page 6286 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
Summary: “Bounded model checking methodologies check the correctness of a system with respect to a given specification by examining computations of a bounded length.  ...  Summary: “In this paper, we present the logic ATCTL, which is intended to be used for model checking models that have been specified in a lightweight version of the unified modelling language (UML).  ... 

Software Model Checking with Spin [chapter]

Gerard J. Holzmann
2005 Advances in Computers  
The treatment is focused on the logic model checker SPIN,w hich was designed for this specific domain of application. SPIN implements an automata-theoretic method of verification.  ...  The aim of this chapter is to give anoverviewofthe theoretical foundation and the practical application of logic model checking techniques for the verification of multi-threaded software (rather than hardware  ...  In software model checking, the development can be traced through the early work of Pnueli [44] on temporal logic, to the development of the automata theoretic verification method by Vardi and Wolper  ... 
doi:10.1016/s0065-2458(05)65002-4 fatcat:df7mxqek3jcrdkt3aytlqkidsm

Page 3850 of Mathematical Reviews Vol. , Issue 98F [page]

1998 Mathematical Reviews  
3850 hybrid system verification (153-164); Luca de Alfaro, Temporal logics for the specification of performance and reliability (165- 176); Carsten Weise and Dirk Lenzkes, Efficient scaling-invariant checking  ...  Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science held in Liibeck, February 27—March 1, 1997. Edited by Riidiger Reischuk and Michel Morvan.  ... 

Page 1444 of Mathematical Reviews Vol. , Issue 2000b [page]

2000 Mathematical Reviews  
(English summary) Cellular automata (Milan, 1996). Theoret. Comput. Sci. 217 (1999), no. 1, 99-113.  ...  (English summary) Cellular automata (Milan, 1996). Theoret. Comput. Sci. 217 (1999), no. 1, 81-98.  ... 

GOAL for Games, Omega-Automata, and Logics [chapter]

Ming-Hsien Tsai, Yih-Kuen Tsay, Yu-Shiang Hwang
2013 Lecture Notes in Computer Science  
The enhancements provide more automata conversion, complementation, simplification, and testing algorithms, translation of full QPTL formulae, and better automata navigation with more layout algorithms  ...  This paper introduces the second generation of GOAL, which is a graphical interactive tool for games, ω-automata, and logics.  ...  GOAL may also be used for supplementing automata-theoretic model checkers such as SPIN [20] .  ... 
doi:10.1007/978-3-642-39799-8_62 fatcat:4xi3csp63fgbhn736yrrhzc3we

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

Kathi Fisler, Moshe Y. Vardi
1998 Lecture Notes in Computer Science  
We revisit bisimulation minimization, this time in an automata-theoretic framework.  ...  We demonstrate that bisimulation is practical for many designs within the automata-theoretic framework.  ...  This paper revisits bisimulation reductions, this time in an automata-theoretic framework 28, 33] . The change of framework is signi cant.  ... 
doi:10.1007/3-540-49519-3_9 fatcat:f6mgmsyoerfjhhw3uingt7whry

Page 5650 of Mathematical Reviews Vol. , Issue 2004g [page]

2004 Mathematical Reviews  
(English summary) [Two-dimensional cellular automata and deterministic on line tessellation automata] Theoret. Comput. Sci. 301 (2003), no. 1-3, 167-186.  ...  Theoret. Comput. Sci. 286 (2002), no. 2, 197-245.  ... 
« Previous Showing results 1 — 15 out of 2,785 results