Closure properties of deterministic Petri nets
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
The Book of Traces
Deriving Unbounded Petri Nets from Formal Languages
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Checking Regular Properties of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Deciding Properties for Message Sequence Charts
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On the Decidability of Model Checking for Several µ-calculi and Petri Nets
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
LSCs: Breathing Life into Message Sequence Charts
LSCs: Breathing Life into Message Sequence Charts
Synthesizing State-Based Object Systems from LSC Specifications
Synthesizing State-Based Object Systems from LSC Specifications
Region based synthesis of P/T-nets and its potential applications
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
UML for real
Proceedings of the 5th ACM international conference on Embedded software
Products of message sequence charts
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Hi-index | 0.00 |
The paper presents ongoing work aiming at understanding the nature of specifications given by High Level Message Sequence Charts and the ways in which they can be put into effective use. Contrarily to some authors, we do not set finite state restrictions on HMSCs as we feel such restrictions do not fit in with the type of distributed systems encountered today in the field of telecommunications. The talk presents first a series of undecidability results about general HMSCs following from corresponding undecidability results on rational sets in product monoids. These negative results which with one exception do not appear yet in the literature on HMSCs do indicate that the sole way in which general HMSCs may be usefully handed as behavioural specifications is to interpret their linear extensions as minimal languages, to be approximated from above in any realization. The problem is then to investigate frameworks in which these incomplete specifications may be given a meaning by a closure operation. The second part of the paper presents a closure operation relative to Petri net languages. This closure operation is an effective procedure that relies on semilinear properties of HMSCs languages. We finally present some decidability results for the distribution and verification of HMSCs transformed into Petri nets.