Results 1  10
of
603,953
Branchingtime Model Checking of Onecounter Processes
 In Proc. of STACS, volume 5 of LIPIcs
, 2010
"... Abstract. Onecounter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CTL) over OCPs. A PSPACE upper bound is inherited from the modal µcalculus for this problem [20]. First, we ana ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Abstract. Onecounter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CTL) over OCPs. A PSPACE upper bound is inherited from the modal µcalculus for this problem [20]. First, we
BranchingTime Model Checking of Parametric OneCounter Automata
"... Abstract. We study the computational complexity of model checking EF logic and modal logic on parametric onecounter automata (POCA). A POCA is a onecounter automaton whose counter updates are either integer values encoded in binary or integervalued parameters. Given a formula and a configuration o ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Abstract. We study the computational complexity of model checking EF logic and modal logic on parametric onecounter automata (POCA). A POCA is a onecounter automaton whose counter updates are either integer values encoded in binary or integervalued parameters. Given a formula and a configuration
Model Checking Succinct and Parametric OneCounter Automata
"... We investigate the decidability and complexity of various model checking problems over onecounter automata. More specifically, we consider succinct onecounter automata, in which additive updates are encoded in binary, as well as parametric onecounter automata, in which additive updates may be gi ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We investigate the decidability and complexity of various model checking problems over onecounter automata. More specifically, we consider succinct onecounter automata, in which additive updates are encoded in binary, as well as parametric onecounter automata, in which additive updates may
DP Lower Bounds for EquivalenceChecking and ModelChecking of OneCounter Automata
, 2008
"... We present a general method for proving DPhardness of problems related to formal verification of onecounter automata. For this we show a reduction of the SATUNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free v ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
for zero). We also show DPhardness for deciding simulation between onecounter automata and finitestate systems (in both directions), and for the modelchecking problem with onecounter nets and the branchingtime temporal logic EF.
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
OneCounter Stochastic Games
, 2010
"... We study the computational complexity of basic decision problems for onecounter simple stochastic games (OCSSGs), under various objectives. OCSSGs are 2player turnbased stochastic games played on the transition graph of classic onecounter automata. We study primarily the termination objective, ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
∞ with a desired probability? Or that the long run average reward is> 0 with desired probability? We show that the qualitative termination problem for OCSSGs is in NP ∩ coNP, and is in Ptime for 1player OCSSGs, or equivalently for onecounter Markov Decision Processes (OCMDPs). Moreover, we show
Compositional BranchingTime Measurements
"... Abstract. Formal methods are used to increase the reliability of software and hardware systems. Methods such as model checking, verification and testing are used to search for design and coding errors, integrated in the process of system design. Beyond checking whether a system satisfies a partic ..."
Abstract
 Add to MetaCart
Abstract. Formal methods are used to increase the reliability of software and hardware systems. Methods such as model checking, verification and testing are used to search for design and coding errors, integrated in the process of system design. Beyond checking whether a system satisfies a
Memoryfull BranchingTime Logic
"... Abstract. Traditional branchingtime logics such as CTL ⋆ are memoryless: once a path in the computation tree is quantified at a given node, the computation that led to that node is forgotten. Recent work in planing suggests that CTL ⋆ cannot easily express temporal goals that refer to whole computa ..."
Abstract
 Add to MetaCart
branchingtime logic mCTL ⋆ and study its expressive power and algorithmic properties. In particular, we show that while the satisfiability problem for mCTL ⋆ is 2EXPTIMEcomplete — not harder than that of CTL ⋆ , its modelchecking problem is EXPSPACEcomplete — exponentially harder than that of CTL
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 615 (55 self)
 Add to MetaCart
Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general
Results 1  10
of
603,953