15 research outputs found
Verifying temporal properties of systems with applications to petri nets
This thesis provides a powerful general-purpose proof technique for the verification
of systems, whether finite or infinite. It extends the idea of finite local
model-checking, which was introduced by Stirling and Walker: rather than
traversing the entire state space of a model, as is done for model-checking in
the sense of Emerson, Clarke et al. (checking whether a (finite) model satisfies
a formula), local model-checking asks whether a particular state satisfies a formula,
and only explores the nearby states far enough to answer that question.
The technique used was a tableau method, constructing a tableau according to
the formula and the local structure of the model. This tableau technique is here
generalized to the infinite case by considering sets of states, rather than single
states; because the logic used, the propositional modal mu-calculus, separates
simple modal and boolean connectives from powerful fix-point operators (which
make the logic more expressive than many other temporal logics), it is possible
to give a relatively straightforward set of rules for constructing a tableau. Much
of the subtlety is removed from the tableau itself, and put into a relation on the
state space defined by the tableau-the success of the tableau then depends on
the well-foundedness of this relation.
This development occupies the second and third chapters: the second considers
the modal mu-calculus, and explains its power, while the third develops
the tableau technique itself
The generalized tableau technique is exhibited on Petri nets, and various
standard notions from net theory are shown to play a part in the use of the
technique on nets-in particular, the invariant calculus has a major role.
The requirement for a finite presentation of tableaux for infinite systems
raises the question of the expressive power of the mu-calculus. This is studied in
some detail, and it is shown that on reasonably powerful models of computation,
such as Petri nets, the mu-calculus can express properties that are not merely
undecidable, but not even arithmetical.
The concluding chapter discusses some of the many questions still to be
answered, such as the incorporation of formal reasoning within the tableau
system, and the power required of such reasoning
Recent advances in petri nets and concurrency
CEUR Workshop Proceeding
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.
Tools and Algorithms for the Construction and Analysis of Systems
This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 – 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 total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers. The papers are organized in topical sections as follows: Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication. Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 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 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 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 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