A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
Cunf is a tool for building and analyzing unfoldings of Petri nets with read arcs. ...
C-net unfoldings can be up to exponentially smaller than Petri net unfoldings, and recent work proposed algorithms for their construction and verification. ...
Unfoldings are a well-established technique for verifying properties of Petri nets; their use for this purpose was initially proposed by McMillan [6] . ...
doi:10.1007/978-3-319-02444-8_42
fatcat:5qfkwtbekjgjbp5krzqqc2m5fe
Reverse Unfolding of Petri Nets and its Application in Program Data Race Detection
2021
International Journal of Software and Informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Furthermore, the reverse unfolding is applied to the formal verification of concurrent programs, and their data race detection is converted into the coverability determination of a specific state in 1- ...
The unfolding technique can partially alleviate the state explosion in Petri nets through branching processes. However, all states of a system are still contained in its unfolding net. ...
verification of concurrent programs [5, 6] . ...
doi:10.21655/ijsi.1673-7288.00254
fatcat:4afeevqawjdhlpolcwhkt67dum
A False History of True Concurrency: From Petri to Tools
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
computation, and, arguably, the beginning of concurrency theory: Petri nets. ...
Since the unfolding approach is based on the theory of true concurrency, describing its origins requires to speak about the origin of true concurrency itself. ...
Initially developed for systems modeled as "plain" Petri nets, the unfolding approach has been extended to high-level Petri nets [37, 55] , symmetrical Petri nets [17] , unbounded Petri nets [1] , nets ...
doi:10.1007/978-3-642-16164-3_13
fatcat:rutvfbv5kzen5kk2rfsnhyw7im
Specification-based testing of concurrent systems
[chapter]
1997
Formal Description Techniques and Protocol Specification, Testing and Verification
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The paper addresses the problem of test suite derivation from a formal specification of a distributed concurrent software system given as a collection of labeled transition systems. ...
A toolset is presented to support the generation of concurrent test suites from specifications given in the formal description technique LOTOS. ...
Acknowledgment The authors wish to thank Alex Petrenko for a very fruitful discussion and for his hints that helped to improve the quality of the paper. ...
doi:10.1007/978-0-387-35271-8_1
fatcat:p4nf3b347zfzbfx7xytdftblfi
Page 4898 of Mathematical Reviews Vol. , Issue 88i
[page]
1988
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “We provide a Petri net semantics for a subset of CCSP, the union of Milner’s CCS and Hoare’s CSP. It assigns to each process term in the subset a labelled, one-safe place/transition net. ...
In using the semantics for verification there are many examples, but most interesting amongst them is a correctness proof of the Deutsch- Schorr-Wait marking algorithm. ...
Construction and SAT-Based Verification of Contextual Unfoldings
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Unfoldings succinctly represent the set of reachable markings of a Petri net. ...
Here, we shall consider the case of contextual nets, which extend Petri nets with read arcs, and which are more suitable to represent the case of concurrent read access. ...
They have been used, e.g., to model concurrent database access [9] , concurrent constraint programs [8] , priorities [6] , and asynchronous circuits [12] . ...
doi:10.1007/978-3-642-22600-7_3
fatcat:47fyfowkpnflbbss2ir3nj5zou
PEP — more than a Petri Net tool
[chapter]
1996
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The programming component allows the user to design concurrent algorithms in an easy-to-use imperative language, and the PEP system then generates Petri nets from such programs. ...
The PEP system (Programming Environment based on Petri Nets) supports the most important tasks of a good net tool, including HL and LL net editing and comfortable simulation facilities. ...
The integration of these two approaches, using a common, flexible parallel programming language called B(PN) 2 (Basic Petri Net Programming Notation), is one of the main characteristics of PEP. ...
doi:10.1007/3-540-61042-1_58
fatcat:6xleev2hqjebjfv47l6sc4rnhm
The Model-Checking Kit
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The Model-Checking Kit [8] is a collection of programs which allow to model finite state systems using a variety of modelling languages, and verify them using a variety of checkers, including deadlock-checkers ...
This has led to the following selection: • The PEP-tool [10] (Programming Environment based on Petri nets) is a programming and verification environment for parallel programs written in B(PN) 2 or CFA ...
Verification techniques As mentioned in the introduction many different verification techniques for 1safe Petri nets are available. ...
doi:10.1007/3-540-44919-1_29
fatcat:tq5v4ehsfbbynbsm2a7zfex26e
Determinism in Cyber-Physical Systems Specified by Interpreted Petri Nets
2020
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In particular, the control interpreted Petri nets (CIPNs) are applied, which are an extension of the ordinary Petri nets, supplemented by signals (related to sensors and actuators) that permit communication ...
In this paper, we study selected aspects of determinism in the control part of a cyber-physical system (CPS) that is specified by a Petri net-based model. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/s20195565
pmid:32998420
pmcid:PMC7582862
fatcat:tg7syz3rknawxe5jcdy7rvvsmy
Computational Issues in Intelligent Control: Discrete-Event and Hybrid Systems
[chapter]
2000
Soft Computing and Intelligent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Petri net models are used to describe discrete event and hybrid systems. Computational issues of various problems and algorithms concerning the analysis and synthesis of such systems are discussed. ...
The design, simulation, and verification of intelligent control systems is highly nontrivial and typically involves significant amount of computations. ...
Nikos Chrisochoides of the Computer Science and Engineering Department at the University of Notre Dame for his valuable assistance concerning the parallel computing architecture. ...
doi:10.1016/b978-012646490-0/50006-8
fatcat:tpqu57oywrhwtfcrvohzhr3trq
Merged processes: a new condensed representation of Petri net behaviour
2006
Acta Informatica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Model checking based on Petri net unfoldings is an approach widely applied to cope with the state space explosion problem. ...
Moreover, this representation is sufficiently similar to the traditional unfoldings, so that a large body of results developed for the latter can be re-used. ...
Acknowledgements The authors would like to thank Keijo Heljanko for his suggestions about expressing the ACYCLIC constraint using SAT. This research was supported by the EC IST grant 511599 (Rodin). ...
doi:10.1007/s00236-006-0023-y
fatcat:thl5mjmyqvayrnakzpqjmvvh4y
Merged Processes — A New Condensed Representation of Petri Net Behaviour
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Model checking based on Petri net unfoldings is an approach widely applied to cope with the state space explosion problem. ...
Moreover, this representation is sufficiently similar to the traditional unfoldings, so that a large body of results developed for the latter can be re-used. ...
Acknowledgements The authors would like to thank Keijo Heljanko for his suggestions about expressing the ACYCLIC constraint using SAT. This research was supported by the EC IST grant 511599 (Rodin). ...
doi:10.1007/11539452_27
fatcat:urbt2apoibaibhmqnqje2ubuwa
Optimizing Verification of Structurally Evolving Algebraic Petri Nets
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
When considering Algebraic Petri nets (APNs) for modeling and model checking for verification, all the proofs must be redone after each iteration which is impractical both in terms of time and space. ...
In this work, we introduce an Algebraic Petri net slicing technique that optimizes the model checking of static or structurally evolving APN models. ...
Various evolutions of Petri nets have been created, among others Algebraic Petri nets, that raise the level of abstraction of Petri nets by using complex structured data [19] . Definition 1. ...
doi:10.1007/978-3-642-40894-6_6
fatcat:hltw75pnorgixnsk3v2cneblcu
A Survey of Petri Nets Slicing
2018
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri nets. ...
Petri nets slicing was first developed to facilitate debugging but then developed for alleviating the state space explosion problem for model checking Petri nets. ...
Introduction Petri nets have been extensively used to model and analyze concurrent and distributed system since their birth. ...
doi:10.1145/3241736
fatcat:mydxlv4rjbaf3kbilv5vgfvd7e
Guided Control Flow Unfolding for Workflow Graphs Using Value Range Information
2012
Central-European Workshop on Services and their Composition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Using this technique allowed us to safely transform certain kinds of conditional into unconditional control flow, and thus to support a usually data-unaware verification of business processes by more accurate ...
This way, we show how statically derived value range information is beneficial for unfolding and therefore eliminating conditional control flow in a wider range of cases. ...
Introduction and Motivation Verification of business processes today is often done using a Petri-net-based process model in which data aspects are being neglected. ...
dblp:conf/zeus/HeinzeAMG12
fatcat:iupfjmabgjglbatti75z3t7kvi
« Previous
Showing results 1 — 15 out of 948 results