Tommaso Bolognesi - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Tommaso Bolognesi' as author, editor, or advisor:

From timed Petri nets to timed LOTOSTommaso Bolognesi, Ferdinando Lucidi, Sebastiano Trigila. pstv 1990: 395-408
Planar Trinet Dynamics with Two Rewrite RulesTommaso Bolognesi. compsys, 18(1), 2008. [doi]
Planar Trivalent Network ComputationTommaso Bolognesi. mcu 2007: 146-157 [doi]
Techniques for the formal definition of the G-LOTOS syntaxTommaso Bolognesi, Diego Latella. vl 1989: 43-49 [doi]
Integrated Information in Process-Algebraic CompositionsTommaso Bolognesi. entropy, 21(8):805, 2019. [doi]
A Consistent Causality-Based View on a Timed Process Algebra Including Urgent InteractionsJoost-Pieter Katoen, Rom Langerak, Ed Brinksma, Diego Latella, Tommaso Bolognesi. fmsd, 12(2):189-216, 1998.
Toward Constraint-Object-Oriented DevelopmentTommaso Bolognesi. TSE, 26(7):594-616, 2000. [doi]
Process Algebra Under the Light of Wolfram s NKSTommaso Bolognesi. ENTCS, 162:101-105, 2006. [doi]
IntroductionTommaso Bolognesi, John Derrick. SoSyM, 4(3):234-235, 2005. [doi]
Behavioral complexity indicators for process algebra: The NKS approachTommaso Bolognesi. jlp, 72(1):50-77, 2007. [doi]
Formal specification of discrete systems by active predicates and dynamic constraints (Short Paper)Tommaso Bolognesi, Andrea Bracciali. fmoods 1999:
Regrouping Parallel ProcessesTommaso Bolognesi. fmsd, 9(3):263-302, 1996.
Buiding Discrete Spacetimes by Simple Deterministic ComputationsTommaso Bolognesi. ercim, 2010(83):52-53, 2010. [doi]
Predicates for state changes vs. processes for event patternsTommaso Bolognesi. siu, 3(1):85-124, 2004. [doi]
A pseudo-random network mobile automaton with linear growthTommaso Bolognesi. ipl, 109(13):668-674, 2009. [doi]
Single-Step and Asymptotic Mutual Information in Bipartite Boolean NetsTommaso Bolognesi. BIRTHDAY 2019: 519-530 [doi]
A Layer on Top of Prolog for Composing Behavioural ConstraintsTommaso Bolognesi, Franco Accordino. SPE, 28(13):1415-1435, 1998.
On the soundness of graphical representations of interconnected processes in LOTOSTommaso Bolognesi. fmsd 1990: 1-7 [doi]
Cumulating constraints on the WHEN and the WHAT Tommaso Bolognesi, Giuseppe Ciaccio. forte 1994: 433-448
Causal Sets from Simple Models of ComputationTommaso Bolognesi. ijuc, 6(6):489-524, 2010. [doi]
LOTOS-Like Composition of Boolean Nets and Causal Set ConstructionTommaso Bolognesi. BIRTHDAY 2017: 27-47 [doi]
A Graphical Composition Theorem for Networks of Lotos ProcessesTommaso Bolognesi. icdcs 1990: 88-95
Squiggles - A Tool for the Analysis of LOTOS SpecificationsTommaso Bolognesi, Maurizio Caneve. forte 1989: 201-216
What happens? On notions of event in formal methods and elsewhereTommaso Bolognesi. opodis 2002: 1-3
Deriving Graphical Representations of Process Networks from Algebraic ExpressionsTommaso Bolognesi. ipl, 46(6):289-294, 1993.
A Conceptual Framework for State-Based and Event-Based Formal Behavioural Specification LanguagesTommaso Bolognesi. ICECCS 2004: 107-116 [doi]
Graphical Composition Theorems for Parallel and Hiding OperatorsTommaso Bolognesi, David de Frutos-Escrig, Yolanda Ortega-Mallén. forte 1991: 459-470
Remarks on Turbo ASMs for Functional Equations and Recursion SchemesEgon Börger, Tommaso Bolognesi. asmta 2003: 218-228 [doi]
LOTOS-like Process Algebras with Urgent or Timed InteractionsTommaso Bolognesi, Ferdinando Lucidi. forte 1992: 249-264
Expressive Flexibility of a Constraint-Oriented NotationTommaso Bolognesi. cj, 40(5):277-259, 1997.
Abstract State ProcessesTommaso Bolognesi, Egon Börger. asmta 2003: 22-32 [doi]
Non-standard Interpretations of LOTOS SpecificationsTommaso Bolognesi, Diego Latella, Elisabetta Zuppa. tapsoft 1991: 217-234
Introduction to the ISO Specification Language LOTOSTommaso Bolognesi, Ed Brinksma. cn, 14:25-59, 1987.
On the Analysis of Time-Dependent Protocols by Network Flow AlgorithmsTommaso Bolognesi, Harry Rudin. pstv 1985: 491-513
Fundamental Results for the Verification of Observational Equivalence: A SurveyTommaso Bolognesi, Scott A. Smolka. pstv 1987: 165-179
Constraint-oriented style for object-oriented formal specificationTommaso Bolognesi, John Derrick. iee, 145(2-3):61-70, 1998.
Exploring nominal cellular automataTommaso Bolognesi, Vincenzo Ciancia. jlp, 93:23-41, 2017. [doi]
Predicates for state changes vs. processes for event patternsTommaso Bolognesi. siu, 6(2):196-235, 2008. [doi]
Formal Techniques for Distributed System Development, FORTE/PSTV 2000, IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Tommaso Bolognesi, Diego Latella, editors, Volume 183 of IFIP Conference Proceedings, Kluwer, 2000.
Composing Event Constraints in State-Based SpecificationTommaso Bolognesi. forte 2004: 13-32 [doi]
The electric power of LOTOS - Results of a joint academic/industrial experimentTommaso Bolognesi. forte 1993: 431-446
Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary OperatorTommaso Bolognesi, Ferdinando Lucidi. rex 1992: 124-148

runs on WebDSL