Log in

Relevant bibliographies by topics / Emptiness checking / Journal articles

To see the other types of publications on this topic, follow the link: Emptiness checking.

Journal articles on the topic 'Emptiness checking'

Author: Grafiati

Published: 4 June 2021

Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 15 journal articles for your research on the topic 'Emptiness checking.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Tripakis, Stavros, Sergio Yovine, and Ahmed Bouajjani. "Checking Timed Büchi Automata Emptiness Efficiently." Formal Methods in System Design 26, no. 3 (2005): 267–92. http://dx.doi.org/10.1007/s10703-005-1632-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Tripakis, Stavros. "Checking timed Büchi automata emptiness on simulation graphs." ACM Transactions on Computational Logic 10, no. 3 (2009): 1–19. http://dx.doi.org/10.1145/1507244.1507245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

YAN, Rong-Jie, Wen-Liang ZHANG, and Zhi-Song TANG. "Truly Bitstate-Hashing for SCC-Based Emptiness Checking Algorithms." Chinese Journal of Computers 31, no. 6 (2009): 979–88. http://dx.doi.org/10.3724/sp.j.1016.2008.00979.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

LU, LUNJIN. "Improving precision of type analysis using non-discriminative union." Theory and Practice of Logic Programming 8, no. 01 (2007): 33–79. http://dx.doi.org/10.1017/s1471068407003055.

Full text

Abstract:

AbstractThis paper presents a new type analysis for logic programs. The analysis is performed witha prioritype definitions; and type expressions are formed from a fixed alphabet of type constructors. Non-discriminative union is used to join type information from different sources without loss of precision. An operation that is performed repeatedly during an analysis is to detect if a fixpoint has been reached. This is reduced to checking the emptiness of types. Due to the use of non-discriminative union, the fundamental problem of checking the emptiness of types is more complex in the proposed

APA, Harvard, Vancouver, ISO, and other styles

5

Lu, Lunjin. "Checking Emptiness of Non-Deterministic Regular Types with Set Operators." Electronic Notes in Theoretical Computer Science 212 (April 2008): 191–206. http://dx.doi.org/10.1016/j.entcs.2008.04.062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Qian, Kairong, and Albert Nymeyer. "Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis." Electronic Notes in Theoretical Computer Science 149, no. 2 (2006): 33–49. http://dx.doi.org/10.1016/j.entcs.2005.07.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ishibashi, Yukio, Masahiro Nagamatsu, and Torao Yanaru. "Accelerating concurrent fault simulation by parallel pattern emptiness checking of fault lists." Systems and Computers in Japan 28, no. 12 (1997): 53–64. http://dx.doi.org/10.1002/(sici)1520-684x(19971115)28:12<53::aid-scj6>3.0.co;2-c.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

PENG, WUXU, and S. PURUSHOTHAMAN IYER. "A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES." International Journal of Foundations of Computer Science 06, no. 02 (1995): 169–86. http://dx.doi.org/10.1142/s0129054195000123.

Full text

Abstract:

In this paper we consider pushdown automata on infinite trees with empty stack as the accepting condition (ω-EPDTA). We provide the following regarding ω-EPDTA: (a) its relationship to other Pushdown automata on infinite trees, (b) a Kleene-Closure theorem and (c) a single exponential time algorithm for checking emptiness. We demonstrate the usefulness of ω-EPDTA through two example applications: defining the temporal uniform inevitability property and specifying a context-free process with unbounded state space, both of which cannot be defined and/or specified by the classical finite state au

APA, Harvard, Vancouver, ISO, and other styles

9

Akshay, S., Benedikt Bollig, and Paul Gastin. "Event clock message passing automata: a logical characterization and an emptiness checking algorithm." Formal Methods in System Design 42, no. 3 (2012): 262–300. http://dx.doi.org/10.1007/s10703-012-0179-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

BLOEM, RODERICK, ALESSANDRO CIMATTI, INGO PILL, and MARCO ROVERI. "SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA." International Journal of Foundations of Computer Science 18, no. 04 (2007): 727–43. http://dx.doi.org/10.1142/s0129054107004942.

Full text

Abstract:

This paper addresses the challenges of symbolic model checking and language emptiness checking where the specification is given as an alternating Büchi automaton. We introduce a novel version of Miyano and Hayashi's construction that allows us to directly convert an alternating automaton to a polynomially-sized symbolic structure. We thus avoid building an exponentially-sized explicit representation of the corresponding nondeterministic automaton. For one-weak automata, Gastin and Oddoux' construction produces smaller automata than Miyano and Hayashi's construction. We present a (symbolic) hyb

APA, Harvard, Vancouver, ISO, and other styles

11

Stefan Göller, Markus Lohrey, and Carsten Lutz. "PDL with intersection and converse: satisfiability and infinite-state model checking." Journal of Symbolic Logic 74, no. 1 (2009): 279–314. http://dx.doi.org/10.2178/jsl/1231082313.

Full text

Abstract:

AbstractWe study satisfiability and infinite-state model checking in ICPDL, which extends Propositional Dynamic Logic (PDL) with intersection and converse operators on programs. The two main results of this paper are that (i) satisfiability is in 2ΕΧΡΤΙΜΕ, thus 2ΕΧΡΤΙΜΕ-complete by an existing lower bound, and (ii) infinite-state model checking of basic process algebras and pushdown systems is also 2ΕΧΡΤΙΜΕ-complete. Both upper bounds are obtained by polynomial time computable reductions to ω-regular tree satisfiability in ICPDL, a reasoning problem that we introduce specifically for this purp

APA, Harvard, Vancouver, ISO, and other styles

12

TIAN, CONG, and ZHENHUA DUAN. "Complexity of propositional projection temporal logic with star." Mathematical Structures in Computer Science 19, no. 1 (2009): 73–100. http://dx.doi.org/10.1017/s096012950800738x.

Full text

Abstract:

This paper investigates the complexity of Propositional Projection Temporal Logic with Star (PPTL*). To this end, Propositional Projection Temporal Logic (PPTL) is first extended to include projection star. Then, by reducing the emptiness problem of star-free expressions to the problem of the satisfiability of PPTL* formulas, the lower bound of the complexity for the satisfiability of PPTL* formulas is proved to be non-elementary. Then, to prove the decidability of PPTL*, the normal form, normal form graph (NFG) and labelled normal form graph (LNFG) for PPTL* are defined. Also, algorithms for

APA, Harvard, Vancouver, ISO, and other styles

13

Hune, Thomas S., Judi Romijn, Mariëlle Stoelinga, and Frits W. Vaandrager. "Linear Parametric Model Checking of Timed Automata." BRICS Report Series 8, no. 5 (2001). http://dx.doi.org/10.7146/brics.v8i5.20459.

Full text

Abstract:

<p>We present an extension of the model checker Uppaal capable<br /> of synthesizing linear parameter constraints for the correctness of<br />parametric timed automata. The symbolic representation of the (parametric)<br /> state-space is shown to be correct. A second contribution of this<br />paper is the identification of a subclass of parametric timed automata<br />(L/U automata), for which the emptiness problem is decidable, contrary<br />to the full class where it is know to be undecidable. Also we present a<br />number of lemmas enabling the

APA, Harvard, Vancouver, ISO, and other styles

14

Zdybek, Przemysław, and Romuald Derbis. "THE SENSE OF QUALITY OF LIFE AND SELF-ESTEEM AMONG ADDICTED PATIENTS DURING THE THERAPY." Czasopismo Psychologiczne Psychological Journal 24, no. 3 (2019). http://dx.doi.org/10.14691/cppj.24.3.595.

Full text

Abstract:

During the addiction therapy patients describes a sense of emptiness, low level of life satisfaction and difficulties in enjoying their lives. Those problems often caused them to return to psychoactive substance use. The research presented in the article is aimed at checking the dynamics of the above constructs during addiction therapy, which may help to better understand the treatment process. A longitudinal study of alcohol dependent patients in the process of addiction therapy was conducted. The research questionnaires measured selected aspects of psychological well-being as general constru

APA, Harvard, Vancouver, ISO, and other styles

15

"Features of Narcissistic Regulation of Drug Abuse Personality." Psychological Counseling and Psychotherapy, no. 14 (2020). http://dx.doi.org/10.26565/2410-1249-2020-14-07.

Full text

Abstract:

The article presents the results of a study of the characteristics of narcissistic regulation of drug addicts. The aim of the study is to investigate the features of narcissistic regulation of drug addicts as forms of borderline personality organization and personality types of drug addicts. According to the set goal and objectives of the study, a research sample was formed. Based on informed consent in compliance with the principles of bioethics and deontology during 2019-2020. a psychodiagnostic study of 102 male patients with drug addiction of the opioid group was carried out on the basis o

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!