Article

Combining Finite Automata, Parallel Programs and SDL Using Petri Nets

Author:

TACAS '98: Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems

Pages 102 - 117

Published: 28 March 1998 Publication History

Abstract

No abstract available.

Cited By

View all

Nepomniaschy VBeloglazov DChurina TMashukov M(2008)Using coloured petri nets to model and verify telecommunications systemsProceedings of the 3rd international conference on Computer science: theory and applications10.5555/1813695.1813735(360-371)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.5555/1813695.1813735
Nepomniaschy VAlekseev GArgirov VBeloglazov DBystrov AChetvertakov EChurina TMylnikov SNovikov R(2007)Application of modified coloured petri nets to modeling and verification of SDL specified communication protocolsProceedings of the Second international conference on Computer Science: theory and applications10.5555/2391910.2391941(303-314)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2391910.2391941

Index Terms

Combining Finite Automata, Parallel Programs and SDL Using Petri Nets

Recommendations

Timed Petri nets and timed automata: On the discriminating power of zeno sequences

Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. We study in this paper their relationship, and prove in particular that they are incomparable with respect to language equivalence. In fact, we study the ...
Identification of labeled Petri nets from finite automata
Abstract
Automata and Petri nets are two typical models of discrete event systems. The paper studies the problem of converting a finite automaton into a Petri net that satisfies the specified structural features. More specifically, we identify a labeled ...
Extensions of pushdown automata and Petri nets
CSC '89: Proceedings of the 17th conference on ACM Annual Computer Science Conference

A new class of "concurrent automata" is constructed. These automata are extensions of pushdown automata and Petri nets. They lie properly between ordinary Petri nets and Turing machines. In the September 1977 issue of Computing survey James Peterson ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

TACAS '98: Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems

March 1998

455 pages

ISBN:3540643567

Editor:
Bernhard Steffen

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 28 March 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nepomniaschy VBeloglazov DChurina TMashukov M(2008)Using coloured petri nets to model and verify telecommunications systemsProceedings of the 3rd international conference on Computer science: theory and applications10.5555/1813695.1813735(360-371)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.5555/1813695.1813735
Nepomniaschy VAlekseev GArgirov VBeloglazov DBystrov AChetvertakov EChurina TMylnikov SNovikov R(2007)Application of modified coloured petri nets to modeling and verification of SDL specified communication protocolsProceedings of the Second international conference on Computer Science: theory and applications10.5555/2391910.2391941(303-314)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2391910.2391941

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Timed Petri nets and timed automata: On the discriminating power of zeno sequences

Identification of labeled Petri nets from finite automata

Extensions of pushdown automata and Petri nets

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations