FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5465885
DOI10.1007/b104325zbMath1117.68445OpenAlexW2950473912MaRDI QIDQ5465885
Pritha Mahata, Parosh Aziz Abdulla, Richard Mayr
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
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
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