default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTommaso Bolognesi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j19]Tommaso Bolognesi
:
Integrated Information in Process-Algebraic Compositions. Entropy 21(8): 805 (2019)- [c24]Tommaso Bolognesi:
Single-Step and Asymptotic Mutual Information in Bipartite Boolean Nets. From Software Engineering to Formal Methods and Tools, and Back 2019: 519-530 - 2017
- [j18]Tommaso Bolognesi, Vincenzo Ciancia:
Exploring nominal cellular automata. J. Log. Algebraic Methods Program. 93: 23-41 (2017) - [c23]Tommaso Bolognesi:
LOTOS-Like Composition of Boolean Nets and Causal Set Construction. ModelEd, TestEd, TrustEd 2017: 27-47 - 2016
- [c22]Tommaso Bolognesi, Vincenzo Ciancia:
Nominal Cellular Automata. ICE 2016: 24-35 - 2010
- [j17]Tommaso Bolognesi:
Causal Sets from Simple Models of Computation. Int. J. Unconv. Comput. 6(6): 489-524 (2010) - [i2]Tommaso Bolognesi:
Causal sets from simple models of computation. CoRR abs/1004.3128 (2010) - [i1]Tommaso Bolognesi:
Buiding Discrete Spacetimes by Simple Deterministic Computations. ERCIM News 2010(83): 52-53 (2010)
2000 – 2009
- 2009
- [j16]Tommaso Bolognesi:
A pseudo-random network mobile automaton with linear growth. Inf. Process. Lett. 109(13): 668-674 (2009) - 2008
- [j15]Tommaso Bolognesi:
Planar Trinet Dynamics with Two Rewrite Rules. Complex Syst. 18(1) (2008) - [j14]Tommaso Bolognesi:
Predicates for state changes vs. processes for event patterns. Stud. Inform. Univ. 6(2): 196-235 (2008) - 2007
- [j13]Tommaso Bolognesi:
Behavioral complexity indicators for process algebra: The NKS approach. J. Log. Algebraic Methods Program. 72(1): 50-77 (2007) - [c21]Tommaso Bolognesi:
Planar Trivalent Network Computation. MCU 2007: 146-157 - 2005
- [j12]Tommaso Bolognesi, John Derrick:
Introduction. Softw. Syst. Model. 4(3): 234-235 (2005) - [c20]Tommaso Bolognesi:
Process Algebra Under the Light of Wolfram's NKS. APC 25 2005: 101-105 - 2004
- [j11]Tommaso Bolognesi:
Predicates for state changes vs. processes for event patterns. Stud. Inform. Univ. 3(1): 85-124 (2004) - [c19]Tommaso Bolognesi:
Composing Event Constraints in State-Based Specification. FORTE 2004: 13-32 - [c18]Tommaso Bolognesi:
A Conceptual Framework for State-Based and Event-Based Formal Behavioural Specification Languages. ICECCS 2004: 107-116 - 2003
- [c17]Tommaso Bolognesi, Egon Börger:
Abstract State Processes. Abstract State Machines 2003: 22-32 - [c16]Egon Börger, Tommaso Bolognesi:
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes. Abstract State Machines 2003: 218-228 - 2002
- [c15]Tommaso Bolognesi:
What happens? On notions of event in formal methods and elsewhere. OPODIS 2002: 1-3 - 2000
- [j10]Tommaso Bolognesi:
Toward Constraint-Object-Oriented Development. IEEE Trans. Software Eng. 26(7): 594-616 (2000) - [e1]Tommaso Bolognesi, Diego Latella:
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 Verification (PSTV XX), October 10-13, 2000, Pisa, Italy. IFIP Conference Proceedings 183, Kluwer 2000, ISBN 0-7923-7968-3 [contents]
1990 – 1999
- 1999
- [c14]Tommaso Bolognesi, Andrea Bracciali:
Formal specification of discrete systems by active predicates and dynamic constraints (Short Paper). FMOODS 1999 - 1998
- [j9]Joost-Pieter Katoen, Rom Langerak, Ed Brinksma, Diego Latella, Tommaso Bolognesi:
A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions. Formal Methods Syst. Des. 12(2): 189-216 (1998) - [j8]Tommaso Bolognesi, John Derrick:
Constraint-oriented style for object-oriented formal specification. IEE Proc. Softw. 145(2-3): 61-70 (1998) - [j7]Tommaso Bolognesi, Franco Accordino:
A Layer on Top of Prolog for Composing Behavioural Constraints. Softw. Pract. Exp. 28(13): 1415-1435 (1998) - 1997
- [j6]Tommaso Bolognesi:
Expressive Flexibility of a Constraint-Oriented Notation. Comput. J. 40(5): 277-259 (1997) - 1996
- [j5]Tommaso Bolognesi:
Regrouping Parallel Processes. Formal Methods Syst. Des. 9(3): 263-302 (1996) - 1994
- [j4]Tommaso Bolognesi, Elie Najm, Paul A. J. Tilanus:
G-LOTOS: A Graphical Language for Concurrent Systems. Comput. Networks ISDN Syst. 26(9): 1101-1127 (1994) - 1993
- [j3]Tommaso Bolognesi:
Deriving Graphical Representations of Process Networks from Algebraic Expressions. Inf. Process. Lett. 46(6): 289-294 (1993) - [c13]Tommaso Bolognesi, Giuseppe Ciaccio:
Cumulating constraints on the "WHEN" and the "WHAT". FORTE 1993: 433-448 - 1992
- [c12]Tommaso Bolognesi:
The electric power of LOTOS - Results of a joint academic/industrial experiment. FORTE 1992: 431-446 - 1991
- [j2]Tommaso Bolognesi, Olof Hagsand, Diego Latella, Björn Pehrson:
The Definition of a Graphical G-LOTOS Editor Using the Meta-Tool LOGGIE. Comput. Networks ISDN Syst. 22(1): 61-77 (1991) - [c11]Tommaso Bolognesi, Ferdinando Lucidi:
LOTOS-like Process Algebras with Urgent or Timed Interactions. FORTE 1991: 249-264 - [c10]Tommaso Bolognesi, Ferdinando Lucidi:
Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator. REX Workshop 1991: 124-148 - [c9]Tommaso Bolognesi, Diego Latella, Elisabetta Zuppa:
Non-standard Interpretations of LOTOS Specifications. TAPSOFT, Vol.2 1991: 217-234 - 1990
- [c8]Tommaso Bolognesi:
On the soundness of graphical representations of interconnected processes in LOTOS. Formal Methods in Software Development 1990: 1-7 - [c7]Tommaso Bolognesi, David de Frutos-Escrig, Yolanda Ortega-Mallén:
Graphical Composition Theorems for Parallel and Hiding Operators. FORTE 1990: 459-470 - [c6]Tommaso Bolognesi:
A Graphical Composition Theorem for Networks of Lotos Processes. ICDCS 1990: 88-95 - [c5]Tommaso Bolognesi, Ferdinando Lucidi, Sebastiano Trigila:
From timed Petri nets to timed LOTOS. PSTV 1990: 395-408
1980 – 1989
- 1989
- [c4]Tommaso Bolognesi, Diego Latella:
Techniques for the formal definition of the G-LOTOS syntax. VL 1989: 43-49 - 1988
- [c3]Tommaso Bolognesi, Maurizio Caneve:
Squiggles - A Tool for the Analysis of LOTOS Specifications. FORTE 1988: 201-216 - 1987
- [j1]Tommaso Bolognesi, Ed Brinksma:
Introduction to the ISO Specification Language LOTOS. Comput. Networks 14: 25-59 (1987) - [c2]Tommaso Bolognesi, Scott A. Smolka:
Fundamental Results for the Verification of Observational Equivalence: A Survey. PSTV 1987: 165-179 - 1984
- [c1]Tommaso Bolognesi, Harry Rudin:
On the Analysis of Time-Dependent Protocols by Network Flow Algorithms. PSTV 1984: 491-513
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
