5 research outputs found
Strictifying and taming directed paths in Higher Dimensional Automata
Directed paths have been used by several authors to describe concurrent
executions of a program. Spaces of directed paths in an appropriate state space
contain executions with all possible legal schedulings. It is interesting to
investigate whether one obtains different topological properties of such a
space of executions if one restricts attention to schedulings with "nice"
properties, eg involving synchronizations. This note shows that this is not the
case, ie that one may operate with nice schedulings without inflicting any
harm.
Several of the results in this note had previously been obtained by
Ziemianski. We attempt to make them accessible for a wider audience by giving
an easier proof for these findings by an application of quite elementary
results from algebraic topology; notably the nerve lemma.Comment: 21 pages, 9 figure
Synthesis and Analysis of Petri Nets from Causal Specifications
Petri nets are one of the most prominent system-level formalisms for the specification of causality in concurrent, distributed, or multi-agent systems. This formalism is abstract enough to be analyzed using theoretical tools, and at the same time, concrete enough to eliminate ambiguities that would arise at implementation level. One interesting feature of Petri nets is that they can be studied from the point of view of true concurrency, where causal scenarios are specified using partial orders, instead of approaches based on interleaving.
On the other hand, message sequence chart (MSC) languages, are a standard formalism for the specification of causality from a purely behavioral perspective. In other words, this formalism specifies a set of causal scenarios between actions of a system, without providing any implementation-level details about the system.
In this work, we establish several new connections between MSC languages and Petri nets, and show that several computational problems involving these formalisms are decidable. Our results fill some gaps in the literature that had been open for several years. To obtain our results we develop new techniques in the realm of slice automata theory, a framework introduced one decade ago in the study of the partial order behavior of bounded Petri nets. These techniques can also be applied to establish connections between Petri nets and other well studied behavioral formalisms, such as the notion of Mazurkiewicz trace languages.publishedVersio
Computer Aided Verification
This open access two-volume set LNCS 13371 and 13372 constitutes the refereed proceedings of the 34rd International Conference on Computer Aided Verification, CAV 2022, which was held in Haifa, Israel, in August 2022. The 40 full papers presented together with 9 tool papers and 2 case studies were carefully reviewed and selected from 209 submissions. The papers were organized in the following topical sections: Part I: Invited papers; formal methods for probabilistic programs; formal methods for neural networks; software Verification and model checking; hyperproperties and security; formal methods for hardware, cyber-physical, and hybrid systems. Part II: Probabilistic techniques; automata and logic; deductive verification and decision procedures; machine learning; synthesis and concurrency. This is an open access book