Formal Methods for Systems Engineering Behavior Models
Charlotte Seidner,Olivier Roux +1 more
TL;DR: Considering the widely-used model of enhanced function flow block diagrams (EFFBDs), it is proposed a structural translation of EFFBDs to transition time Petri nets ( TPNs) and this translation is proved to preserve the behavioral semantics, leading to a formal verification tool within a development platform for system design for defense applications.
read more
Abstract: Safety analysis in systems engineering (SE) processes, as usually implemented, rarely relies on formal methods such as model checking since such techniques, however powerful and mature, are deemed too complex for efficient use. This paper thus aims at improving the verification practice in SE design: considering the widely-used model of enhanced function flow block diagrams (EFFBDs), it formally establishes its syntax and behavioral semantics. It also proposes a structural translation of EFFBDs to transition time Petri nets ( TPNs); this translation is then proved to preserve the behavioral semantics (i.e., timed bisimilarity). After proving results on the boundedness of the resulting TPNs, it was possible to extend a number of fundamental properties (such as the decidability of liveness, state-access, etc.) from bounded TPNs to so-called bounded EFFBDs. Finally, these results led to both implementing and integrating a formal verification tool within a development platform for system design for defense applications and in which the underlying complexity is totally concealed from the end-user.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
SWSpec: The Requirements Specification Language in Service Workflow Environments
TL;DR: A Service Workflow Specification language is proposed, called SWSpec, which allows arbitrary services in a workflow to formally and uniformly impose their requirements, and will provide a formal way to regulate and control workflows as well as enrich the proliferation of service provisions and consumptions in opened environments.
115
Agile testing concepts based on keyword-driven testing for industrial automation systems
Reinhard Hametner,Dietmar Winkler,Alois Zoitl +2 more
- 24 Dec 2012
TL;DR: An agile and keyword-driven test approach with focus on testing implementations based on both important industrial standards and the applicability of the purposed approach is illustrated in a sample implementation, i.e., a High Speed Pick and Place unit.
47
Test case generation approach for industrial automation systems
Reinhard Hametner,Benjamin Kormann,Birgit Vogel-Heuser,Dietmar Winkler,Alois Zoitl +4 more
- 01 Dec 2011
TL;DR: This paper introduces an automated test case generation approach for industrial automation applications which are specified by UML state chart diagrams and presents a prototype application of the presented approach for a sorting machine.
46
A Survey of Static Formal Methods for Building Dependable Industrial Automation Systems
TL;DR: This state-of-the-art survey reports existing formal approaches for creating more dependable IAS, focusing on static formal methods that are used before a system is completely implemented.
References
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
7.5K
Concurrency and Automata on Infinite Sequences
TL;DR: A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.
2.4K
•Book
CDMA Systems Engineering Handbook
Jhong Sam Lee,Leonard E. Miller +1 more
- 01 Nov 1998
TL;DR: In this article, the authors present a comprehensive reference tool for CDMA system engineering, including under-fire techniques that help to assess system modulation and convolutional code performance and optimize cellular system and Erlang capacity.
Proving the Correctness of Multiprocess Programs
TL;DR: The inductive assertion method is generalized to permit formal, machine-verifiable proofs of correctness for multiprocess programs, represented by ordinary flowcharts, and no special synchronization mechanisms are assumed.
Model-checking for real-time systems
Rajeev Alur,Costas Courcoubetis,David L. Dill +2 more
- 04 Jun 1990
TL;DR: An algorithm is developed for model checking, that is, for determining the truth of a TCTL formula with respect to a timed graph, and it is argued that choosing a dense domain, instead of a discrete domain, to model time does not blow up the complexity of the model-checking problem.
947