Paper Info
Title
Petri Nets, Situations, and Automata
Abstract
Scenarios are now widely used when developing distributed systems. In this paper, we provide a semantical foundation for scenarios, which reflects the informal and non-operational use of scenarios. We call this semantics situations. We show that system properties can be specified by implications between situations, and we provide some proof techniques for verifying that a system meets such specifications. The basic proof arguments are automata, which are abstractions of the considered system or some of its causal relations.
Year
DOI
Venue
2002
10.1007/3-540-48068-4_14
ICATPN
Keywords
Field
DocType
considered system,petri nets,non-operational use,proof technique,semantical foundation,causal relation,basic proof argument,semantics situation,system property,distributed system,petri net
Sequence diagram,Petri net,Abstraction,Computer science,Automaton,Theoretical computer science,Weak consistency,Message sequence chart,Semantics,Formal verification
Conference
Volume
ISSN
ISBN
2360
0302-9743
3-540-43787-8
Citations 
PageRank 
References 
1
0.36
8
Authors
1
Name
Order
Citations
PageRank
Ekkart Kindler11219105.52