Filters








5,538 Hits in 5.3 sec

Guest Editorial: Protocol Specification, Testing, and Verification

C. Sunshine
1982 IEEE Transactions on Communications  
expressive Petri net constructs which are still analyzable with the powerful methods developed for basic Petri nets.  ...  Some useful results have been obtained from simple models such as FSA and Petri nets, partly because analysis methods (state exploration, determination of invariants, reduction, etc.) are easily automated  ...  expressive Petri net constructs which are still analyzable with the powerful methods developed for basic Petri nets.  ... 
doi:10.1109/tcom.1982.1095446 fatcat:pddtuqd7cfgx5b6ghf2blh6l44

TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets [chapter]

Alexandre David, Lasse Jacobsen, Morten Jacobsen, Kenneth Yrke Jørgensen, Mikael H. Møller, Jiří Srba
2012 Lecture Notes in Computer Science  
TAPAAL 2.0 is a platform-independent modelling, simulation and verification tool for extended timed-arc Petri nets.  ...  its maturity and offers the first publicly available tool supporting the analysis and verification of timed-arc Petri nets.  ...  From the static analysis of the net, we define a novel ordering on markings of the net so that monotonicity is preserved even for the extended TAPN model and we exploit this in the reachability algorithm  ... 
doi:10.1007/978-3-642-28756-5_36 fatcat:33uvjxemezhfbk6qzesy77coyy

An interactive tool for design, simulation, verification, and synthesis of protocols

Daniel Y. Chao, David T. Wang
1994 Software, Practice & Experience  
We have developed a user-friendly CAD graphical tool for the design, verification, simulation, and synthesis of protocols based on an interactive tool for Petri net and state diagram designs.  ...  implementation), synthesis (two party protocol and ordinary Petri nets), animation and flexible design.  ...  We develop the following functions, currently available: Reduction and synthesis using a temporal matrix We construct a temporal matrix of an arbitrary ordinary PN and algorithms for Reduction and Analysis  ... 
doi:10.1002/spe.4380240805 fatcat:pyzcefmeybf5rjzhjllfwq5hby

Page 5141 of Mathematical Reviews Vol. , Issue 97H [page]

1997 Mathematical Reviews  
meets the new definition, and that (2) communication protocols are usually delay sensitive and the class of time-Petri nets is a more suitable formal model (than that of ordinary Petri nets) to express  ...  Summary: “Using Petri nets as the concurrent model, we dis- cuss the issue of self-stabilizing communication protocols.  ... 

Empirically Efficient Verification for a Class of Infinite-State Systems [chapter]

Jesse Bingham, Alan J. Hu
2005 Lecture Notes in Computer Science  
Recently, Bingham proposed a new algorithm for this problem, but applicable only to the special cases of broadcast protocols and petri nets.  ...  The algorithm exploits finite-state symbolic model checking and was shown to outperform the classical WSTS verification algorithm on a contrived example family of petri nets.  ...  However, the theory was developed only for a special case of WSTS, namely, broadcast protocols (which subsume petri nets).  ... 
doi:10.1007/978-3-540-31980-1_6 fatcat:qjnypti6azgvveq76vcmw4xjvm

Analysing Coloured Petri Nets by the Occurrence Graph Method

Jens Bæk Jørgensen
1997 DAIMI Report Series  
The aim is twofold: First, to survey pertinent results within the research areas of -- in increasing generality -- Coloured Petri Nets, High-level Petri Nets, and formalisms for modelling and analysis  ...  <p>This paper provides an overview og the work done for the author's PhD thesis. The research area of Coloured Petri Nets is introduced, and the available analysis methods are presented.  ...  Acknowledgements The author wishes to thank: Kurt Jensen and S ren Christensen for indispensable supervision, cooperation, and inspiration throughout this PhD study. Lars  ... 
doi:10.7146/dpb.v26i517.7046 fatcat:tcyahamq2jfupasrfrbuykaoci

Design of Service Net based Correctness Verification Approach for Multimedia Conferencing Service Orchestration

Cheng Bo, Zhang Chengwen, Chen Junliang
2012 International Journal of Computational Intelligence Systems  
and also present the BPEL service net reduction rules and multimedia conferencing service orchestration correction verification algorithms.  ...  multimedia conferencing services orchestration, which can automatically translated the BPEL based service orchestration into a corresponding Petri net model with the Petri Net Markup Language (PNML),  ...  Petri Net and BPEL Transforming Algorithm Petri Nets [11] is a modeling formalism used for the analysis of a wide range of systems coming from different domains and characterized by situations of concurrency  ... 
doi:10.1080/18756891.2012.670527 fatcat:7eu6ed5yhjdtdju3eo7daem63a

Intelligent Modeling and Verification 2014

Guiming Luo, Xiaoyu Song, Xiaojing Yang, Krishnaiyan Thulasiraman
2014 Journal of Applied Mathematics  
Through an extensive peer-review process, 32 papers were selected for publication in the new special issue. A total of 16 papers describe optimal system modeling.  ...  Acknowledgments We sincerely thank the researchers who contributed to this special issue for their inspiring work, as well as the anonymous reviewers for their diligent assistance.  ...  In addition, we would like to express our appreciation for the editorial board members of this journal, who provided valuable help and support throughout the preparation of this special issue.  ... 
doi:10.1155/2014/632027 fatcat:qfrhxkghfnccrnjm5mqxygzcjy

Special Issue on Recent Advances in Petri Nets, Automata, and Discrete-Event Hybrid Systems

Remigiusz Wisniewski, Mengchu Zhou, Luís Gomes, Maria Pia Fanti, Ratnesh Kumar
2020 IEEE Transactions on Systems, Man & Cybernetics. Systems  
An approximate analysis algorithm for live and safe Petri nets is proposed by Karatkevich et al.  ...  Feng et al. proposed a deadlock prevention algorithm for systems with a type of unreliable resources, by using general Petri nets.  ... 
doi:10.1109/tsmc.2020.3020588 dblp:journals/tsmc/WisniewskiZGFK20 fatcat:g3c24yu3p5bzbmfjqfnqypmfvy

Automatic Formal Model Generation and Analysis of SDL [chapter]

Annikka Aalto, Nisse Husberg, Kimmo Varpaaniemi
2003 Lecture Notes in Computer Science  
The SDL description is automatically translated into a high-level Petri net model which is analyzed using the Maria reachability analyzer.  ...  A tool for verification of distributed systems defined using standard SDL-96 is described.  ...  COSPAN has algorithms for symmetry reduction, and those algorithms apparently support SDLcheck via translation.  ... 
doi:10.1007/3-540-45075-0_17 fatcat:xi4azpeppradpidbboxcpyk6xm

A Method of Behavioral Analysis of OpenFlow Protocol

Isaam Saad, Tkachova O
2016 Scholars Journal of Engineering and Technology  
The modified reachability tree for compliance and behavior analysis of model of OpenFlow protocol is proposed in the paper.  ...  The paper is devoted to constructing a new method of analysis functional and non-functional requirements of OpenFlow protocol realization.  ...  Behavioral analysis of such processes types in communication protocols are performed by Petri net and its derivatives.  ... 
doi:10.21276/sjet.2016.4.6.2 fatcat:4djdw6ckfbhorcstze7tfpx5wy

Coloured Petri Nets - a Pragmatic Formal Method for Designing and Analysing Distributed Systems

Kjeld Høyer Mortensen
1997 DAIMI Report Series  
Secondly, it would be useful to identify a few extensions to the CPN method inspired by specific domains for easier adaption in industry. Thirdly, which analysis methods do future systems make use of?  ...  </p><p>The primary purpose of the PhD thesis is to study the pragmatics, practical aspects, and intuition of CP-nets viewed as a formal method for describing and reasoning about concurrent systems.  ...  Reisig and his research group are currently very active in the design and analysis of distributed algorithms by means of high-level Petri Nets 111 .  ... 
doi:10.7146/dpb.v26i522.7051 fatcat:m5hb5hispbfl3f6inhyo6dacpe

Compositional analysis of Petri nets

D. A. Zaitsev
2006 Cybernetics and Systems Analysis  
At the same time, basic methods of analysis of properties of Petri nets except for, perhaps, reduction methods have the exponential computational complexity.  ...  A decomposition algorithm makes it possible to partition a given Petri net into a set of minimal functional subnets.  ...  EXAMPLE OF COMPOSITIONAL ANALYSIS Let us perform the compositional analysis of the Petri net that is depicted in Fig. 1 and is a simplified model of the internet protocol BGP [13] .  ... 
doi:10.1007/s10559-006-0044-0 fatcat:bjcbeyf7lvezji2izstyl2bine

Action Planning for Directed Model Checking of Petri Nets

Stefan Edelkamp, Shahid Jabbar
2006 Electronical Notes in Theoretical Computer Science  
Having such a reduction broadens the horizons for the application of AI heuristic search planning technology. In this paper we discuss the transformations schemes to encode Petri nets into PDDL.  ...  Petri nets are fundamental to the analysis of distributed systems especially infinite-state systems.  ...  Reduction rules modify the Petri net structure and a marking that is present in the net.  ... 
doi:10.1016/j.entcs.2005.07.023 fatcat:d4n3b6iw5feqrmrimfei77a2pm

State Space Methods for Coloured Petri Nets

Lars Michael Kristensen
2000 DAIMI Report Series  
<br /> The first paper considers state space analysis of Coloured Petri Nets.  ...  <br /> In this thesis we study state space methods in the framework of Coloured Petri Nets which is a graphical language for modelling and analysis of concurrent and distributed systems.  ...  Introduction Coloured Petri Nets (CP-nets) [66] is a language for modelling and analysis of distributed systems.  ... 
doi:10.7146/dpb.v29i546.7080 fatcat:6m5iv66devhdhcuiri644cytca
« Previous Showing results 1 — 15 out of 5,538 results