201 Hits in 7.9 sec

Reduction Using Induced Subnets To Systematically Prove Properties For Free-Choice Nets [article]

Wil M.P. van der Aalst
2021 arXiv   pre-print
We use sequences of t-induced T-nets and p-induced P-nets to convert free-choice nets into T-nets and P-nets while preserving properties such as well-formedness, liveness, lucency, pc-safety, and perpetuality  ...  This allows for more systematic proofs that "peel off" non-trivial parts while retaining the essence of the problem (e.g., lifting properties from T-net and P-net to free-choice nets).  ...  Special thanks go to the persistent anonymous reviewer for providing detailed comments that helped to improve the readability of the proofs.  ... 
arXiv:2106.03658v2 fatcat:he4ypjbkyrcw7hra6humb4dhsq

Connectivity of workflow nets: the foundations of stepwise verification

Artem Polyvyanyy, Matthias Weidlich, Mathias Weske
2011 Acta Informatica  
That is, we analyze workflow nets, a well-established tool for modeling behavior of distributed systems, with respect to the soundness property, a basic correctness property of workflow nets.  ...  At each decomposition step, the discovered compositional structure of a model is used for reasoning on properties of the whole state space of the system.  ...  The authors want to thank two anonymous reviewers for their valuable comments that led to the major restructuring of content in the article.  ... 
doi:10.1007/s00236-011-0137-8 fatcat:pvlxddoj7bfl3pcoyv7m47yxgy

Structure theory of equal conflict systems

Enrique Teruel, Manuel Silva
1996 Theoretical Computer Science  
Equal conflict net Systems are a weighted generalisation of the (extended) tiee choice suhclass that keeps the total autonomy of choices.  ...  bounded Systems, it is better to define conflicts in terms of the enabling degree of transitions, instead of using the mere enabling.  ...  To do so, we have relaxed the free choice property to the equal conflict property, where multiple arcs are allowed.  ... 
doi:10.1016/0304-3975(95)00124-7 fatcat:ed2alvpqvjdx7f2sx3aekhnfmi

Property-preserving subnet reductions for designing manufacturing systems with shared resources

H.J. Huang, L. Jiao, T.Y. Cheung
2005 Theoretical Computer Science  
This paper presents three kinds of property-preserving subnet reduction methods.  ...  For each reduction method, conditions are presented for ensuring that the properties liveness, boundedness and reversibility are preserved.  ...  A well-known recent result is the preservation of well-formedness and Commoner's property under the merge of places within a free-choice net [11, 13, 14] or an asymmetric-choice net [21] .  ... 
doi:10.1016/j.tcs.2004.12.010 fatcat:6z7lsmcqvjamfk4ay26vx7ut5i

Understanding Network Behavior by Structured Representations of Transition Invariants [chapter]

Monika Heiner
2009 Natural Computing Series  
Petri nets offer a bipartite and concurrent paradigm, and consequently represent a natural choice for modeling and analyzing biochemical networks.  ...  We determine a classification of the transitions into abstract dependent transition sets, which induce connected subnets overlapping in interface places only.  ...  My thanks go to the project team Constraints for hosting me. In particular, I would like to thank K. Sriram for drawing my attention to the hypoxia example and for the numerous rewarding discussions.  ... 
doi:10.1007/978-3-540-88869-7_19 fatcat:vtl2sn4yprgmnhxxb7cv4klu3m

Petri Net Reachability Graphs: Decidability Status of FO Properties

Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan, Marc Herbstritt
2011 Foundations of Software Technology and Theoretical Computer Science  
Not only are we able to provide precise borders and a systematic analysis, but we also demonstrate the robustness of our proof techniques.  ...  We consider several parameters to separate decidable problems from undecidable ones.  ...  Acknowledgments: We would like to thank the anonymous referees for helpful remarks and suggestions.  ... 
doi:10.4230/lipics.fsttcs.2011.140 dblp:conf/fsttcs/DarondeauDMM11 fatcat:opclrb7lnrhoxbgq4325mvedmu

Interpreting a finitary pi-calculus in differential interaction nets

Thomas Ehrhard, Olivier Laurent
2010 Information and Computation  
To simplify the presentation, these nets use only a restricted form of the promotion rule of linear logic, which is sufficient for interpreting a replication-free version of the π-calculus, as well as  ...  We prove that our translation from processes to nets is a bisimulation between these two transition systems.  ...  The additional port c will be used for controlling the sequentiality of the reduction, thanks to transistors.  ... 
doi:10.1016/j.ic.2009.06.005 fatcat:4fwmomneuzgwjdihbbqvqenzmi

On the π-calculus and linear logic

G. Bellin, P.J. Scott
1994 Theoretical Computer Science  
We give a detailed treatment of information flow in proof-nets and show how to mirror various evaluation strategies for proof normalization.  ...  The paper also gives 1 self-contained introduction to some / of the deeper proof-theory of CLL, and its process interpretation.  ...  This requires developing properties of the subnets of a proof net.  ... 
doi:10.1016/0304-3975(94)00104-9 fatcat:fo4hu5wjpvfstmcotl57lpj2sa

State Space Methods for Coloured Petri Nets

Lars Michael Kristensen
2000 DAIMI Report Series  
<br /> The fourth paper addresses the issue of using the stubborn set method for Coloured Petri Nets without relying on unfolding to the equivalent Place/Transition Net.  ...  As an extension of the first method, we present a novel method which can be used to determine if it is always possible to reach a state where a given state property holds.  ...  ., it has a finite set of nodes and arcs, it can be used directly to prove many dynamic properties of the CP-net.  ... 
doi:10.7146/dpb.v29i546.7080 fatcat:6m5iv66devhdhcuiri644cytca

A System Dependability Modeling Framework Using AADL and GSPNs [chapter]

Ana-Elena Rugina, Karama Kanoun, Mohamed Kaâniche
2007 Lecture Notes in Computer Science  
The SAE (Society of Automotive Engineers) AADL (Architecture Analysis and Design Language) has proved to be efficient for architectural modeling.  ...  For efficiency and cost control reasons, system designers' will is to use an integrated set of methods and tools to describe specifications and design, and also to perform dependability analyses.  ...  for formal verification and iii) to Stochastic Reward Nets for performance analysis.  ... 
doi:10.1007/978-3-540-74035-3_2 fatcat:rlpt4v33mjeozal5fkrd5zdawe

Assessing SMT and CLP approaches for workflow nets verification

Hadrien Bride, Olga Kouchnarenko, Fabien Peureux, Guillaume Voiron
2018 International Journal on Software Tools for Technology Transfer (STTT)  
over workflow nets.  ...  The design and the analysis of business processes commonly relies on workflow nets, a suited class of Petri nets.  ...  Over the class of Free-Choice workflow nets, we observe that Z3 performs better than SICStus for workflow nets of size up to 750 nodes.  ... 
doi:10.1007/s10009-018-0486-5 fatcat:vdp56yx73nhhfj2h3vte6cbnh4

Petri Net Reachability Graphs: Decidability Status of First Order Properties

Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan, Javier Esparza
2012 Logical Methods in Computer Science  
Not only are we able to provide precise borders and a systematic analysis, but we also demonstrate the robustness of our proof techniques.  ...  We consider several parameters to separate decidable problems from undecidable ones.  ...  There is a logarithmic-space reduction from the non-reachability problem for Petri nets to VAL URG (ML( )). Proof.  ... 
doi:10.2168/lmcs-8(4:9)2012 fatcat:jngynu4upjh7xdmmvgzxiu74ya

Discrete event diagnosis using labeled Petri nets. An application to manufacturing systems

M.P. Cabasino, A. Giua, M. Pocci, C. Seatzu
2011 Control Engineering Practice  
The approach is based on the notion of basis markings and justifications and it can be applied both to bounded and unbounded Petri nets whose unobservable subnet is acyclic.  ...  In this paper an approach to on-line diagnosis of discrete event systems based on labeled Petri nets is presented.  ...  Definition 3. 3 3 Given a net N = (P, T, P re, P ost), and a subset T ⊆ T of its transitions, let us define the T −induced subnet of N as the new net N = (P, T , P re , P ost ) where P re , P ost are the  ... 
doi:10.1016/j.conengprac.2010.12.010 fatcat:ppferaktb5b2za2kw3ddytnsuy

A theory of bipolar synchronization schemes

H.J. Genrich, P.S. Thiagarajan
1984 Theoretical Computer Science  
This paper W;I% written while the second author was spending a cahbatical scme\ter at Aarhus lJnic*erGtl;. tie would like to thank the members of the C'omputer Science f)cpartmcnt for prtr\iding a kcry  ...  We would also like 10 thank Eli/abclh ,Munc:h for placing her exccllcnt drawing skills at our disposal.  ...  The simulation ideas contained in the proofs of I.cmmar 3.10 artd 3.12 can be used to prove that every well behaved bp scheme bar an 'equivalent' representation as an (s marked free choice net.  ... 
doi:10.1016/0304-3975(84)90137-3 fatcat:ci4o2gncqfh4raq4bb254x2sxe

A denotational semantics for the symmetric interaction combinators

2007 Mathematical Structures in Computer Science  
They enjoy a weaker universality property with respect to interaction nets, but are equally expressive.  ...  Moreover, we prove a full-completeness result with respect to a certain class of subsets, called balanced, which is reminiscent of a similar result proved by Michele Pagani for multiplicative proof-nets  ...  We prove the result stated above for cut-free nets only; by the preservation of both · and Ex(·, ·) under reduction, this is enough for the result to hold in the more general case of total nets.  ... 
doi:10.1017/s0960129507006135 fatcat:56tymobe2jcjlb22yz466dvp74
« Previous Showing results 1 — 15 out of 201 results