When are timed automata weakly timed bisimilar to time Petri nets?
type: Item
instance of: scholarly article
title: When are timed automata weakly timed bisimilar to time Petri nets?
zbMATH Open document ID: 1158.68029
published in: Theoretical Computer Science
publication date: 2008-09-16T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5344347
zbMATH Keywords: time Petri nets
zbMATH Keywords: timed automata
zbMATH Keywords: weak timed bisimilarity
author: Béatrice Bérard
author: Franck Cassez
author: Serge Haddad
author: Didier Lime
author: Olivier H. Roux
describes a project that uses: Kronos
describes a project that uses: Romeo
describes a project that uses: TINA
describes a project that uses: Uppaal2k
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.03.030
OpenAlex ID: W1989800577
cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
cites work: Q4535172
cites work: Is your model checker on time? On the complexity of model checking for timed modal logics
cites work: A theory of timed automata
cites work: A causal semantic for time Petri nets
cites work: Automated Technology for Verification and Analysis
cites work: Formal Modeling and Analysis of Timed Systems
cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
cites work: Q4264103
cites work: Forward analysis of updatable timed automata
cites work: Updatable timed automata
cites work: Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
cites work: Computer Aided Verification
cites work: Symbolic model checking for real-time systems
cites work: Q5472942
cites work: Kronos: A verification tool for real-time systems
DOI: 10.1016/J.TCS.2008.03.030
description: scientific article; zbMATH DE number 5344347