Sciweavers

29 search results - page 4 / 6
» Experimenting Formal Proofs of Petri Nets Refinements
Sort
View
AINA
2003
IEEE
13 years 11 months ago
Formal Verification of Condition Data Flow Diagrams for Assurance of Correct Network Protocols
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
Shaoying Liu
FMSB
2008
129views Formal Methods» more  FMSB 2008»
13 years 9 months ago
Rule-Based Modelling, Symmetries, Refinements
Rule-based modelling is particularly effective for handling the highly combinatorial aspects of cellular signalling. The dynamics is described in terms of interactions between part...
Vincent Danos, Jérôme Feret, Walter F...
IANDC
2002
84views more  IANDC 2002»
13 years 7 months ago
Decidability of Split Equivalence
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
Y. Abramson, Alexander Moshe Rabinovich
APN
2009
Springer
14 years 2 months ago
ASAP: An Extensible Platform for State Space Analysis
The ASCoVeCo State space Analysis Platform (ASAP) is a tool for performing explicit state space analysis of coloured Petri nets (CPNs) and other formalisms. ASAP supports a wide ra...
Michael Westergaard, Sami Evangelista, Lars Michae...
ICTAC
2010
Springer
13 years 6 months ago
Formal Modelling of Separation Kernel Components
Abstract. Separation kernels are key components in embedded applications. Their small size and widespread use in high-integrity environments make them good targets for formal model...
Andrius Velykis, Leo Freitas