Author of the publication

Simulation of Timed Petri Nets by Ordinary Petri Nets and Applications to Decidability of the Timed Reachability Problem and other Related Problems.

, , and . PNPM, page 154-163. IEEE Computer Society, (1991)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Characterizing termination in LOTOS via testing., , and . PSTV, volume 38 of IFIP Conference Proceedings, page 237-250. Chapman & Hall, (1995)TIC: A Timed Calculus for LOTOS., , and . FORTE, page 195-209. North-Holland, (1989)Testing Semantics for Probabilistic LOTOS., and . FORTE, volume 43 of IFIP Conference Proceedings, page 367-382. Chapman & Hall, (1995)Unifying the Linear Time-Branching Time Spectrum of Process Semantics, , , and . Logical Methods in Computer Science, (2013)Decision Problems for Petri Nets with Names, and . CoRR, (2010)Petri Nets Are (Not Only) Distributed Automata.. Carl Adam Petri: Ideas, Personality, Impact, Springer, (2019)Simulation of Timed Petri Nets by Ordinary Petri Nets and Applications to Decidability of the Timed Reachability Problem and other Related Problems., , and . PNPM, page 154-163. IEEE Computer Society, (1991)Extending the Petri Box Calculus with Time., and . ICATPN, volume 2075 of Lecture Notes in Computer Science, page 303-322. Springer, (2001)Replicated Ambient Petri Nets., and . International Conference on Computational Science, volume 2658 of Lecture Notes in Computer Science, page 774-783. Springer, (2003)Replicated Ubiquitous Nets., , and . ICCSA (4), volume 3983 of Lecture Notes in Computer Science, page 158-168. Springer, (2006)