Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
30 years of modal transition systems: survey of extensions and analysis
J Křetínský - Models, Algorithms, Logics and Tools: Essays …, 2017 - Springer
We survey the specification formalism of modal transition systems (MTS). We discuss
various extensions of MTS, their relationships and modelling capabilities. The extensions …
various extensions of MTS, their relationships and modelling capabilities. The extensions …
[HTML][HTML] Nondeterministic modal interfaces
F Bujtor, S Fendrich, G Lüttgen, W Vogler - Theoretical Computer Science, 2016 - Elsevier
Interface theories are employed in the component-based design of concurrent systems.
They often emerge as combinations of Interface Automata (IA) and Modal Transition …
They often emerge as combinations of Interface Automata (IA) and Modal Transition …
A generic approach to quantitative verification
U Fahrenberg - arxiv preprint arxiv:2204.11302, 2022 - arxiv.org
This thesis is concerned with quantitative verification, that is, the verification of quantitative
properties of quantitative systems. These systems are found in numerous applications, and …
properties of quantitative systems. These systems are found in numerous applications, and …
[HTML][HTML] Modal transition system encoding of featured transition systems
Featured transition systems (FTSs) and modal transition systems (MTSs) are two of the most
prominent and well-studied formalisms for modeling and analyzing behavioral variability as …
prominent and well-studied formalisms for modeling and analyzing behavioral variability as …
A generalised theory of interface automata, component compatibility and error
S Fendrich, G Lüttgen - Acta Informatica, 2019 - Springer
Interface theories allow system designers to reason about the composability and
compatibility of concurrent system components. Such theories often extend both de Alfaro …
compatibility of concurrent system components. Such theories often extend both de Alfaro …
Refinement checking on parametric modal transition systems
Modal transition systems (MTS) is a well-studied specification formalism of reactive systems
supporting a step-wise refinement methodology. Despite its many advantages, the formalism …
supporting a step-wise refinement methodology. Despite its many advantages, the formalism …
Bounded Petri net synthesis from modal transition systems is undecidable
U Schlachter - 27th International Conference on Concurrency …, 2016 - drops.dagstuhl.de
In this paper, the synthesis of bounded Petri nets from deterministic modal transition systems
is shown to be undecidable. The proof is built from three components. First, it is shown that …
is shown to be undecidable. The proof is built from three components. First, it is shown that …
Compositionality for quantitative specifications
We provide a framework for compositional and iterative design and verification of systems
with quantitative information, such as rewards, time or energy. It is based on disjunctive …
with quantitative information, such as rewards, time or energy. It is based on disjunctive …
k-bounded Petri net synthesis from modal transition systems
U Schlachter, H Wimmel - 28th International Conference on …, 2017 - drops.dagstuhl.de
We present a goal-oriented algorithm that can synthesise k-bounded Petri nets (k in N^+)
from hyper modal transition systems (hMTS), an extension of labelled transition systems with …
from hyper modal transition systems (hMTS), an extension of labelled transition systems with …
Logical vs. behavioural specifications
There are two fundamentally different approaches for specifying and verifying properties of
systems. The logical approach makes use of specifications given as formulae of temporal or …
systems. The logical approach makes use of specifications given as formulae of temporal or …