A practical approach to verification of mobile systems using net unfoldings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5062 LNCS, Issue , 2008, Pages 327-347

  Meyer, Roland ^a   Khomenko, Victor ^b   Strazny, Tim ^a  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Calculus; Finite control processes; Mobile systems; Model checking; Petri net unfoldings; Safe processes

Indexed keywords

GRAPH THEORY; MARINE BIOLOGY; MODEL CHECKING; PETRI NETS; STATIC ANALYSIS; TRANSLATION (LANGUAGES); VIDEO STREAMING;

EXTENDED PETRI NETS; FINITE CONTROL; FINITE CONTROL PROCESSES; INTERNATIONAL CONFERENCES; MEMORY CONSUMPTION; MOBILE SYSTEMS; NON-TRIVIAL; PETRI NET UNFOLDINGS; RUN-TIME; SAFE PROCESSES; UNFOLDINGS;

PROCESS CONTROL;

EID: 48249095460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68746-7_22     Document Type: Conference Paper

References (18)

1. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
2. Dam, M.: Model checking mobile processes. Information and Computation 129(1), 35-51 (1996)
3. Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 37-56. Springer, Heidelberg (2001)
4. Esparza, J., Römer, S., Vogler, W.: An Improvement of McMillan's Unfolding Algorithm. Formal Methods in System Design 20(3), 285-310 (2002)
5. Esparza, J.: Decidability and complexity of Petri net problems - an introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 374-428. Springer, Heidelberg (1998)
6. Ferrari, G.-L., Gnesi, S., Montanari, U., Pistore, M.: A model-checking verification environment for mobile processes. ACM Transactions on Software Engineering and Methodology 12(4), 440-473 (2003)
7. Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. PhD thesis, School of Computing Science, Newcastle University (2003)
8. Khomenko, V., Koutny, M., Niaouris, A.: Applying Petri net unfoldings for verification of mobile systems. In: Proc. Workshop on Modelling of Objects, Components and Agents (MOCA 2006), Bericht FBI-HH-B-267/06, pp. 161-178. University of Hamburg (2006)
9. Khomenko, V., Koutny, M., Yakovlev, A.: Detecting state coding conflicts in STG unfoldings using SAT. Fundamenta Informaticae 62(2), 1-21 (2004)
10. McMillan, K.: Using unfoldings to avoid state explosion problem in the verification of asynchronous circuits. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, pp. 164-174. Springer, Heidelberg (1993)
11. Meyer, R.: A theory of structural stationarity in the π-Calculus (under revision) (2007)
12. Milner, R.: Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, Cambridge (1999)
13. Meyer, R., Khomenko, V., Strazny, T.: A practical approach to verification of mobile systems using net unfoldings. Technical Report CS-TR-1064, School of Computing Science, Newcastle University (2008), URL: http://www.cs.ncl.ac.uk/research/pubs/trs/abstract.php?number=1064
14. Orava, F., Parrow, J.: An algebraic verification of a mobile network. Formal Aspects of Computing 4(6), 497-543 (1992)
15. Pistore, M.: History Dependent Automata. PhD thesis, Dipartimento di Informatica, Universit à di Pisa (1999)
16. Sangiorgi, D., Walker, D.: The π-Calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
17. Valmari, A.: Lectures on Petri Nets I: Basic Models. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 429-528. Springer, Heidelberg (1998)
18. Victor, B., Moller, F.: The mobility workbench: A tool for the π-Calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 428-440. Springer, Heidelberg (1994)