메뉴 건너뛰기
Information Processing Letters
Volumn 109, Issue 15, 2009, Pages 850-855
EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system
Author keywords

BPP net; Concurrency; Petri net; Simulation preorder and equivalence; Trace preorder and equivalence
Indexed keywords

BPP-NET; CONCURRENCY; FINITE STATE SYSTEMS; LOWER BOUNDS; PROCESS ALGEBRAS; SIMULATION PREORDER; SIMULATION PREORDER AND EQUIVALENCE; TRACE PREORDER AND EQUIVALENCE;
EID: 67349210997     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.04.003     Document Type: Article
Times cited : (3)
References (15)
  • 1
    • 84958978941 scopus 로고    scopus 로고
    • On the complexity of the linear-time μ-calculus for Petri nets
    • Proc. ICATPN'97
    • Habermehl P. On the complexity of the linear-time μ-calculus for Petri nets. Proc. ICATPN'97. LNCS vol. 1248 (1997) 102-116
    • (1997) LNCS , vol.1248 , pp. 102-116
    • Habermehl, P.1
  • 2
    • 84957655964 scopus 로고
    • High undecidability of weak bisimilarity for Petri nets
    • Proc. CAAP'95
    • Jančar P. High undecidability of weak bisimilarity for Petri nets. Proc. CAAP'95. LNCS vol. 915 (1995) 349-363
    • (1995) LNCS , vol.915 , pp. 349-363
    • Jančar, P.1
  • 3
    • 84947727789 scopus 로고
    • Checking regular properties of Petri nets
    • Proc. CONCUR'95
    • Jančar P., and Moller F. Checking regular properties of Petri nets. Proc. CONCUR'95. LNCS vol. 962 (1995) 348-362
    • (1995) LNCS , vol.962 , pp. 348-362
    • Jančar, P.1    Moller, F.2
  • 4
    • 29144432152 scopus 로고    scopus 로고
    • Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
    • Kot M., and Sawa Z. Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. ENTCS 138 (2005) 49-60
    • (2005) ENTCS , vol.138 , pp. 49-60
    • Kot, M.1    Sawa, Z.2
  • 5
    • 0037088946 scopus 로고    scopus 로고
    • Simulation preorder over simple process algebras
    • Kučera A., and Mayr R. Simulation preorder over simple process algebras. Information and Computation 173 2 (2002) 184-198
    • (2002) Information and Computation , vol.173 , Issue.2 , pp. 184-198
    • Kučera, A.1    Mayr, R.2
  • 6
    • 84874715172 scopus 로고    scopus 로고
    • Why is simulation harder than bisimulation?
    • Proc. CONCUR'02
    • Kučera A., and Mayr R. Why is simulation harder than bisimulation?. Proc. CONCUR'02. LNCS vol. 2421 (2002) 594-609
    • (2002) LNCS , vol.2421 , pp. 594-609
    • Kučera, A.1    Mayr, R.2
  • 7
    • 84878630347 scopus 로고    scopus 로고
    • The state-explosion problem from trace to bisimulation equivalence
    • Proc. FoSSaCS'00
    • Laroussinie F., and Schnoebelen P. The state-explosion problem from trace to bisimulation equivalence. Proc. FoSSaCS'00. LNCS vol. 1784 (2000) 192-207
    • (2000) LNCS , vol.1784 , pp. 192-207
    • Laroussinie, F.1    Schnoebelen, P.2
  • 8
    • 0003945252 scopus 로고
    • The reachability problem requires exponential space
    • Tech. Rep. 62, Department of Computer Science, Yale University
    • R. Lipton, The reachability problem requires exponential space, Tech. Rep. 62, Department of Computer Science, Yale University, 1976
    • (1976)
    • Lipton, R.1
  • 10
    • 0001452222 scopus 로고    scopus 로고
    • Complexity of equivalence problems for concurrent systems of finite agents
    • Rabinowich A. Complexity of equivalence problems for concurrent systems of finite agents. Information and Computation 139 2 (1997) 111-129
    • (1997) Information and Computation , vol.139 , Issue.2 , pp. 111-129
    • Rabinowich, A.1
  • 11
    • 0000660737 scopus 로고
    • The covering and boundedness problems for vector addition systems
    • Rackoff C. The covering and boundedness problems for vector addition systems. Theoret. Comput. Sci. 6 1 (1978) 223-231
    • (1978) Theoret. Comput. Sci. , vol.6 , Issue.1 , pp. 223-231
    • Rackoff, C.1
  • 12
    • 35248821677 scopus 로고    scopus 로고
    • Equivalence checking of non-flat systems is exptime-hard
    • Proc. CONCUR'03
    • Sawa Z. Equivalence checking of non-flat systems is exptime-hard. Proc. CONCUR'03. LNCS vol. 2761 (2003) 237-250
    • (2003) LNCS , vol.2761 , pp. 237-250
    • Sawa, Z.1
  • 13
    • 84947729408 scopus 로고    scopus 로고
    • On the complexity of relational problems for finite state processes
    • Proc. ICALP'96
    • Shukla S.K., Hunt H.B., Daniel I., Rosenkrantz J., and Stearns R.E. On the complexity of relational problems for finite state processes. Proc. ICALP'96. LNCS vol. 1099 (1996) 466-477
    • (1996) LNCS , vol.1099 , pp. 466-477
    • Shukla, S.K.1    Hunt, H.B.2    Daniel, I.3    Rosenkrantz, J.4    Stearns, R.E.5
  • 14
    • 0038493871 scopus 로고    scopus 로고
    • Strong bisimilarity of simple process algebras: Complexity lower bounds
    • Srba J. Strong bisimilarity of simple process algebras: Complexity lower bounds. Acta Informatica 39 (2003) 469-499
    • (2003) Acta Informatica , vol.39 , pp. 469-499
    • Srba, J.1
  • 15
    • 84874678723 scopus 로고    scopus 로고
    • Alphabet-based synchronisation is exponentially cheaper
    • Proc. CONCUR'02
    • Valmari A., and Kervinen A. Alphabet-based synchronisation is exponentially cheaper. Proc. CONCUR'02. LNCS vol. 2421 (2002) 161-176
    • (2002) LNCS , vol.2421 , pp. 161-176
    • Valmari, A.1    Kervinen, A.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.