Sciweavers

191 search results - page 28 / 39
» Transition systems, link graphs and Petri nets
Sort
View
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
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 1 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
HT
1997
ACM
14 years 3 days ago
Collective Phenomena in Hypertext Networks
A large hypertext net with node-to-node links can be interesting as a system of unities of meaning formed by node clusters, such that nodes in each of them are orderable into a co...
Valery M. Chelnokov, Victoria L. Zephyrova
ICCS
2007
Springer
14 years 2 months ago
Autonomic Workflow Management in the Grid
The autonomic workflow engine enables workflow to be dynamically specified and adapted using Event-Condition-Action rules. A new approach to autonomic execution of workflow process...
Guangsheng Zhang, Changjun Jiang, Jing Sha, Ping S...
ICALP
2005
Springer
14 years 1 months ago
Spatial Logics for Bigraphs
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...