Recursive Petri nets
Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that t...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Haddad, Serge [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2007 |
|---|
| Schlagwörter: |
|---|
| Systematik: |
|
|---|
| Anmerkung: |
© Springer-Verlag 2007 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Acta informatica - Springer-Verlag, 1971, 44(2007), 7-8 vom: 11. Sept., Seite 463-508 |
|---|---|
| Übergeordnetes Werk: |
volume:44 ; year:2007 ; number:7-8 ; day:11 ; month:09 ; pages:463-508 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00236-007-0055-y |
|---|
| Katalog-ID: |
OLC2056520249 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2056520249 | ||
| 003 | DE-627 | ||
| 005 | 20230324022039.0 | ||
| 007 | tu | ||
| 008 | 200819s2007 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00236-007-0055-y |2 doi | |
| 035 | |a (DE-627)OLC2056520249 | ||
| 035 | |a (DE-He213)s00236-007-0055-y-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 050 |q VZ |
| 084 | |a 24,1 |2 ssgn | ||
| 084 | |a SA 1220 |q VZ |2 rvk | ||
| 100 | 1 | |a Haddad, Serge |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Recursive Petri nets |
| 264 | 1 | |c 2007 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag 2007 | ||
| 520 | |a Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure. | ||
| 650 | 4 | |a Label Transition System | |
| 650 | 4 | |a Discrete Event System | |
| 650 | 4 | |a Abstract Transition | |
| 650 | 4 | |a Reachability Graph | |
| 650 | 4 | |a Reachability Problem | |
| 700 | 1 | |a Poitrenaud, Denis |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Acta informatica |d Springer-Verlag, 1971 |g 44(2007), 7-8 vom: 11. Sept., Seite 463-508 |w (DE-627)129288179 |w (DE-600)120032-X |w (DE-576)014469766 |x 0001-5903 |7 nnns |
| 773 | 1 | 8 | |g volume:44 |g year:2007 |g number:7-8 |g day:11 |g month:09 |g pages:463-508 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00236-007-0055-y |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-BBI | ||
| 912 | |a GBV_ILN_21 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_100 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4046 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4313 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4319 | ||
| 912 | |a GBV_ILN_4324 | ||
| 912 | |a GBV_ILN_4700 | ||
| 936 | r | v | |a SA 1220 |
| 951 | |a AR | ||
| 952 | |d 44 |j 2007 |e 7-8 |b 11 |c 09 |h 463-508 | ||
| author_variant |
s h sh d p dp |
|---|---|
| matchkey_str |
article:00015903:2007----::eusvpt |
| hierarchy_sort_str |
2007 |
| publishDate |
2007 |
| allfields |
10.1007/s00236-007-0055-y doi (DE-627)OLC2056520249 (DE-He213)s00236-007-0055-y-p DE-627 ger DE-627 rakwb eng 050 VZ 24,1 ssgn SA 1220 VZ rvk Haddad, Serge verfasserin aut Recursive Petri nets 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2007 Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure. Label Transition System Discrete Event System Abstract Transition Reachability Graph Reachability Problem Poitrenaud, Denis aut Enthalten in Acta informatica Springer-Verlag, 1971 44(2007), 7-8 vom: 11. Sept., Seite 463-508 (DE-627)129288179 (DE-600)120032-X (DE-576)014469766 0001-5903 nnns volume:44 year:2007 number:7-8 day:11 month:09 pages:463-508 https://doi.org/10.1007/s00236-007-0055-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 SA 1220 AR 44 2007 7-8 11 09 463-508 |
| spelling |
10.1007/s00236-007-0055-y doi (DE-627)OLC2056520249 (DE-He213)s00236-007-0055-y-p DE-627 ger DE-627 rakwb eng 050 VZ 24,1 ssgn SA 1220 VZ rvk Haddad, Serge verfasserin aut Recursive Petri nets 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2007 Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure. Label Transition System Discrete Event System Abstract Transition Reachability Graph Reachability Problem Poitrenaud, Denis aut Enthalten in Acta informatica Springer-Verlag, 1971 44(2007), 7-8 vom: 11. Sept., Seite 463-508 (DE-627)129288179 (DE-600)120032-X (DE-576)014469766 0001-5903 nnns volume:44 year:2007 number:7-8 day:11 month:09 pages:463-508 https://doi.org/10.1007/s00236-007-0055-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 SA 1220 AR 44 2007 7-8 11 09 463-508 |
| allfields_unstemmed |
10.1007/s00236-007-0055-y doi (DE-627)OLC2056520249 (DE-He213)s00236-007-0055-y-p DE-627 ger DE-627 rakwb eng 050 VZ 24,1 ssgn SA 1220 VZ rvk Haddad, Serge verfasserin aut Recursive Petri nets 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2007 Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure. Label Transition System Discrete Event System Abstract Transition Reachability Graph Reachability Problem Poitrenaud, Denis aut Enthalten in Acta informatica Springer-Verlag, 1971 44(2007), 7-8 vom: 11. Sept., Seite 463-508 (DE-627)129288179 (DE-600)120032-X (DE-576)014469766 0001-5903 nnns volume:44 year:2007 number:7-8 day:11 month:09 pages:463-508 https://doi.org/10.1007/s00236-007-0055-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 SA 1220 AR 44 2007 7-8 11 09 463-508 |
| allfieldsGer |
10.1007/s00236-007-0055-y doi (DE-627)OLC2056520249 (DE-He213)s00236-007-0055-y-p DE-627 ger DE-627 rakwb eng 050 VZ 24,1 ssgn SA 1220 VZ rvk Haddad, Serge verfasserin aut Recursive Petri nets 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2007 Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure. Label Transition System Discrete Event System Abstract Transition Reachability Graph Reachability Problem Poitrenaud, Denis aut Enthalten in Acta informatica Springer-Verlag, 1971 44(2007), 7-8 vom: 11. Sept., Seite 463-508 (DE-627)129288179 (DE-600)120032-X (DE-576)014469766 0001-5903 nnns volume:44 year:2007 number:7-8 day:11 month:09 pages:463-508 https://doi.org/10.1007/s00236-007-0055-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 SA 1220 AR 44 2007 7-8 11 09 463-508 |
| allfieldsSound |
10.1007/s00236-007-0055-y doi (DE-627)OLC2056520249 (DE-He213)s00236-007-0055-y-p DE-627 ger DE-627 rakwb eng 050 VZ 24,1 ssgn SA 1220 VZ rvk Haddad, Serge verfasserin aut Recursive Petri nets 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2007 Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure. Label Transition System Discrete Event System Abstract Transition Reachability Graph Reachability Problem Poitrenaud, Denis aut Enthalten in Acta informatica Springer-Verlag, 1971 44(2007), 7-8 vom: 11. Sept., Seite 463-508 (DE-627)129288179 (DE-600)120032-X (DE-576)014469766 0001-5903 nnns volume:44 year:2007 number:7-8 day:11 month:09 pages:463-508 https://doi.org/10.1007/s00236-007-0055-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 SA 1220 AR 44 2007 7-8 11 09 463-508 |
| language |
English |
| source |
Enthalten in Acta informatica 44(2007), 7-8 vom: 11. Sept., Seite 463-508 volume:44 year:2007 number:7-8 day:11 month:09 pages:463-508 |
| sourceStr |
Enthalten in Acta informatica 44(2007), 7-8 vom: 11. Sept., Seite 463-508 volume:44 year:2007 number:7-8 day:11 month:09 pages:463-508 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Label Transition System Discrete Event System Abstract Transition Reachability Graph Reachability Problem |
| dewey-raw |
050 |
| isfreeaccess_bool |
false |
| container_title |
Acta informatica |
| authorswithroles_txt_mv |
Haddad, Serge @@aut@@ Poitrenaud, Denis @@aut@@ |
| publishDateDaySort_date |
2007-09-11T00:00:00Z |
| hierarchy_top_id |
129288179 |
| dewey-sort |
250 |
| id |
OLC2056520249 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2056520249</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230324022039.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00236-007-0055-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2056520249</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00236-007-0055-y-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">050</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">24,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 1220</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Haddad, Serge</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recursive Petri nets</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2007</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Label Transition System</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Event System</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Abstract Transition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reachability Graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reachability Problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Poitrenaud, Denis</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Acta informatica</subfield><subfield code="d">Springer-Verlag, 1971</subfield><subfield code="g">44(2007), 7-8 vom: 11. Sept., Seite 463-508</subfield><subfield code="w">(DE-627)129288179</subfield><subfield code="w">(DE-600)120032-X</subfield><subfield code="w">(DE-576)014469766</subfield><subfield code="x">0001-5903</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:44</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:7-8</subfield><subfield code="g">day:11</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:463-508</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00236-007-0055-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 1220</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">44</subfield><subfield code="j">2007</subfield><subfield code="e">7-8</subfield><subfield code="b">11</subfield><subfield code="c">09</subfield><subfield code="h">463-508</subfield></datafield></record></collection>
|
| author |
Haddad, Serge |
| spellingShingle |
Haddad, Serge ddc 050 ssgn 24,1 rvk SA 1220 misc Label Transition System misc Discrete Event System misc Abstract Transition misc Reachability Graph misc Reachability Problem Recursive Petri nets |
| authorStr |
Haddad, Serge |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129288179 |
| format |
Article |
| dewey-ones |
050 - General serial publications |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0001-5903 |
| topic_title |
050 VZ 24,1 ssgn SA 1220 VZ rvk Recursive Petri nets Label Transition System Discrete Event System Abstract Transition Reachability Graph Reachability Problem |
| topic |
ddc 050 ssgn 24,1 rvk SA 1220 misc Label Transition System misc Discrete Event System misc Abstract Transition misc Reachability Graph misc Reachability Problem |
| topic_unstemmed |
ddc 050 ssgn 24,1 rvk SA 1220 misc Label Transition System misc Discrete Event System misc Abstract Transition misc Reachability Graph misc Reachability Problem |
| topic_browse |
ddc 050 ssgn 24,1 rvk SA 1220 misc Label Transition System misc Discrete Event System misc Abstract Transition misc Reachability Graph misc Reachability Problem |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Acta informatica |
| hierarchy_parent_id |
129288179 |
| dewey-tens |
050 - Magazines, journals & serials |
| hierarchy_top_title |
Acta informatica |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129288179 (DE-600)120032-X (DE-576)014469766 |
| title |
Recursive Petri nets |
| ctrlnum |
(DE-627)OLC2056520249 (DE-He213)s00236-007-0055-y-p |
| title_full |
Recursive Petri nets |
| author_sort |
Haddad, Serge |
| journal |
Acta informatica |
| journalStr |
Acta informatica |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2007 |
| contenttype_str_mv |
txt |
| container_start_page |
463 |
| author_browse |
Haddad, Serge Poitrenaud, Denis |
| container_volume |
44 |
| class |
050 VZ 24,1 ssgn SA 1220 VZ rvk |
| format_se |
Aufsätze |
| author-letter |
Haddad, Serge |
| doi_str_mv |
10.1007/s00236-007-0055-y |
| dewey-full |
050 |
| title_sort |
recursive petri nets |
| title_auth |
Recursive Petri nets |
| abstract |
Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure. © Springer-Verlag 2007 |
| abstractGer |
Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure. © Springer-Verlag 2007 |
| abstract_unstemmed |
Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure. © Springer-Verlag 2007 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_120 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2021 GBV_ILN_2244 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 |
| container_issue |
7-8 |
| title_short |
Recursive Petri nets |
| url |
https://doi.org/10.1007/s00236-007-0055-y |
| remote_bool |
false |
| author2 |
Poitrenaud, Denis |
| author2Str |
Poitrenaud, Denis |
| ppnlink |
129288179 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00236-007-0055-y |
| up_date |
2024-07-04T04:33:00.611Z |
| _version_ |
1803621583410954240 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2056520249</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230324022039.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00236-007-0055-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2056520249</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00236-007-0055-y-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">050</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">24,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 1220</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Haddad, Serge</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recursive Petri nets</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2007</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Label Transition System</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Event System</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Abstract Transition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reachability Graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reachability Problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Poitrenaud, Denis</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Acta informatica</subfield><subfield code="d">Springer-Verlag, 1971</subfield><subfield code="g">44(2007), 7-8 vom: 11. Sept., Seite 463-508</subfield><subfield code="w">(DE-627)129288179</subfield><subfield code="w">(DE-600)120032-X</subfield><subfield code="w">(DE-576)014469766</subfield><subfield code="x">0001-5903</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:44</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:7-8</subfield><subfield code="g">day:11</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:463-508</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00236-007-0055-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 1220</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">44</subfield><subfield code="j">2007</subfield><subfield code="e">7-8</subfield><subfield code="b">11</subfield><subfield code="c">09</subfield><subfield code="h">463-508</subfield></datafield></record></collection>
|
| score |
7.401354 |