136 research outputs found
Petri Net Reachability Graphs: Decidability Status of FO Properties
We investigate the decidability and complexity status of
model-checking problems on unlabelled reachability graphs of Petri
nets by considering first-order, modal and pattern-based languages
without labels on transitions or atomic propositions on markings. We
consider several parameters to separate decidable problems from
undecidable ones. Not only are we able to provide precise borders and
a systematic analysis, but we also demonstrate the robustness of our
proof techniques
Flat counter automata almost everywhere!
This paper argues that flatness appears as a central notion in the
verification of counter automata. A counter automaton is called flat
when its control graph can be ``replaced\u27\u27, equivalently w.r.t.
reachability, by another one with no nested loops.
From a practical view point, we show that flatness is a necessary and
sufficient condition for termination of accelerated symbolic model
checking, a generic semi-algorithmic technique implemented in
successful tools like FAST, LASH or TReX.
From a theoretical view point, we prove that many known semilinear
subclasses of counter automata are flat: reversal bounded counter
machines, lossy vector addition systems with states, reversible Petri nets,
persistent and conflict-free Petri nets, etc. Hence, for these subclasses,
the semilinear reachability set can be computed using a emph{uniform}
accelerated symbolic procedure (whereas previous algorithms were
specifically designed for each subclass)
Petri Net Reachability Graphs: Decidability Status of FO Properties
International audienceWe investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order, modal and pattern-based languages without labels on transitions or atomic propositions on markings. We consider several parameters to separate decidable problems from undecidable ones. Not only are we able to provide precise borders and a systematic analysis, but we also demonstrate the robustness of our proof techniques
IST Austria Thesis
Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation, mobility, etc. we present a framework for the analysis of depth-bounded systems. Depth-bounded systems are one of the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. Even though they are infinite state systems depth-bounded systems are well-structured, thus can be analyzed algorithmically. We give an interpretation of depth-bounded systems as graph-rewriting systems. This gives more flexibility and ease of use to apply depth-bounded systems to other type of systems like shared memory concurrency.
First, we develop an adequate domain of limits for depth-bounded systems, a prerequisite for the effective representation of downward-closed sets. Downward-closed sets are needed by forward saturation-based algorithms to represent potentially infinite sets of states. Then, we present an abstract interpretation framework to compute the covering set of well-structured transition systems. Because, in general, the covering set is not computable, our abstraction over-approximates the actual covering set. Our abstraction captures the essence of acceleration based-algorithms while giving up enough precision to ensure convergence. We have implemented the analysis in the PICASSO tool and show that it is accurate in practice. Finally, we build some further analyses like termination using the covering set as starting point
Invariants and Home Spaces in Transition Systems and Petri Nets
This lecture note focuses on comparing the notions of invariance and home
spaces in Transition Systems and more particularly, in Petri Nets. We also
describe how linear algebra relates to these basic notions in Computer Science,
how it can be used for extracting invariant properties from a parallel system
described by a Labeled Transition System in general and a Petri Net in
particular. We endeavor to regroup a number of algebraic results dispersed
throughout the Petri Nets literature with the addition of new results around
the notions of semiflows and generating sets. Examples are given to illustrate
how invariants can be handled to prove behavioral properties of a Petri Net.
Some additional thoughts on invariants and home spaces will conclude this note.Comment: 83 page
Verification of priced and timed extensions of Petri Nets with multile instances
Tesis inédita de la Universidad Complutense de Madrid, Facultad de Informática, Departamento de Sistemas Informáticos y Computación, leída el 25-01-2016Las redes de Petri son un lenguaje formal muy adecuado para la modelizacíon, ańalisis y verificacíon de sistemas concurrentes con infinitos estados. En particular, son muy apropiadas para estudiar las propiedades de seguridad de dichos sistemas, dadas sus buenas propiedades de decidibilidad. Sin embargo, en muchas ocasiones las redes de Petri carecen de la expresividad necesaria para representar algunas caracteŕısticas fundamentales de los sistemas que se manejan hoy en d́ıa, como el manejo de tiempo real, costes reales, o la presencia de varios procesos con un ńumero no acotado de estados ejecut́andose en paralelo. En la literatura se han definido y estudiado algunas extensiones de las redes de Petri para la representaci ́on de las caracteŕısticas anteriores. Por ejemplo, las “Redes de Petri Temporizadas” [83, 10](TPN) incluyen el manejo de tiempo real y las ν-redes de Petri [78](ν-PN) son capaces de representar un ńumero no acotado de procesos con infinitos estados ejecut́andose concurrentemente. En esta tesis definimos varias extensiones que réunen estas dos caracteŕısticas y estudiamos sus propiedades de decidibilidad. En primer lugar definimos las “ν-Redes de Petri Temporizadas”, que réunen las caracteŕısticas expresivas de las TPN y las ν-PN. Este nuevo modelo es capaz de representar sistemas con un ńumero no acotado de procesos o instancias, donde cada proceso es representado por un nombre diferente, y tiene un ńumero no acotado de relojes reales. En este modelo un reloj de una instancia debe satisfacer ciertas condiciones (pertenecer a un intervalo dado) para formar parte en el disparo de una transicíon. Desafortunadamente, demostramos que la verificacíon de propiedades de seguridad es indecidible para este modelo...The model of Petri nets is a formal modeling language which is very suitable for the analysis and verification of infinite-state concurrent systems. In particular, due to its good decidability properties, it is very appropriate to study safety properties over such systems. However, Petri nets frequently lack the expressiveness to represent several essential characteristics of nowadays systems such as real time, real costs, or the managing of several parallel processes, each with an unbounded number of states. Several extensions of Petri nets have been defined and studied in the literature to fix these shortcomings. For example, Timed Petri nets [83, 10] deal with real time and ν-Petri nets [78] are able to represent an unbounded number of different infinite-state processes running concurrently. In this thesis we define new extensions which encompass these two characteristics, and study their decidability properties. First, we define Timed ν-Petri nets by joining together Timed Petri nets and ν-Petri nets. The new model represents systems in which each process (also called instance) is represented by a different pure name, and it is endowed with an unbounded number of clocks. Then, a clock of an instance must satisfy certain given conditions (belonging to a given interval) in order to take part in the firing of a transition. Unfortunately, we prove that the verification of safety properties is undecidable for this model. In fact, it is undecidable even if we only consider two clocks per process. We restrict this model and define Locally-Synchronous ν-Petri nets by considering only one clock per instance, and successfully prove the decidability of safety properties for this model. Moreover, we study the expressiveness of Locally-Synchronous ν-Petri nets and prove that it is the most expressive non Turing-complete extension of Petri nets with respect to the languages they accept...Depto. de Sistemas Informáticos y ComputaciónFac. de InformáticaTRUEunpu
On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets
International audienceLiveness, (non-)deadlockability and reversibility are behavioral properties of Petri nets that are fundamental for many real-world systems. Such properties are often required to be mono-tonic, meaning preserved upon any increase of the marking. However, their checking is intractable in general and their monotonicity is not always satisfied. To simplify the analysis of these features, structural approaches have been fruitfully exploited in particular subclasses of Petri nets, deriving the behavior from the underlying graph and the initial marking only, often in polynomial time. In this paper, we further develop these efficient structural methods to analyze deadlockability, live-ness, reversibility and their monotonicity in weighted Petri nets. We focus on the join-free subclass, which forbids synchronizations, and on the homogeneous asymmetric-choice subclass, which allows conflicts and synchronizations in a restricted fashion. For the join-free nets, we provide several structural conditions for checking liveness, (non-)deadlock-ability, reversibility and their monotonicity. Some of these methods operate in polynomial time. Furthermore , in this class, we show that liveness, non-deadlockability and reversibility, taken together or separately, are not always monotonic, even under the assumptions of structural boundedness and structural liveness. These facts delineate more sharply the frontier between monotonicity and non-monotonicity of the behavior in weighted Petri nets, present already in the join-free subclass. In addition, we use part of this new material to correct a flaw in the proof of a previous characterization of monotonic liveness and boundedness for homogeneous asymmetric-choice nets, published in 2004 and left unnoticed
О множестве достижимости автоматных счетчиковых машин
Properties of automaton counter machines are investigated. We prove that reachability sets of automaton one-counter machines are semilinear. An algorithm of construction of these semilinear reachability sets is resultexl. Besides, it is shown that reachability sets of reversal-boundexl automaton counter machines and reachability sets of hat automaton counter machines are also semilinear.Исследуются свойства автоматных счетчиковых машин. Доказывается, что множество достижимых состояний любой автоматной односчетчиковой машины является полулинейным множеством. Приводится алгоритм построения этого множества. Кроме того, показывается, что множество достижимости лю¬бой автоматной счетчиковой машины с ограничением на количество перемен направлений роста/убывания значений счетчиков и множество достижимости любой плоской автоматной счетчиковой машины также полулинейны
Algorithmic problems in analysis of real time system specifications
I uppsatsen studeras representationen av William Shakespeares pjäs Hamlet i affischsammanhang. Ett antal Hamletaffischer från 1900-talet framtill 2008 beskrivs, tolkas och analyseras. Fokus ligger främst på det aktuella anslaget från 2008 års produktion på Dramaten i Stockholm. Bakgrunden innehåller kortare teoriavsnitt om klassisk och visuell retorik, bildstruktur, semiotik samt affischens historia och roll i dag. En kortare beskrivning av pjäsens handling ger en naturlig ingång till den kortare presentationen av samtliga affischer som följer. I analysen studeras Hamlet från 2008 i en djupare dimension, där en analysmodell av Roland Barthes tillämpas på ett detaljerat plan. Därefter följer en jämförande analys med tidigare affischer, vilket avslutningsvis följs av en sammanfattande diskussion kring tidigare affischer och hur dess framtida representation kan tänkas ta form.
- …