简介：Inthispaper,wepresentadetectiontechniqueofand-parallelisminlogicprograms.Thedetectionconsistsofthreephases:analysisofentrymodes,derivationofexitmodesanddeterminationofexecutiongraphexpressions.Comparedwithothertechniques^[2,4,5],ourapproachwiththecompile-timeprogram-leveldata-dependenceanalysisoflogicprograms,canefficientlyexploitand-parallelisminlogicprograms.Twoprecompilers,basedonourtechniqueandDeGroot'sapproach^[3]respectively,havebeenimplementedinSES-PIMsystem^[12],ThroughcompilingandrunningsometypicalbenchmarksinSES-PIM,weconcludethatourtechniquecan,inmostcases,exploitasmuchand-parallelismasthedynamicapproach^[13]doesunder“produces-consumer”scheme,andneedslessdynamicoverheadwhileexploitingmoreandparallelismthanDeGroot'sapproachdoes.

简介：Inthispaper,thelimitationoftheGNYlogicaboutitsinabilitytodetectthereflectionattacksagainstsomeauthenticationprotocolsisgiven.Animprovementisproposedwhichtakesintoaccountthepossiblemultipleinstances(principals)ofthesameidentityinthemodel.

简介：AhomomorphismψoflogicprogramsfromPtoP'isafunctionmappingAtoms(P)toAtoms(P')andpaper,thecomplexityofthedecisionproblemsonhomomorphismandisomorphismfordefinitelogicprogramsisstudied.Itisshownthatthehomomorphismproblem(HOM-LP)fordefinitelogicprogramsisNP-complete,andtheisomorphismproblem(ISO-LP)isequivalenttothegraphisomorphismproblem(GI).

简介：Globalpropertyisthenecessaryconditionwhichmustbesatisfiedbytheprovableformulas.Itcanhelptofindoutsomeunprovableformulathatdoesnotsatisfysomeglobalpropertybeforeprovingitusingformalautomatedreasoningsystems,thustheefficiencyofthewholesystemisimproved.ThispaperpresentssomeglobalpropertiesofvalidformulasinmodallogicK.Suchpropertiesarestructurecharactersofformulas,sotheyaresimpleandeasytocheck.Atthesametime,someglobalpropertiesofKunsatisfiableformulasetarealsogiven.

简介：Workflowmanagementaimsatthecontrolling,monitoring,optimizingandsupportingofbusinessprocesses.Welldesignedformalmodelswillfacilitatesuchmanagementsincetheyprovideexplicitrepresentationsofbusinessprocessesasthebasisforcomputerizedanalysis,verificationandexecution.PetriNetshavebeenrecognizedasthemostsuitablecandidateforworkflowmodeling,andassuch,formalmodelsbasedonPetriNetshavebeenproposed,amongthemWF-netbyAalstisthemostpopularone.ButWF-nethasturnedouttobeconceptuallychaoticaswillbeillustratedinthispaperwithanexamplefromAalst'sbook.Thispaperproposesaseriesofmodelsforthedescriptionandanalysisofbusinessprocessesatconceptuallydifferenthierarchicallayers.Analyticgoalsandmethodsat.theselayersarealsodiscussed.Theunderlyingstructure,sharedbyallthesemodels,isSYNCHRONIZER,whichisdesignedwiththeguidanceofsynchronytheoryofGNT(GeneralNet.Theory)andservesastheconceptualfoundationofworkflowformalmodels.Structurally,synchronizersconnecttaskstoformawholewhiledynamicallysynchronizerscontroltaskstoachievesynchronization.