111 research outputs found
Structural Analysis of Boolean Equation Systems
We analyse the problem of solving Boolean equation systems through the use of
structure graphs. The latter are obtained through an elegant set of
Plotkin-style deduction rules. Our main contribution is that we show that
equation systems with bisimilar structure graphs have the same solution. We
show that our work conservatively extends earlier work, conducted by Keiren and
Willemse, in which dependency graphs were used to analyse a subclass of Boolean
equation systems, viz., equation systems in standard recursive form. We
illustrate our approach by a small example, demonstrating the effect of
simplifying an equation system through minimisation of its structure graph
Relaxed Operational Semantics of Concurrent Programming Languages
We propose a novel, operational framework to formally describe the semantics
of concurrent programs running within the context of a relaxed memory model.
Our framework features a "temporary store" where the memory operations issued
by the threads are recorded, in program order. A memory model then specifies
the conditions under which a pending operation from this sequence is allowed to
be globally performed, possibly out of order. The memory model also involves a
"write grain," accounting for architectures where a thread may read a write
that is not yet globally visible. Our formal model is supported by a software
simulator, allowing us to run litmus tests in our semantics.Comment: In Proceedings EXPRESS/SOS 2012, arXiv:1208.244
Efficiently enforcing mutual state exclusion requirements in symbolic supervisor synthesis
Given a model of an uncontrolled system and a requirement specification, a supervisory controller can be synthesized so that the system under control adheres to the requirements. There are several ways in which informal behavioral safety requirements can be formalized, one of which is using mutual state exclusion requirements. In current implementations of the supervisor synthesis algorithm, synthesis may be inefficient when mutual state exclusion requirements are used. We propose a method to efficiently enforce these requirements in supervisor synthesis. We consider symbolic supervisor synthesis, where Binary Decision Diagrams are used to represent the system. The efficiency of the proposed method is evaluated by means of an industrial and academic case study
Review of simulation software for cyber-physical production systems with intelligent distributed production control
Many intelligent distributed production control architectures have been developed for cyber-physical production systems (CPPSs), but the difficulty in predicting performance has hindered acceptance by industry. Performance predictions for systems with conventional control can be made by simulating product flow using discrete-event simulation (DES) software. However, DES is inadequate for capturing the intricacies of intelligent distributed production control architectures. Alternatively, agent-based simulation (ABS) software is more effective for capturing distributed intelligence. A hybrid discrete-event and agent-based simulation tool combines the strengths of both approaches, making it effective for capturing the intertwined physical and cyber layers of a CPPS. In this paper, a review is carried out to determine which off-the-shelf simulation tools are capable of using hybrid discrete-event and agent-based simulation for performance predictions in the conceptual design phase of a CPPS. This review is carried out using the following structured steps. First, the scope and evaluation criteria are identified. Next, a selection of simulation tools is collected. The selected tools are then evaluated and classified. Finally, the most promising simulation tool according to this evaluation – Anylogic – is subjected to a case study to assess if hybrid simulation can be used to predict the performance of a CPPS
A specification language for automated design space exploration of production systems
Integrating simulation in the design process of production systems allows the predicted performance of design alternatives to be compared. However, many iterations of specifying the design, constructing the simulation model, performing simulation experiments, and evaluating the simulation results for each (re)design are required. The process of specifying, modelling, simulating, and evaluating a design can be automated using a framework for automated design space exploration of production systems. This paper presents a formal specification language for the design space of a production system topology. Using the specification of the design space, feasible designs can be generated. The language supports the specification of component types, component instances, and constraints such as how many instances of a type are allowed and how components are allowed to be connected. The specification language is validated through an adaptation of an industrial case study
Semantics and expressiveness of ordered SOS
AbstractStructured Operational Semantics (SOS) is a popular method for defining semantics by means of transition rules. An important feature of SOS rules is negative premises, which are crucial in the definitions of such phenomena as priority mechanisms and time-outs. However, the inclusion of negative premises in SOS rules also introduces doubts as to the preferred meaning of SOS specifications.Orderings on SOS rules were proposed by Phillips and Ulidowski as an alternative to negative premises. Apart from the definition of the semantics of positive GSOS rules with orderings, the meaning of more general types of SOS rules with orderings has not been studied hitherto. This paper presents several candidates for the meaning of general SOS rules with orderings and discusses their conformance to our intuition for such rules.We take two general frameworks (rule formats) for SOS with negative premises and SOS with orderings, and present semantics-preserving translations between them with respect to our preferred notion of semantics. Thanks to our semantics-preserving translation, we take existing congruence meta-results for strong bisimilarity from the setting of SOS with negative premises into the setting of SOS with orderings. We further compare the expressiveness of rule formats for SOS with orderings and SOS with negative premises. The paper contains also many examples that illustrate the benefits of SOS with orderings and the properties of the presented definitions of meaning
Detection and Isolation of Small Faults in Lithium-Ion Batteries via the Asymptotic Local Approach
This contribution presents a diagnosis scheme for batteries to detect and
isolate internal faults in the form of small parameter changes. This scheme is
based on an electrochemical reduced-order model of the battery, which allows
the inclusion of physically meaningful faults that might affect the battery
performance. The sensitivity properties of the model are analyzed. The model is
then used to compute residuals based on an unscented Kalman filter. Primary
residuals and a limiting covariance matrix are obtained thanks to the local
approach, allowing for fault detection and isolation by chi-squared statistical
tests. Results show that faults resulting in limited 0.15% capacity and 0.004%
power fade can be effectively detected by the local approach. The algorithm is
also able to correctly isolate faults related with sensitive parameters,
whereas parameters with low sensitivity or linearly correlated are more
difficult to precise.Comment: 8 pages, 2 figures, 3 tables, conferenc
Partially-commutative context-free languages
The paper is about a class of languages that extends context-free languages
(CFL) and is stable under shuffle. Specifically, we investigate the class of
partially-commutative context-free languages (PCCFL), where non-terminal
symbols are commutative according to a binary independence relation, very much
like in trace theory. The class has been recently proposed as a robust class
subsuming CFL and commutative CFL. This paper surveys properties of PCCFL. We
identify a natural corresponding automaton model: stateless multi-pushdown
automata. We show stability of the class under natural operations, including
homomorphic images and shuffle. Finally, we relate expressiveness of PCCFL to
two other relevant classes: CFL extended with shuffle and trace-closures of
CFL. Among technical contributions of the paper are pumping lemmas, as an
elegant completion of known pumping properties of regular languages, CFL and
commutative CFL.Comment: In Proceedings EXPRESS/SOS 2012, arXiv:1208.244
Robustness of Equations Under Operational Extensions
Sound behavioral equations on open terms may become unsound after
conservative extensions of the underlying operational semantics. Providing
criteria under which such equations are preserved is extremely useful; in
particular, it can avoid the need to repeat proofs when extending the specified
language.
This paper investigates preservation of sound equations for several notions
of bisimilarity on open terms: closed-instance (ci-)bisimilarity and
formal-hypothesis (fh-)bisimilarity, both due to Robert de Simone, and
hypothesis-preserving (hp-)bisimilarity, due to Arend Rensink. For both
fh-bisimilarity and hp-bisimilarity, we prove that arbitrary sound equations on
open terms are preserved by all disjoint extensions which do not add labels. We
also define slight variations of fh- and hp-bisimilarity such that all sound
equations are preserved by arbitrary disjoint extensions. Finally, we give two
sets of syntactic criteria (on equations, resp. operational extensions) and
prove each of them to be sufficient for preserving ci-bisimilarity.Comment: In Proceedings EXPRESS'10, arXiv:1011.601
Expressiveness and Completeness in Abstraction
We study two notions of expressiveness, which have appeared in abstraction
theory for model checking, and find them incomparable in general. In
particular, we show that according to the most widely used notion, the class of
Kripke Modal Transition Systems is strictly less expressive than the class of
Generalised Kripke Modal Transition Systems (a generalised variant of Kripke
Modal Transition Systems equipped with hypertransitions). Furthermore, we
investigate the ability of an abstraction framework to prove a formula with a
finite abstract model, a property known as completeness. We address the issue
of completeness from a general perspective: the way it depends on certain
abstraction parameters, as well as its relationship with expressiveness.Comment: In Proceedings EXPRESS/SOS 2012, arXiv:1208.244
- …