An unfolding algorithm for synchronous products of transition systems

Javier Esparza; Stefan Römer

doi:10.1007/3-540-48320-9_2

An unfolding algorithm for synchronous products of transition systems

Javier Esparza, Stefan Römer

Informatics 7 - Chair of Theoretical Computer Science

Technical University of Munich

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

44 Scopus citations

Abstract

The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]. An unfolding procedure is provided which exploits the product structure of the model. Its performance is evaluated on a set of benchmarks.

Original language	English
Title of host publication	CONCUR 1999, Concurrency Theory - 10th International Conference, Proceedings
Publisher	Springer Verlag
Pages	2-20
Number of pages	19
ISBN (Print)	3540664254, 9783540664253
DOIs	https://doi.org/10.1007/3-540-48320-9_2
State	Published - 1999
Event	10th International Conference on Concurrency Theory, CONCUR 1999 - Eindhoven, Netherlands Duration: 24 Aug 1999 → 27 Aug 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1664 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th International Conference on Concurrency Theory, CONCUR 1999
Country/Territory	Netherlands
City	Eindhoven
Period	24/08/99 → 27/08/99

Access to Document

10.1007/3-540-48320-9_2

Cite this

Esparza, J., & Römer, S. (1999). An unfolding algorithm for synchronous products of transition systems. In CONCUR 1999, Concurrency Theory - 10th International Conference, Proceedings (pp. 2-20). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1664 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-48320-9_2

@inproceedings{b2c129c8d8fe4b3cbb2c972fc67be82a,

title = "An unfolding algorithm for synchronous products of transition systems",

abstract = "The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]. An unfolding procedure is provided which exploits the product structure of the model. Its performance is evaluated on a set of benchmarks.",

author = "Javier Esparza and Stefan R{\"o}mer",

year = "1999",

doi = "10.1007/3-540-48320-9_2",

language = "English",

isbn = "3540664254",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "2--20",

booktitle = "CONCUR 1999, Concurrency Theory - 10th International Conference, Proceedings",

note = "10th International Conference on Concurrency Theory, CONCUR 1999 ; Conference date: 24-08-1999 Through 27-08-1999",

}

Esparza, J & Römer, S 1999, An unfolding algorithm for synchronous products of transition systems. in CONCUR 1999, Concurrency Theory - 10th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1664 LNCS, Springer Verlag, pp. 2-20, 10th International Conference on Concurrency Theory, CONCUR 1999, Eindhoven, Netherlands, 24/08/99. https://doi.org/10.1007/3-540-48320-9_2

An unfolding algorithm for synchronous products of transition systems. / Esparza, Javier; Römer, Stefan.
CONCUR 1999, Concurrency Theory - 10th International Conference, Proceedings. Springer Verlag, 1999. p. 2-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1664 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An unfolding algorithm for synchronous products of transition systems

AU - Esparza, Javier

AU - Römer, Stefan

PY - 1999

Y1 - 1999

N2 - The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]. An unfolding procedure is provided which exploits the product structure of the model. Its performance is evaluated on a set of benchmarks.

AB - The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]. An unfolding procedure is provided which exploits the product structure of the model. Its performance is evaluated on a set of benchmarks.

UR - http://www.scopus.com/inward/record.url?scp=84888221301&partnerID=8YFLogxK

U2 - 10.1007/3-540-48320-9_2

DO - 10.1007/3-540-48320-9_2

M3 - Conference contribution

AN - SCOPUS:84888221301

SN - 3540664254

SN - 9783540664253

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 2

EP - 20

BT - CONCUR 1999, Concurrency Theory - 10th International Conference, Proceedings

PB - Springer Verlag

T2 - 10th International Conference on Concurrency Theory, CONCUR 1999

Y2 - 24 August 1999 through 27 August 1999

ER -

An unfolding algorithm for synchronous products of transition systems

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this