849 research outputs found
Well Structured Transition Systems with History
We propose a formal model of concurrent systems in which the history of a
computation is explicitly represented as a collection of events that provide a
view of a sequence of configurations. In our model events generated by
transitions become part of the system configurations leading to operational
semantics with historical data. This model allows us to formalize what is
usually done in symbolic verification algorithms. Indeed, search algorithms
often use meta-information, e.g., names of fired transitions, selected
processes, etc., to reconstruct (error) traces from symbolic state exploration.
The other interesting point of the proposed model is related to a possible new
application of the theory of well-structured transition systems (wsts). In our
setting wsts theory can be applied to formally extend the class of properties
that can be verified using coverability to take into consideration (ordered and
unordered) historical data. This can be done by using different types of
representation of collections of events and by combining them with wsts by
using closure properties of well-quasi orderings.Comment: In Proceedings GandALF 2015, arXiv:1509.0685
1-Safe Petri nets and special cube complexes: equivalence and applications
Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net
unfolds into an event structure . By a result of Thiagarajan
(1996 and 2002), these unfoldings are exactly the trace regular event
structures. Thiagarajan (1996 and 2002) conjectured that regular event
structures correspond exactly to trace regular event structures. In a recent
paper (Chalopin and Chepoi, 2017, 2018), we disproved this conjecture, based on
the striking bijection between domains of event structures, median graphs, and
CAT(0) cube complexes. On the other hand, in Chalopin and Chepoi (2018) we
proved that Thiagarajan's conjecture is true for regular event structures whose
domains are principal filters of universal covers of (virtually) finite special
cube complexes.
In the current paper, we prove the converse: to any finite 1-safe Petri net
one can associate a finite special cube complex such that the
domain of the event structure (obtained as the unfolding of
) is a principal filter of the universal cover of .
This establishes a bijection between 1-safe Petri nets and finite special cube
complexes and provides a combinatorial characterization of trace regular event
structures.
Using this bijection and techniques from graph theory and geometry (MSO
theory of graphs, bounded treewidth, and bounded hyperbolicity) we disprove yet
another conjecture by Thiagarajan (from the paper with S. Yang from 2014) that
the monadic second order logic of a 1-safe Petri net is decidable if and only
if its unfolding is grid-free.
Our counterexample is the trace regular event structure
which arises from a virtually special square complex . The domain of
is grid-free (because it is hyperbolic), but the MSO
theory of the event structure is undecidable
On the Decidability of Non Interference over Unbounded Petri Nets
Non-interference, in transitive or intransitive form, is defined here over
unbounded (Place/Transition) Petri nets. The definitions are adaptations of
similar, well-accepted definitions introduced earlier in the framework of
labelled transition systems. The interpretation of intransitive
non-interference which we propose for Petri nets is as follows. A Petri net
represents the composition of a controlled and a controller systems, possibly
sharing places and transitions. Low transitions represent local actions of the
controlled system, high transitions represent local decisions of the
controller, and downgrading transitions represent synchronized actions of both
components. Intransitive non-interference means the impossibility for the
controlled system to follow any local strategy that would force or dodge
synchronized actions depending upon the decisions taken by the controller after
the last synchronized action. The fact that both language equivalence and
bisimulation equivalence are undecidable for unbounded labelled Petri nets
might be seen as an indication that non-interference properties based on these
equivalences cannot be decided. We prove the opposite, providing results of
decidability of non-interference over a representative class of infinite state
systems.Comment: In Proceedings SecCo 2010, arXiv:1102.516
A unified view of parameterized verification of abstract models of broadcast communication
We give a unified view of different parameterized models of concurrent and distributed systems with broadcast communication based on transition systems. Based on the resulting formal models, we discuss related verification methods and tools based on abstractions and symbolic state exploration
Parameterized verification
The goal of parameterized verification is to prove the correctness of a system specification regardless of the number of its components. The problem is of interest in several different areas: verification of hardware design, multithreaded programs, distributed systems, and communication protocols. The problem is undecidable in general. Solutions for restricted classes of systems and properties have been studied in areas like theorem proving, model checking, automata and logic, process algebra, and constraint solving. In this introduction to the special issue, dedicated to a selection of works from the Parameterized Verification workshop PV \u201914 and PV \u201915, we survey some of the works developed in this research area
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 22nd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2019. The 29 papers presented in this volume were carefully reviewed and selected from 85 submissions. They deal with foundational research with a clear significance for software science
A petri-net based methodology for modeling, simulation, and control of flexible manufacturing systems
Global competition has made it necessary for manufacturers to introduce such advanced technologies as flexible and agile manufacturing, intelligent automation, and computer-integrated manufacturing. However, the application extent of these technologies varies from industry to industry and has met various degrees of success. One critical barrier leading to successful implementation of advanced manufacturing systems is the ever-increasing complexity in their modeling, analysis, simulation, and control. The purpose of this work is to introduce a set of Petri net-based tools and methods to address a variety of problems associated with the design and implementation of flexible manufacturing systems (FMSs). More specifically, this work proposes Petri nets as an integrated tool for modeling, simulation, and control of flexible manufacturing systems (FMSs). The contributions of this work are multifold. First, it demonstrates a new application of PNs for simulation by evaluating the performance of pull and push diagrams in manufacturing systems. Second, it introduces a class of PNs, Augmented-timed Petri nets (ATPNs) in order to increase the power of PNs to simulate and control flexible systems with breakdowns. Third, it proposes a new class of PNs called Realtime Petri nets (RTPNs) for discrete event control of FMS s. The detailed comparison between RTPNs and traditional discrete event methods such as ladder logic diagrams is presented to answer the basic question \u27Why is a PN better tool than ladder logic diagram?\u27 and to justify the PN method.
Also, a conversion procedure that automatically generates PN models from a given class of logic control specifications is presented. Finally, a methodology that uses PNs for the development of object-oriented control software is proposed. The present work extends the PN state-of-the-art in two ways. First, it offers a wide scope for engineers and managers who are responsible for the design and the implementation of modem manufacturing systems to evaluate Petri nets for applications in their work. Second, it further develops Petri net-based methods for discrete event control of manufacturing systems
- …