Timed P Automata

Authors:
Roberto Barbuti;Andrea Maggiolo-Schettini;Paolo Milazzo;Luca Tesei
Affiliations:
Dipartimento di Informatica, Università di Pisa, Largo Pontecorvo 3, 56127 Pisa, Italy. {barbuti,maggiolo,milazzo}@di.unipi.it;Dipartimento di Informatica, Università di Pisa, Largo Pontecorvo 3, 56127 Pisa, Italy. {barbuti,maggiolo,milazzo}@di.unipi.it;(Correspd.) Dipartimento di Informatica, Università di Pisa, Largo Pontecorvo 3, 56127 Pisa, Italy. {barbuti,maggiolo,milazzo}@di.unipi.it;Dipartimento di Matematica e Informatica, Università di Camerino, Via Madonna delle Carceri 9, 62032 Camerino (MC), Italy. luca.tesei@unicam.it
Venue:
Fundamenta Informaticae
Year:
2009

Citing 8
Cited 0

A theory of timed automata

Theoretical Computer Science
Symbolic model checking for real-time systems

Information and Computation
Computing with membranes

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Computation: finite and infinite machines

Computation: finite and infinite machines
Timed P Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Time–independent p systems

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

To study systems whose dynamics changes with time, an extension of timed P systems is introduced in which evolution rules may vary with time. The proposed model is a timed automaton with a discrete time domain and in which each state is a timed P system. A result on expressive power and on features of the formalism sufficient for full expressiveness is proved and, as an application example, the model of an ecological system is given.