On the computational power of timed differentiable petri nets

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

Volumn 4202 LNCS, Issue , 2006, Pages 230-244

  Haddad, Serge ^a   Recalde, Laura ^b   Silva, Manuel ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DIFFERENTIATION (CALCULUS); DISCRETE TIME CONTROL SYSTEMS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; ORDINARY DIFFERENTIAL EQUATIONS;

CONTINUOUS SYSTEMS; DYNAMICAL SYSTEMS; SUBMARKING REACHABILITY; TIMED DIFFERENTIABLE PETRI NETS (TDPN);

PETRI NETS;

EID: 33750361399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11867340_17     Document Type: Conference Paper

References (13)

1. Rajeev Alur and David Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
2. E. Asarin, O. Maler, and A. Pnueli. Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science, 138-1:35-65, 1995.
3. Eugene Asarin and Oded Maler. Achilles and the tortoise climbing up the arithmetical hierarchy. Journal of Computer and System Sciences, 57(3):389-398, 1998.
4. F. Balduzzi, A. Di Febbraro, A. Giua, and C. Seatzu. Decidability results in first-order hybrid petri nets. Discrete Event Dynamic Systems, 11(1 and 2):41-58, 2001.
5. Olivier Bournez. Some bounds on the computational power of piecewise constant derivative systems. Theory of Computing Systems, 32(1):35-67, 1999.
6. Michael S. Branicky. Universal computation and other capabilities of hybrid and continuous dynamical systems. Theoretical Computer Science, 138(1):67-100, 1995.
7. R. David and H. Alla. Discrete, Continuous, and Hybrid Petri Nets. Springer-Verlag, 2004.
8. Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What's decidable about hybrid automata? Journal of Computer and System Sciences, 57(1):94-124, 1998.
9. J.E. Hopcroft and J.D. Ullman. Formal languages and their relation to automata. Addison-Wesley, 1969.
10. Gerardo Lafferriere, George J. Pappas, and Sergio Yovine. Symbolic reachability computation for families of linear vector fields. Journal of Symbolic Computation, 32(3):231-253, 2001.
11. Venkatesh Mysore and Amir Pnueli. Refining the undecidability frontier of hybrid automata. In FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science 25th International Conference, volume 3821 of LNCS, pages 261-272, Hyderabad, India, 2005. Springer.
12. Hava T. Siegelmann and Eduardo D. Sontag. Analog computation via neural networks. Theoretical Computer Science, 131(2):331-360, 1994.
13. M. Silva and L. Recalde. Petri nets and integrality relaxations: A view of continuous Petri nets. IEEE Trans. on Systems, Man, and Cybernetics, 32(4):314-327, 2002.