32 research outputs found
Synthesis and axiomatisation for structural equivalences in the Petri Box Calculus
PhD ThesisThe Petri Box Calculus (PBC) consists of an algebra of box expressions, and
a corresponding algebra of boxes (a class of labelled Petri nets). A compo-
sitional semantics provides a translation from box expressions to boxes. The
synthesis problem is to provide an algorithmic translation from boxes to box
expressions. The axiomatisation problem is to provide a sound and complete
axiomatisation for the fragment of the calculus under consideration, which
captures a particular notion of equivalence for boxes.
There are several alternative ways of defining an equivalence notion for
boxes, the strongest one being net isomorphism. In this thesis, the synthesis
and axiomatisation problems are investigated for net semantic isomorphism,
and a slightly weaker notion of equivalence, called duplication equivalence,
which can still be argued to capture a very close structural similarity of con-
current systems the boxes are supposed to represent.
In this thesis, a structured approach to developing a synthesis algorithm
is proposed, and it is shown how this may be used to provide a framework
for the production of a sound and complete axiomatisation. This method is
used for several different fragments of the Petri Box Calculus, and for gener-
ating axiomatisations for both isomorphism and duplication equivalence. In
addition, the algorithmic problems of checking equivalence of boxes and box
expressions, and generating proofs of equivalence are considered as extensions
to the synthesis algorithm
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 24th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The 28 regular papers presented in this volume were carefully reviewed and selected from 88 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems
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.
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.