A process algebraic reduction strategy for automata theoretic verification of untimed and timed concurrent systems

Show full item record



Permalink

http://urn.fi/URN:ISBN:952-10-1451-2
Title: A process algebraic reduction strategy for automata theoretic verification of untimed and timed concurrent systems
Author: Luukkainen, Matti
Contributor: University of Helsinki, Faculty of Science, Department of Computer Science
Publisher: Helsingin yliopisto
Date: 2003-11
Language: en
URI: http://urn.fi/URN:ISBN:952-10-1451-2
http://hdl.handle.net/10138/21369
Thesis level: Doctoral dissertation
Rights: This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.


Files in this item

Total number of downloads: Loading...

Files Size Format View
aprocess.pdf 1.180Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record