[图书][B] Petri net synthesis
E Badouel, L Bernardinello, P Darondeau - 2015 - Springer
Eric Badouel · Luca Bernardinello Philippe Darondeau Page 1 Texts in Theoretical Computer
Science An EATCS Series Petri Net Synthesis Eric Badouel · Luca Bernardinello Philippe …
Science An EATCS Series Petri Net Synthesis Eric Badouel · Luca Bernardinello Philippe …
Testing concurrent user behavior of synchronous web applications with petri nets
J Offutt, S Thummala - Software & Systems Modeling, 2019 - Springer
Web applications are now used in every aspect of our lives to manage work, provide
products and services, read email, and provide entertainment. The software technologies …
products and services, read email, and provide entertainment. The software technologies …
First-order logic with reachability for infinite-state systems
First-order logic with the reachability predicate (FO [R]) is an important means of
specification in system analysis. Its decidability status is known for some individual types of …
specification in system analysis. Its decidability status is known for some individual types of …
Visualisation and analysis of complex behaviours using structured occurrence nets
B Li - 2017 - theses.ncl.ac.uk
A complex evolving system consists of a large number of sub-systems which may proceed
concurrently and interact with each other or with the external environment, while its …
concurrently and interact with each other or with the external environment, while its …
Analysis and modeling of a safety critical system using petri-net model
SK Rath - 2016 1st India International Conference on …, 2016 - ieeexplore.ieee.org
In this paper, a case study on Nuclear Power Plant (NPP) has been considered and
modeled using Petri-Nets to identify the occurrence of various hazards in the system. PN …
modeled using Petri-Nets to identify the occurrence of various hazards in the system. PN …
Familles de graphes de présentation finie, propriétés et applications
C Morvan - 2014 - hal.science
Dans ce travail nous présentons une ensemble de travaux sur les systèmes de transitions
infinis de présentation finie. Plus précisément, nous considérons les familles suivantes: les …
infinis de présentation finie. Plus précisément, nous considérons les familles suivantes: les …
Réécriture d'arbres de piles et traces de systèmes à compteurs
V Penelle - 2015 - pastel.hal.science
Dans cette thèse, nous nous attachons à étudier des classes de graphes infinis et leurs
propriétés, Notamment celles de vérification de modèles, d'accessibilité et de langages …
propriétés, Notamment celles de vérification de modèles, d'accessibilité et de langages …