FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/b104325zbMath1117.68445MaRDI QIDQ5465885

Richard Mayr, Parosh Aziz Abdulla, Pritha Mahata

Publication date: 12 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

When are timed automata weakly timed bisimilar to time Petri nets?, Timed Petri nets and timed automata: On the discriminating power of Zeno sequences