An Incremental Verification Technique using Decomposition of Petri Nets

dc.contributor.author	Klai, Kais
dc.contributor.author	Haddad, Serge HAL ID: 745039
dc.contributor.author	Ilié, Jean-Michel
dc.date.accessioned	2011-01-28T14:54:19Z
dc.date.available	2011-01-28T14:54:19Z
dc.date.issued	2002
dc.identifier.uri	https://basepub.dauphine.fr/handle/123456789/5588
dc.language.iso	en	en
dc.subject	Petri nets	en
dc.subject	Decomposition	en
dc.subject	Modular veriﬁcation	en
dc.subject	Veriﬁcation and validation	en
dc.subject.ddc	004	en
dc.title	An Incremental Verification Technique using Decomposition of Petri Nets	en
dc.type	Communication / Conférence
dc.description.abstracten	We propose a modular veriﬁcation technique for bounded Petri nets which efficiency relies on both behavioral and structural features. By focusing on linear evenemential temporal logic formula, we demonstrate how to choose a subnet on which it is enough to perform the model checking.	en
dc.identifier.citationpages	381-386	en
dc.relation.ispartoftitle	2002 IEEE International Conference on Systems, Man and Cybernetics	en
dc.relation.ispartofpublname	IEEE Computer Society	en
dc.relation.ispartofdate	2002
dc.description.sponsorshipprivate	oui	en
dc.subject.ddclabel	Informatique générale	en
dc.relation.ispartofisbn	0-7803-7437-1	en
dc.relation.conftitle	2002 IEEE International Conference on Systems, Man and Cybernetics	en
dc.relation.confdate	2002-10
dc.relation.confcity	Hammamet	en
dc.relation.confcountry	Tunisie	en
dc.identifier.doi	http://dx.doi.org/10.1109/ICSMC.2002.1173442

Related items