The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We present a method for hierarchically generating sound work flow nets by substitution of nets with multiple inputs and outputs. We show that our method is correct and generalizes the class of nets generated by other hierarchical approaches. We identify a notion of soundness that is preserved by such substitutions and correct a small omission in an earlier similar method.
Model-driven Design-Space Exploration (DSE) for embedded systems has proven to speed up system design and improve quality. Parameterized Partial Orders (PPOs) are a simple yet powerful conservative extension of classical partial orders. They serve as an intermediate representation in our Octopus tool set, allowing to capture applications from different domains and enabling analysis with various tools...
Divergence appears in message sequence chart specifications when an unbounded number of messages are pending within a communication channel. Several algorithms and tools have been already developed to detect this property. This paper explains why checking non-divergence is very close to the Boolean satisfiability problem and shows how SAT-solvers can be used to check this property efficiently. We...
Bounds is a tool that enables parameterised verification by determining cut-offs for the values of parameters and generating the specification and system instances up to the cut-offs. After that, the verification can be completed by using an existing finite-state verification tool. A unique feature of Bounds is that it allows multiple and topology related parameters and terminates on every input.
Partial order reduction methods rely on expanding a state space only partially, exploring representatives of sets of executions of a system. The methods differ at least in three respects:the set of properties that are preserved, the notions of interaction between transitions, and the methods of selecting the representative transitions. We explore an existing but less studied method of weak stubborn...
Occurrence nets are a well known partial order model for the concurrent behavior of Petri nets. The causality and conflict relations between events, which are explicitly represented in occurrence nets, induce logical dependencies between event occurrences: the occurrence of an event e in a run implies that all its causal predecessors also occur, and that no event in conflict with e occurs. But these...
Experience in business process analysis shows that operational processes often do not conform to process models. Although classical conformance checking techniques can identify deviations of process executions from predefined models, they may produce inaccurate results due to strong assumptions. In this paper, we present a robust conformance checking technique based on Petri net techniques allowing...
An energy harvesting system (EHS) delivers a nondeterministic power density over a range of explicit environmental conditions. The computational architecture is required to be tunable and optimized at run-time in order to adapt the power supply and, simultaneously, deliver optimal performance. In this paper, an important aspect of the supply-consumption relation inEHS is considered, that the transient...
We consider a methodology for flexible software design, runtime programming, defined by recurrent, incremental software modifications to a program at runtime, called runtime patches. The principles we consider for runtime programming are model preservation and scalability. Model preservation means that a runtime patch preserves the programming model in place for programs -- in terms of syntax, semantics,...
This paper investigates quantitative dependability metrics for distributed algorithms operating in the presence of sporadic or frequently occurring faults. In particular, we investigate necessary revisions of traditional fairness assumptions in order to arrive at useful metrics, without adding hidden assumptions that may obfuscate their validity. We formulate faulty distributed algorithms as Markov...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.