Page
%P
53,415 Result(s)
-
Book and Living Reference Work (Continuously updated edition)
-
Open Access This content is freely available online to anyone, anywhere at any time.
Article
Compositional schedulability analysis of real-time actor-based systems
We present an extension of the actor model with real-time, including deadlines associated with messages, and explicit application-level scheduling policies, e.g.,“earliest deadline first” which can be associat...
-
Article
Regular and context-free nominal traces
Two kinds of automata are presented, for recognising new classes of regular and context-free nominal languages. We compare their expressive power with analogous proposals in the literature, showing that they e...
-
Article
Efficiently solving the Bin Packing problem through bio-inspired mobility
Recently we have considered the possibility of using bio-inspired mobility for solving a weak NP-complete problem (Partition). In this paper we provide a semi-uniform polynomial solution for a strong NP-comple...
-
Journal
Acta Informatica
Volume 1 / 1972 - Volume 54 / 2017
-
Article
Disjunctivity and other properties of sets of pseudo-bordered words
The concepts of pseudo-bordered and pseudo-unbordered words are in large part motivated by research in theoretical DNA computing, wherein the Watson–Crick complementarity of DNA strands is modelled as an antim...
-
Article
Multiparty session types as coherence proofs
We propose a Curry–Howard correspondence between a language for programming multiparty sessions and a generalisation of Classical Linear Logic (CLL). In this framework, propositions correspond to the local beh...
-
Open Access This content is freely available online to anyone, anywhere at any time.
Article
Characteristic bisimulation for higher-order session processes
For higher-order (process) languages, characterising contextual equivalence is a long-standing issue. In the setting of a higher-order ...
-
Article
Factorisation of transition systems
It is well-known that the reachability graph of a sum of disjoint Petri nets is the disjoint product of the reachability graphs of the components. We shall consider here the converse problem, i.e., determine w...
-
Article
Special issue of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2015)
-
Article
Special issue: Synthesis and SYNT 2014
-
Article
Approximate counting in SMT and value estimation for probabilistic programs
#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the volume of a polyto...
-
Article
Generalized contexts for reaction systems: definition and study of dynamic causalities
Reaction systems are a qualitative formalism for the modelling of systems of biochemical reactions. In their original formulation, a reaction system executes in an environment (or context) t...
-
Article
Algorithms for monitoring real-time properties
Real-time logics are popular specification languages for reasoning about systems intended to meet timing constraints. Numerous formalisms have been proposed with different underlying time models that can be ch...
-
Article
Verification of population protocols
Population protocols (Angluin et al. in PODC, 2004) are a formal model of sensor networks consisting of identical mobile devices. Two devices can interact and thereby change their states. Computations are infinit...
-
Article
A general account of coinduction up-to
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof techniques for checking properties of different kinds of systems. We prove the soundness of such techniques ...
-
Open Access This content is freely available online to anyone, anywhere at any time.
Article
Dynamic Bayesian networks for formal verification of structured stochastic processes
We study the problem of finite-horizon probabilistic invariance for discrete-time Markov processes over general (uncountable) state spaces. We compute discrete-time, finite-state Markov chains as formal abstra...
-
Article
A theory of formal synthesis via inductive learning
Formal synthesis is the process of generating a program satisfying a high-level formal specification. In recent times, effective formal synthesis methods have been proposed based on the use of inductive learni...
-
Article
Reactive synthesis without regret
Two-player zero-sum games of infinite duration and their quantitative versions are used in verification to model the interaction between a controller (Eve) and its environment (Adam). The question usually addr...
-
Article
Assume-admissible synthesis
In this paper, we introduce a novel rule for synthesis of reactive systems, applicable to systems made of n components which have each their own objectives. This rule is based on the notion of admissible strategi...
