The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Selected papers of the Second Workshop on Concurrency and compositionality
Handbook of logic in computer science (vol. 4)
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Mapping Petri Nets with Inhibitor Arcs onto Basic LOTOS Behavior Expressions
IEEE Transactions on Computers
An Improved Translation of SA/RT Specification Model to High-Level Timed Petri Nets
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
Transition Systems of Elementary Net Systems with Inhibitor Arcs
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Concurrent Implementation of Asynchronous Transition Systems
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
A Framework for Translating Models and Specifications
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
STeP: The Stanford Temporal Prover (Educational Release) User''s Manual
STeP: The Stanford Temporal Prover (Educational Release) User''s Manual
A Framework for Translating Models and Specifications
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Scenario modeling and verification for business processes
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
| Hi-index | 0.04 |
Translations between models expressed in textual transition systems and those expressed in structured Petri net notation are presented, in both directions. The translations are structure-preserving, meaning that the hierarchical structure of the systems is preserved. Furthermore, assuming non-finite data has been abstracted out of the textual transition system, then translating one model to another and then back results in a model which is identical to the original one, up to renaming and the form of Boolean expressions. Due to inherent differences between the two notations, however, some additional information is required in order to obtain this identity. The information is collected during the translation in one direction and is used in the translation back.Our translation is also semantics-preserving. That is, the original model and the translated model are bisimulation equivalent, assuming nonfinite data is abstracted. Thus, the translation preserves all temporal properties expressible in the logic CTL*.The translations are both more generally applicable and more detailed than previously considered. They are shown both for individual modules, with a collection of transitions, and for a structured system, where modules are combined in different ways.