{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:28:59Z","timestamp":1775053739503,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540403340","type":"print"},{"value":"9783540449195","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44919-1_25","type":"book-chapter","created":{"date-parts":[[2007,9,2]],"date-time":"2007-09-02T20:38:42Z","timestamp":1188765522000},"page":"397-416","source":"Crossref","is-referenced-by-count":3,"title":["Hierarchical Timed High Level Nets and Their Branching Processes"],"prefix":"10.1007","author":[{"given":"Hans","family":"Fleischhack","sequence":"first","affiliation":[]},{"given":"Elisabeth","family":"Pelz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"25_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-45740-2_18","volume-title":"Advances in Petri Nets 2001","author":"O. M. Alonso","year":"2001","unstructured":"O. M. Alonso and D. de Frutos Escrig. Extending the Petri Box Calculus with Time. In J. Colom, M. Koutny, (Eds.), Advances in Petri Nets 2001, Volume 2075 of LNCS, pages 303\u2013322. Springer, (2001)."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"T. Aura, J. Lilius: Time Processes for Time Petri Nets. Proc. ICATPN, Toulouse (1997).","DOI":"10.1007\/3-540-63139-9_34"},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/32.75415","volume":"17\/","author":"B. Berthomieu","year":"1991","unstructured":"B. Berthomieu, M. Diaz: Modelling and Verification of Time Dependent Systems Using Time Petri Nets. IEEE Transactions on Software Engineering, Volume 17\/3, 259\u2013273 (1991).","journal-title":"IEEE Transactions on Software Engineering"},{"key":"25_CR4","unstructured":"E. Best: Partial Order Verification with PEP. Proc. POMIV\u201996, Partial Order Methods in Verification, G. Holzmann, D. Peled, and V. Pratt (eds.), American Mathematical Society (1996)."},{"key":"25_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-56503-5_16","volume-title":"General refinement and recursion operators for the Petri box calculus","author":"E. Best","year":"1993","unstructured":"E. Best, R. Devillers, and J. Esparza. General refinement and recursion operators for the Petri box calculus. LNCS 665:130\u2013140, (1993)."},{"key":"25_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-55610-9_167","volume-title":"Advances in Petri Nets 92","author":"E. Best","year":"1992","unstructured":"E. Best, R. Devillers, and J. G. Hall. The box calculus: a New Causal Algebra With Multi-Label Communication. In G. Rozenberg, (Ed.), Advances in Petri Nets 92, Volume 609 of LNCS, pages 21\u201369. Springer, 1992."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"E. Best, R. Devillers, and M. Koutny. Petri Net Algebra. Springer-Verlag. EATCS Monographs on Theoretical Computer Science Series 2001.","DOI":"10.1007\/978-3-662-04457-5"},{"key":"25_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-60029-9_36","volume-title":"Application and Theory of Petri Nets 1995","author":"E. Best","year":"1995","unstructured":"E. Best, H. Fleischhack, W. Fraczak, R. P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. In G. De Michelis and M. Diaz, (Eds.), Application and Theory of Petri Nets 1995, Volume 935 of LNCS, pages 103\u2013118. Springer, 1995."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"E. Best, W. Fraczak, R. Hopkins, H. Klaudel, and E. Pelz. M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages. Acta Informatica, 35, 1998.","DOI":"10.1007\/s002360050144"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"B. Bieber and H. Fleischhack: Model Checking of Time Petri Nets Based on Partial Order Semantics. Proceedings of ConCur\u201999, Eindhoven (1999).","DOI":"10.1007\/3-540-48320-9_16"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"R. Devillers and H. Klaudel. Refinement and Recursion in a High Level Petri Box Calculus. STRICT\u201995. Springer, ViC, 144\u2013159 (1995).","DOI":"10.1007\/978-1-4471-3078-9_10"},{"key":"25_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BFb0058038","volume-title":"FST & TCS\u201997","author":"R. Devillers","year":"1997","unstructured":"R. Devillers, H. Klaudel and R.-C. Riemann. General Refinement for High Level Petri Nets. FST & TCS\u201997, Springer, LNCS Vol. 1346, 297\u2013311 (1997)."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"R. Devillers, H. Klaudel and R.-C. Riemann. General parameterised refinement for the M-net calculus. Theoretical Computer Science, to appear.","DOI":"10.1016\/S0304-3975(02)00088-9"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/0169-023X(91)90024-R","volume":"6","author":"R. Durchholz","year":"1991","unstructured":"R. Durchholz. Causality, time, and deadlines. Data & Knowledge Engineering, 6:496\u2013477, 1991.","journal-title":"Data & Knowledge Engineering"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet: Branching Processes of Petri Nets, Acta Informatica, Volume 28, pages 575\u2013591 (1991).","journal-title":"Acta Informatica"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(94)00019-0","volume":"23","author":"J. Esparza","year":"1994","unstructured":"J. Esparza: Model Checking Using Net Unfoldings. Science of Computer Programming, Volume 23, 151\u2013195, Elsevier (1994).","journal-title":"Science of Computer Programming"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"J. Esparza, S. R\u00f6mer, and W. Vogler: An Improvement of McMillan\u2019s Unfolding Algorithm. Proc. of TACAS\u201996 (1996).","DOI":"10.1007\/3-540-61042-1_40"},{"key":"25_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-48068-4_11","volume-title":"Advances in Petri Nets 2002","author":"H. Fleischhack","year":"2002","unstructured":"H. Fleischhack and C. Stehno. Computing a Finite Prefix of a Time Petri Net. In Advances in Petri Nets 2002, Volume 2360 of LNCS, pages 163\u2013181. Springer, 2002."},{"key":"25_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of ASIAN\u201999","author":"H. Klaudel","year":"1999","unstructured":"H. Klaudel and F. Pommereau. Asynchronous links in the PBC and M-nets. In Proc. of ASIAN\u201999, LNCS 1742:190\u2013200, 1999."},{"key":"25_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-40911-4_19","volume-title":"Proc. of IFM\u201900","author":"H. Klaudel","year":"2000","unstructured":"H. Klaudel and F. Pommereau. A concurrent and compositional Petri net semantics of preemption. In W. Grieskamp, T. Santen, B. Stoddart (Eds.), Proc. of IFM\u201900, LNCS 1945, pages 318\u2013337, Springer, 2000."},{"key":"25_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-45740-2_13","volume-title":"Advances in Petri Nets 2001","author":"H. Klaudel","year":"2001","unstructured":"H. Klaudel and F. Pommereau. A Concurrent Semantics of Static Exceptions in a Parallel Programming Language. In J. Colom, M. Koutny, (Eds.), Advances in Petri Nets 2001, Volume 2075 of LNCS, pages 204\u2013223. Springer, (2001)."},{"key":"25_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-44988-4_18","volume-title":"Advances in Petri Nets 2001","author":"M. Koutny","year":"2000","unstructured":"M. Koutny. A Compositional Model of Time Petri Nets. In M. Nielsen, D. Simpson, (Eds.), Advances in Petri Nets 2001, Volume 1825 of LNCS, pages 303\u2013322. Springer, 2000."},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"J. Lilius: Efficient state space search for time Petri nets. MFCS Workshop on Concurrency (1998).","DOI":"10.1016\/S1571-0661(05)80254-3"},{"key":"25_CR24","series-title":"Lect Notes Comput Sci","first-page":"164","volume-title":"Proc. CAV\u2019 92, Fourth Workshop on Computer-Aided Verification","author":"K.L. McMillan","year":"1992","unstructured":"K.L. McMillan: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. Proc. CAV\u2019 92, Fourth Workshop on Computer-Aided Verification, Vol. 663 of LNCS, 164\u2013174 (1992)."},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TCOM.1976.1093424","volume":"24","author":"P. Merlin","year":"1976","unstructured":"P. Merlin, D. Farber: Recoverability of Communication Protocols \u2014 Implication of a Theoretical Study. IEEE Transactions on Software Communications, Vol. 24, 1036\u20131043 (1976).","journal-title":"IEEE Transactions on Software Communications"},{"key":"25_CR26","unstructured":"E. Pelz and H. Fleischhack. High Level Petri Nets with Timing Constraints \u2014 a Comparison to appear in Proc. of ASCD 03, special volume of June 2003."},{"key":"25_CR27","series-title":"Lect Notes Comput Sci","volume-title":"Journal of Information Processing and Cybernetics","author":"L. Popova","year":"1991","unstructured":"L. Popova: On Time Petri Nets. Journal of Information Processing and Cybernetics, Volume 1055 of LNCS, Springer (1991)."},{"key":"25_CR28","unstructured":"C. Ramchandani: Analysis of Asynchronous Concurrent Systems by Timed Petri Nets, MIT, Project MAC, Technical Report 120, (1974)."},{"key":"25_CR29","unstructured":"G. Richter. Counting interfaces for discrete time modeling. Technical Report rep-set-1998-26, GMD, 1998."},{"key":"25_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-10001-6_30","volume-title":"Performance Evaluation of Systems Using Nets","author":"J. Sifakis","year":"1980","unstructured":"J. Sifakis: Performance Evaluation of Systems Using Nets. Volume 84 of LNCS, pages 307\u2013319, Springer (1980)."},{"key":"25_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09262-9","volume-title":"Analyse von Petri-Netz-Modellen","author":"P. Starke","year":"1990","unstructured":"P. Starke: Analyse von Petri-Netz-Modellen. Teubner Verlag, Stuttgart (1990) (in German)."}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44919-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T15:41:50Z","timestamp":1556811710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44919-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403340","9783540449195"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-44919-1_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}