We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string diagrams. Context-free languages of str...
详细信息
We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jančar and Purser, 2019] holds even for a simple subclass of conservative nets. As the main result we then show that for structural...
详细信息
the paper presents three methods of the numerical modelling of a 60 m long integral bridge structure resting on elastic soil. the presented bridge structure is made of cast in situ reinforced concrete of strength clas...
详细信息
We examine two-player games over finite weighted graphs with quantitative (mean-payoff or energy) objective, where one of the players additionally needs to satisfy a fairness objective. the specific fairness we consid...
详细信息
Hyperproperties are properties over sets of traces (or runs) of a system, as opposed to properties of just one trace. they were introduced in 2010 and have been much studied since, in particular via an extension of th...
详细信息
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan 2004). We show that the satisfiabilit...
详细信息
ISBN:
(纸本)3540330453
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan 2004). We show that the satisfiability problem for this extension remains decidable, generalising known decidability results for extensions of PDL by non-regular programs.
the shared dataspace metaphor is historically the most prominent representative of the family of coordination models. According to this approach, concurrent processes interact via the production, consumption, and test...
详细信息
the shared dataspace metaphor is historically the most prominent representative of the family of coordination models. According to this approach, concurrent processes interact via the production, consumption, and test for presence/absence of data in a common repository. Recently, the problem of the accumulation of outdated and unwanted information in the shared repository has been addressed. Typical garbage collection algorithms cannot be adopted in this context because there is no notion of unaccessible data. the most promising solution to this problem consists of the introduction of the notion of temporary data, intended as data with an associated expiration time. In this paper, we investigate the impact of different mechanisms for expired data collection on the expressiveness of shared dataspace coordination systems with temporary data. (C) 2002 Elsevier science B.V. All rights reserved.
Transition probabilities are proposed as the stochastic counterparts to set-based relations. We propose the construction of the converse of a stochastic relation. It is shown that two of the most useful properties car...
详细信息
Transition probabilities are proposed as the stochastic counterparts to set-based relations. We propose the construction of the converse of a stochastic relation. It is shown that two of the most useful properties carry over: the converse is idempotent as well as anticommutative. the nondeterminism inherent in a stochastic relation is defined and briefly investigated. We define a bisimulation relation, and indicate conditions under which this relation is transitive;moreover it is shown that bisimulation and converse are compatible. (C) 2004 Elsevier Inc. All rights reserved.
暂无评论