Ugo Montanari
- Aceto and Murphy, 1993 Aceto, L., Murphy, D., On the Ill-timed but Well-caused, CONCUR'93, LNCS 715, 97-111, 1993. Full version to appear in Acta Informatica. Google Scholar
Digital Library
- Boreale and Sangiorgi, 1994 Boreale, M and Sangiorgi, D., A Fully Abstract Semantics of Causality in the pi-calculus. Tech. Rep. ECS-LFCS-94-297, University of Edinburgh, 1994. Also in Proc. STACS'95, Springer LNCS 900.Google Scholar
- Boudol and Castellani, 1991 G. Boudol and I. Castellani, Flow Models of Distributed Computations: Three Equivalent Semantics for CCS, INRIA Report 1484 (July 1991). Also Information and Computation.Google Scholar
- Boudol et al., 1993 Boudol, G., Castellani, I., Hennessy, M. and Kiehn, A., Observing localities, Theoretical Computer Science, 114: 31--61, 1993. Google ScholarDigital Library
- Bueno et al., 1994 Bueno, F., Garcia de la Banda, M.J., Hermenegildo, M., Rossi, F. and Montanari, U., Towards a Concurrent Semantics Based Analysis of CC and CLP, in Alan Borning, Ed., Principles and Practice of Constraint Programming, Springer LNCS 874, pp. 151-161. Google ScholarDigital Library
- Bueno et al., 1994b Bueno, F., Garcia de la Banda, M.J., Hermenegildo, M., Montanari, U. and Rossi, F., From Eventual to Atomic and Locally Atomic CC Programs: A Concurrent Semantics, in: Giorgio Levi and Mario Rodriguez-Artalejo, Eds. Algebraic and Logic Programming, Springer LNCS 850, pp. 114-132. Full paper to appear in Science of Computer Programming, available from ftp://ftp.di.unipi.i t/pub/Papers/rossi/scp.ps.Z. Google ScholarDigital Library
- Corradini et al., 1994 Corradini, A., Ehrig, H., Loewe, M., Montanari, U. and Rossi, F., Abstract Graph Derivations in the Double Pushout Approach, in: Hans Juergen Schneider and Hartmut Ehrig, Eds., Graph Transformations in Computer Science, Springer LNCS 776, pp. 104-118, 1994. Google ScholarDigital Library
- Corradini et al., 1996b Corradini, A., Ehrig, H., Loewe, M., Montanari, U. and Rossi, F., An Event Structure Semantics for Graph Grammars with Parallel Productions, in: J. Cuny, H. Ehrig, G. Engels and G. Rozenberg, Eds., Graph Grammars and Their Application to Computer Science, Springer LNCS 1073, pp.240-256. Google ScholarDigital Library
- Corradini et al., 1997 Corradini, A., Ehrig, H., Loewe, M., Montanari, U. and Rossi, F., Abstract Approach to Graph Transformation II: Models of Computation in the Double Pushout Approach, in: G Rozenberg et al., Eds., The Handbook of Graph Rewriting, to appear. Copies can be obtained from [email protected].Google Scholar
- Corradini et al., 1990 Corradini, A., Ferrari G. L. and Montanari, U., Transition Systems with Algebraic Structure as Models of Computations, in: I. Guessarian, Ed., Semantics of Systems of Concurrent Processes, Springer LNCS 469, 1990, pp.185-222. Google ScholarDigital Library
- Corradini et al., 1995 Corradini, A., Gadducci, F. and Montanari, U., Relating Two Categorical Models of Term Rewriting, in: Jieh Hsiang, Ed., Rewriting Techniques and Applications, LNCS 914, 1995, pp. 225-240. Google ScholarDigital Library
- Corradini and Montanari, 1992 Corradini, A. and Montanari, U., An Algebraic Semantics for Structured Transition Systems and its Application to Logic Programs, TCS 103 (1992) pp. 51-106. Google ScholarDigital Library
- Corradini et al., 1996 Corradini, A., Montanari, U. and Rossi, F., Graph Processes, Fundamenta Informaticae, vol. 26, n 3/4 (1996) pp.241-265. Google ScholarDigital Library
- Darondeau and Degano, 1989 Ph. Darondeau and P. Degano. Causal trees, Proc. ICALP'89, LNCS 372, Springer 1989. Google ScholarDigital Library
- Degano et al., 1988 Degano, P., De Nicola, R. and Montanari, U., A Distributed Operational Semantics For CCS Based On Condition/Event Systems, Acta Informatica 26, pp.59-91 (1988). Google ScholarDigital Library
- Degano et al., 1989 Degano, P., De Nicola, R. and Montanari, U., Partial Orderings Descriptions and Observations of Nondeterministic Concurrent Processes, in: J. de Bakker, W. de Roever, and G. Rozenberg Eds., Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, Springer 1989, pp.438-466. Google ScholarDigital Library
- Degano et al., 1989b Degano, P., Meseguer, J. and Montanari, U., Axiomatizing Net Computations and Processes, Proc. 4th Symp. on Logics in Computer Science, IEEE 1989, pp. 175-185. Full paper in Acta Informatica Vol.33(7), (October 1996) pp.641-667. Google ScholarDigital Library
- Ferrari et al., 1996 Ferrari, G., Ferro, G., Gnesi, S., Montanari, U., Pistore, M. and Ristori, G., An automata based verification environment for mobile processes, draft submitted for publication. Copies can be obtained from [email protected].Google Scholar
- Ferrari and Montanari, 1995 Ferrari, G.L. and Montanari, U., Dynamic Matrices and the Cost Analysis of Concurrent Programs, in: V. S. Alagar, Maurice Nivat, Eds., Algebraic Methodology and Software Technology 1995, Springer LNCS 936, pp. 307-321. Google ScholarDigital Library
- Gadducci and Montanari, 1995 Gadducci, F., and Montanari, U., Enriched Categories as Models of Computation, in: Alfredo De Santis, Ed., Fifth Italian Conference on Theoretical Computer Science, pp. 20-42, World Scientific,1995. Paper available from http://www.di.unipi.it/~gadducci/papers/ICTCS95.ps.Google Scholar
- Gadducci and Montanari, 1996 Gadducci, F. and Montanari, U., The Tile Model, Technical Report TR-96/27, Dipartimento di Informatica, University of Pisa, June 1996. Paper available from http://www.di.unipi.it/~gadducci/papers/TR-96-27.ps.gz. Google ScholarDigital Library
- Gadducci and Montanari, 1996b Gadducci, F. and Montanari, U., Tiles, Rewriting Rules and CCS, in: J. Meseguer, Ed., Procs. Rewriting Logic and Applications, First International Workshop, ENTCS, pp.1-19, August 1996. Paper available from http://www.di.unipi.it/~gadducci/papers/RLW96.ps.Google Scholar
- Goltz and Mycroft, 1984 Goltz, U. and Mycroft, A., On the Relationships of CCS and Petri Nets, in Proc. 11th ICALP (J. Paredaens, Ed.), LNCS, 172, (Springer-Verlag, Heidelberg, 1984) pp. 196-208. Google ScholarDigital Library
- Gorrieri and Montanari, 1995 Gorrieri, R. and Montanari, U., On the Implementation of Concurrent Calculi into Net Calculi: Two Case Studies, TCS 141, 1-2, 1995 pp.195-252. Google ScholarDigital Library
- Gorrieri et al., 1995 Gorrieri, R., Roccetti, M. and Stancapiano, E., A Theory of Processes with Durational Actions, TCS 140, 1995. Google ScholarDigital Library
- Laneve and Montanari, 1996 Laneve, C. and Montanari, U., Axiomatizing Permutation Equivalence, Math. Struct. in Comp. Sc. (1996), vol.6, pp.219-249.Google ScholarCross Ref
- Larsen and Xinxin, 1990 Larsen, K.G. and Xinxin, L., Compositionality Through an Operational Semantics of Contexts, Proc. ICALP' 90, LNCS 443, 1990, pp. 526-539. Google ScholarDigital Library
- Milner et al., 1995 Milner, R., Parrow, J. and Walker, D., A Calculus of Mobile Processes (parts I and II), Information and Computation, 100:1--77, 1992. Google ScholarDigital Library
- Meseguer, 1992 Meseguer , J., Conditional Rewriting Logic as a Unified Model of Concurrency, Theoretical Computer Science, 96:73--155, 1992. Google ScholarDigital Library
- Meseguer et al., 1996 Meseguer, J., Montanari, U and Sassone, V., Process versus Unfolding Semantics for Place/Transition Petri Nets, TCS, Volume 153, issue 1-2, pages 171-210. Google ScholarDigital Library
- Montanari and Pistore, 1995 Montanari, U. and Pistore, M., Checking Bisimilarity for Finitary pi-calculus, in: Insup Lee, Scott A. Smolka, Eds., CONCUR'95: Concurrency Theory, Springer LNCS 962, pp. 42-56. Google ScholarDigital Library
- Montanari and Pistore, 1996 Montanari, U. and Pistore, M., History Dependent Verification for Partial Order Systems, in: Peled, Vaughan, and Holzmann, Eds., Procs. POMIV'96, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, to appear. Copies can be obtained from [email protected]. Google ScholarDigital Library
- Montanari and Pistore, 1996b Montanari, U. and Pistore, M., History-Dependent Automata, Technical Report, Dipartimento di Informatica, Pisa, to appear. Draft available from ftp://ftp.di.unipi.it/pub/Papers/pistore/HDautomata.ps.gz. Google ScholarDigital Library
- Montanari and Pistore, 1997 Montanari, U. and Pistore, M., Minimal Transition Systems for History-Preserving Bisimulation, to appear in Procs. STACS'97. Paper available from ftp://ftp.di.unipi.it/pub/Papers/pistore/pnets.ps.gz. Google ScholarDigital Library
- Montanari et al., 1996 Montanari, U., Pistore, M., and Yankelevich, D., Efficient Minimization up to Location Equivalence, in: Hanne Riis Nielson, Ed., Programming Languages and Systems - ESOP'96, Springer LNCS 1058, pp. 265-279. Google ScholarDigital Library
- Montanari and Rossi, 1991 Montanari, U. and Rossi, F., True-Concurrency in Concurrent Constraint Programming, in V. Saraswat and K. Ueda, Eds., Proc. International Logic Programming Symposium '91, MIT Press, pp. 694-713.Google Scholar
- Montanari and Rossi, 1994 Montanari, U. and Rossi, F., Contextual Occurrence Nets and Concurrent Constraint Programming, in: Hans Juergen Schneider and Hartmut Ehrig, Eds., Graph Transformations in Computer Science, Springer LNCS 776, pp. 280-295, 1994. Google ScholarDigital Library
- Montanari and Rossi, 1996 Montanari, U., and Rossi, F., Graph Rewriting and Constraint Solving for Modelling Distributed Systems with Synchronization, Proc. COORDINATION'96, in: Paolo Ciancarini and Chris Hankin, Eds., Coordination Languages and Models, LNCS 1061, 1996, pp. 12-27. Google ScholarDigital Library
- Montanari and Yankelevich, 1995 Montanari, U. and Yankelevich, D., Location Equivalence in a Parametric Setting, TCS 149 (1995), pp.299-332. Google ScholarDigital Library
- Olderog, 1987 Olderog, E.-R. Operational Petri Net Semantics for CCSP. In Advances in Petri Nets 1987, (G. Rozenberg, Ed.) LNCS, 266, Springer,1987, pp. 196-223. Google ScholarDigital Library
- Priami, 1996 Priami, C., Enhanced Operational Semantics for Concurrency, PhD thesis 8/96, Dipartimento di Informatica, University of Pisa, 1996.Google Scholar
- Saraswat, 1993 Saraswat, V., Concurrent Constraint Programming, MIT Press, 1993. Google ScholarDigital Library
- Winskel, 1982 Winskel, G. Event Structures for CCS and Related Languages, Proc. 9th ICALP, (M. Nielsen, and E. M. Schmidt, Eds), LNCS, 140 , Springer, 1982, pp. 561-576. Google ScholarDigital Library
Index Terms
- Causal computing
Index terms have been assigned to the content through auto-classification.
Recommendations
Causal inference and causal explanation with background knowledge
UAI'95: Proceedings of the Eleventh conference on Uncertainty in artificial intelligenceThis paper presents correct algorithms for answering the following two questions; (i) Does there exist a causal explanation consistent with a set of background knowledge which explains all of the observed independence facts in a sample? (ii) Given that ...
Ubiquitous Computing: Are We There Yet?
The widespread deployment of technologies like mobile phones continues to drive new applications and to open research opportunities.
Causal Decision Trees
Uncovering causal relationships in data is a major objective of data analytics. Currently, there is a need for scalable and automated methods for causal relationship exploration in data. Classification methods are fast and they could be practical ...
Comments