{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:49:23Z","timestamp":1764305363413,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662468227"},{"type":"electronic","value":"9783662468234"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46823-4_13","type":"book-chapter","created":{"date-parts":[[2015,4,18]],"date-time":"2015-04-18T01:40:54Z","timestamp":1429321254000},"page":"151-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Process Opacity for Timed Process Algebra"],"prefix":"10.1007","author":[{"given":"Damas P.","family":"Gruska","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,19]]},"reference":[{"key":"13_CR1","unstructured":"Bryans, J., Koutny, M., Ryan, P.: Modelling non-deducibility using Petri Nets. In: Proceedings of the 2nd International Workshop on Security Issues with Petri Nets and Other Computational Models (2004)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11679219_7","volume-title":"Formal Aspects in Security and Trust","author":"JW Bryans","year":"2006","unstructured":"Bryans, J.W., Koutny, M., Mazar\u00e9, L., Ryan, P.Y.A.: Opacity generalised to transition systems. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2005. LNCS, vol. 3866, pp. 81\u201395. Springer, Heidelberg (2006)"},{"key":"13_CR3","unstructured":"Focardi, R., Gorrieri, R., Martinelli, F.: Information flow analysis in a discrete-time process algebra. In: Proceedings of 13th Computer Security Foundation Workshop. IEEE Computer Society Press (2000)"},{"issue":"1\u20133","key":"13_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2004.01.001","volume":"50","author":"R Gorrieri","year":"2004","unstructured":"Gorrieri, R., Martinelli, F.: A simple framework for real-time cryptographic protocol analysis with compositional proof rules. Sci. Comput. Program. 50(1\u20133), 23\u201349 (2004)","journal-title":"Sci. Comput. Program."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security Models. In: Proceedings of IEEE Symposium on Security and Privacy (1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/BFb0039069","volume-title":"CONCUR 1990 Theories of Concurrency: Unification and Extension","author":"JF Groote","year":"1990","unstructured":"Groote, J.F.: Transition system specifications with negative premises. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 332\u2013341. Springer, Heidelberg (1990)"},{"issue":"3\u20134","key":"13_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.3233\/FI-2012-763","volume":"120","author":"DP Gruska","year":"2012","unstructured":"Gruska, D.P.: Informational analysis of security and integrity. Fundamenta Informaticae 120(3\u20134), 295\u2013309 (2012)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR8","unstructured":"Test based security: Concurrency, Specification and Verification CS&P 2012, Berlin, vol. 1 (2012)"},{"issue":"1","key":"13_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.3233\/FI-2010-297","volume":"102","author":"DP Gruska","year":"2010","unstructured":"Gruska, D.P.: Process algebra contexts and security properties. Fundamenta Informaticae 102(1), 63\u201376 (2010)","journal-title":"Fundamenta Informaticae"},{"issue":"3\u20134","key":"13_CR10","first-page":"335","volume":"79","author":"DP Gruska","year":"2007","unstructured":"Gruska, D.P.: Observation based system security. Fundamenta Informaticae 79(3\u20134), 335\u2013346 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, ACM (1983)","DOI":"10.1145\/800221.806724"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46823-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:40:30Z","timestamp":1676940030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46823-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662468227","9783662468234"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46823-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"19 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}