86 research outputs found
Wadge Degrees of -Languages of Petri Nets
We prove that -languages of (non-deterministic) Petri nets and
-languages of (non-deterministic) Turing machines have the same
topological complexity: the Borel and Wadge hierarchies of the class of
-languages of (non-deterministic) Petri nets are equal to the Borel and
Wadge hierarchies of the class of -languages of (non-deterministic)
Turing machines which also form the class of effective analytic sets. In
particular, for each non-null recursive ordinal there exist some -complete and some -complete -languages of Petri nets, and the supremum of
the set of Borel ranks of -languages of Petri nets is the ordinal
, which is strictly greater than the first non-recursive ordinal
. We also prove that there are some -complete, hence non-Borel, -languages of Petri nets, and
that it is consistent with ZFC that there exist some -languages of
Petri nets which are neither Borel nor -complete. This
answers the question of the topological complexity of -languages of
(non-deterministic) Petri nets which was left open in [DFR14,FS14].Comment: arXiv admin note: text overlap with arXiv:0712.1359, arXiv:0804.326
The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens (Long Version)
We introduce a geometry of interaction model for Mazza's multiport
interaction combinators, a graph-theoretic formalism which is able to
faithfully capture concurrent computation as embodied by process algebras like
the -calculus. The introduced model is based on token machines in which
not one but multiple tokens are allowed to traverse the underlying net at the
same time. We prove soundness and adequacy of the introduced model. The former
is proved as a simulation result between the token machines one obtains along
any reduction sequence. The latter is obtained by a fine analysis of
convergence, both in nets and in token machines
Product interval automata
We identify a subclass of timed automata called product interval automata and develop its theory. These automata consist of a network of timed agents with the key restriction being that there is just one clock for each agent and the way the clocks are read and reset is determined by the distribution of shared actions across the agents. We show that the resulting automata admit a clean theory in both logical and language theoretic terms. We also show that product interval automata are expressive enough to model the timed behaviour of asynchronous digital circuits
Configuration Structures
In this paper the correspondence between safe Petri nets
and event structures, due to Nielsen, Plotkin and Winskel,
is extended to arbitrary nets without self-loops, under the
collective token interpretation. To this end we propose a
more general form of event structure, matching the expressive power of such nets. These new event structures and
nets are connected by relating both notions with configuration structures, which can be regarded as representations of
either event structures or nets that capture their behaviour
in terms of action occurrences and the causal relationships
between them, but abstract from any auxiliary structure.
A configuration structure can also be considered logically, as a class of propositional models, or—equivalently—as a propositional theory in disjunctive normal from. Converting this theory to conjunctive normal form is the key
idea in the translation of such a structure into a net.
For a variety of classes of event structures we characterise the associated classes of configuration structures in
terms of their closure properties, as well as in terms of the
axiomatisability of the associated propositional theories by
formulae of simple prescribed forms
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions. The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.
- …