Sciweavers

236 search results - page 36 / 48
» On the Algebraic Structure of Petri Nets
Sort
View
GG
2008
Springer
13 years 8 months ago
Resolution-Like Theorem Proving for High-Level Conditions
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
Karl-Heinz Pennemann
DCFS
2011
66views more  DCFS 2011»
12 years 7 months ago
Kleene Theorems for Product Systems
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...
Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade
TII
2008
98views more  TII 2008»
13 years 7 months ago
Formal Methods for Systems Engineering Behavior Models
Abstract--Safety analysis in Systems Engineering (SE) processes, as usually implemented, rarely relies on formal methods such as model checking since such techniques, however power...
Charlotte Seidner, Olivier H. Roux
CMSB
2011
Springer
12 years 7 months ago
Coloured stochastic multilevel multiset rewriting
From the phosphorylation state of a molecule to the volume of a cell, parameters are ubiquitous in systems biology. At the same time, most models involve static or dynamic compart...
Nicolas Oury, Gordon D. Plotkin
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
14 years 1 months ago
Unfolding Concurrent Well-Structured Transition Systems
Abstract. Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms fo...
Frédéric Herbreteau, Grégoire...