Results 11 to 20 of about 1,711 (143)
Regional Science Policy &Practice, EarlyView., 2023 Abstract The COVID‐19 pandemic in 2020–2021 has created an unprecedented incentive to digitize firms. This paper aims to explore how European companies may have responded to COVID‐19 through digitalization. An online survey of experts from 22 European countries showed that software technologies supporting online meetings, remote working and e‐commerce ...
Wojciech Dyba, Eleonora Di Maria
wiley +1 more source
A Formal Model For Real-Time Parallel Computation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The imposition of real-time constraints on a parallel computing environment– specifically high-performance, cluster-computing systems– introduces a variety of challenges with respect to the formal verification of the system's timing properties.
Peter Hui, Satish Chikkagoudar
doaj +1 more source
Determinising Parity Automata [PDF]
, 2014 Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the
Schewe, Sven, Varghese, Thomas
core +1 more source
Lazy Probabilistic Model Checking without Determinisation [PDF]
, 2015 The bottleneck in the quantitative analysis of Markov chains and Markov decision processes against specifications given in LTL or as some form of nondeterministic B\"uchi automata is the inclusion of a determinisation step of the automaton under ...
Hahn, Ernst Moritz +4 more
core +2 more sources
Robust Linear Temporal Logic [PDF]
, 2015 Although it is widely accepted that every system should be robust, in the sense that "small" violations of environment assumptions should lead to "small" violations of system guarantees, it is less clear how to make this intuitive notion of robustness ...
Neider, Daniel, Tabuada, Paulo
core +2 more sources
Near-Optimal Scheduling for LTL with Future Discounting [PDF]
, 2015 We study the search problem for optimal schedulers for the linear temporal logic (LTL) with future discounting. The logic, introduced by Almagor, Boker and Kupferman, is a quantitative variant of LTL in which an event in the far future has only ...
G Rahonis +13 more
core +1 more source
Ambiguity, Weakness, and Regularity in Probabilistic B\"uchi Automata
, 2020 Probabilistic B\"uchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open.
Löding, Christof, Pirogov, Anton
core +1 more source
Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation
Journal of Applied Mathematics, 2015 We present on-the-fly degeneralization algorithm used to transform generalized Büchi automata (GBA) into Büchi Automata (BA) different from the standard degeneralization algorithm.
Laixiang Shan +3 more
doaj +1 more source
Constraint LTL Satisfiability Checking without Automata [PDF]
, 2014 This paper introduces a novel technique to decide the satisfiability of formulae written in the language of Linear Temporal Logic with Both future and past operators and atomic formulae belonging to constraint system D (CLTLB(D) for short). The technique
Bersani, Marcello M. +5 more
core +2 more sources
An Example of Π30-complete Infinitary Rational Relation [PDF]
Computer Science Journal of Moldova, 2007 We give in this paper an example of infinitary rational relation, accepted by a 2-tape Buchi automaton, which is Π30-complete in the Borel hierarchy. Moreover the example of infinitary rational relation given in this paper has a very simple structure and
Olivier Finkel
doaj