Model-Checking for a Subclass of Event Structures
نویسنده
چکیده
A nite representation of the prime event structure corresponding to the behaviour of a program is suggested. The algorithm of linear complexity using this representation for model checking of the formulas of Discrete Event Structure Logic without past modalities is given. A method of building nite representations of event structures in an eecient way by applying partial order reductions is provided.
منابع مشابه
Learning and testing stochastic discrete event systems
Discrete event systems (DES) are an important subclass of systems (in systems theory). They have been used, particularly in industry, to analyze and model a wide variety of real systems, such as production systems, computer systems, traffic systems, and hybrid systems. Our work explores an extension of DES with an emphasis on stochastic processes, commonly called stochastic discrete event syste...
متن کاملModel Checking Probabilistic Timed Automata
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that PCTL probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless...
متن کاملUsing Model-Checking Techniques for Component-Based Systems with Reconfigurations
Within a component-based approach allowing dynamic reconfigurations, sequences of successive reconfiguration operations are expressed by means of reconfiguration paths, possibly infinite. We show that a subclass of such paths can be modelled by finite state automata. This feature allows us to use techniques related to model-checking to prove some architectural, event, and temporal properties re...
متن کاملEvent-Clock Visibly Pushdown Automata
Event-clock automata is a determinizable subclass of timed automata, where the clock valuations are determined by the input instead of by the transition relation. In this note, we propose event-clock visibly pushdown automata (ECVPAs) as a proper extension of event-clock automata. The class of ECVPAs is sufficiently expressive to model real-time pushdown systems, and to specify common non-regul...
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کامل