Write in a clean editor, then format for International Journal of Critical Computer-Based Systems in one click — DocuGuru applies the official Inderscience template with author–year references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
International Journal of Critical Computer-Based Systems is a peer-reviewed journal published by Inderscience, covering Formal Methods in Verification, Real-Time Systems Scheduling, Distributed systems and fault tolerance.
| Publisher | Inderscience |
|---|---|
| Reference style | Author–year (Harvard/AGSM) Author–year — (Smith, 2023) in the text Smith, A., Jones, B. and Lee, C. (2023) 'A representative article title', International Journal of Critical Computer-Based Systems, 12(3), pp. 45–58.
Formats any DOI in International Journal of Critical Computer-Based Systems style. No sign-up. |
| Publishes research in | Formal Methods in Verification Real-Time Systems Scheduling Distributed systems and fault tolerance Petri Nets in System Modeling Advanced Software Engineering Methodologies |
| ISSN | 1757-8779 |
| Citation impact (2-yr) | 0.08 |
| h-index | 15 |
| i10-index | 24 |
| Total citations | 852 |
| Top institutions publishing here | Centre National de la Recherche Scientifique |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Consensus is a classical distributed systems problem with both theoretical and practical interest. Asynchronous Byzantine consensus is currently at the core of some solutions for the implementation of highly-resilient computing services. This paper surveys Byzantine consensus in message-passing distributed systems, by presenting the main theoretical results in the area, the main classes of algorithms and…
Spot is a library of model-checking algorithms started in 2003. This paper focuses on its module for translating linear-time temporal logic (LTL) formulas into Büchi automata: one of the steps required in the automata-theoretic approach to LTL model-checking. We detail the different algorithms involved in this translation: the core translation itself, which performs many simplifications…
In recent years, several approaches to generate probabilistic counterexamples have been proposed. The interpretation of probabilistic counterexamples, however, continues to be problematic since they have to be represented as sets of paths, and the number of paths in this set may be very large. Fault trees (FTs) are a well-established industrial technique to represent causalities…
We extend our previous work on model-based conformance testing (Bensalem et al., 2007; Krichen and Tripakis, 2009). We propose a formal framework for black-box conformance testing for distributed real-time systems. Our framework is based on the model of partially-observable, non-deterministic timed automata. A given distributed system can be modelled either as a single timed automaton…
